Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative linear solution”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

An iterative finite difference method for solving the quantum hydrodynamic equations of motion

The quantum hydrodynamic equations of motion associated with the de Broglie-Bohm description of quantum mechanics describe a time evolving probability density whose 'fluid' elements evolve as a correlated ensemble of particle trajectories. These equations are intuitively appealing due to their similarities with classical fluid dynamics and the appearance of a generalized Newton's equation of motion in which the total force contains both a classical and quantum contribution. However, the direct numerical solution of the quantum hydrodynamic equations (QHE) is fraught with challenges: the probability 'fluid' is highly-compressible, it has zero viscosity, the quantum potential ('pressure') is non-linear, and if that weren't enough the quantum potential can also become singular during the course of the calculations. Collectively these properties are responsible for the notorious numerical instabilities associated with a direct numerical solution of the QHE. The most successful and stable numerical approach that has been used to date is based on the Moving Least Squares (MLS) algorithm. The improved stability of this approach is due to the repeated local least squares fitting which effectively filters or reduces the numerical noise which tends to accumulate with time. However, this method is also subject to instabilities if it is pushed too hard. In addition, the stability of the MLS approach often comes at the expense of reduced resolution or fidelity of the calculation (i.e., the MLS filtering eliminates the higher-frequency components of the solution which may be of interest). Recently, a promising new solution method has been developed which is based on an iterative solution of the QHE using finite differences. This method (referred to as the Iterative Finite Difference Method or IFDM) is straightforward to implement, computationally efficient, stable, and its accuracy and convergence properties are well understood. A brief overview of the IFDM will be presented followed by a couple of benchmark applications on one- and two-dimensional Eckart barrier scattering problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum cluster equilibrium model of N-methylformamide–water binary mixtures

The established quantum cluster equilibrium (QCE) approach is refined and applied to N-methylformamide (NMF) and its aqueous solution. The QCE method is split into two iterative cycles: one which converges to the liquid phase solution of the QCE equations and another which yields the gas phase. By comparing Gibbs energies, the thermodynamically stable phase at a given temperature and pressure is then chosen. The new methodology avoids metastable solutions and allows a different treatment of the mean-field interactions within the gas and liquid phases. These changes are of crucial importance for the treatment of binary mixtures. For the first time in a QCE study, the cis-trans-isomerism of a species (NMF) is explicitly considered. Cluster geometries and frequencies are calculated using density functional theory (DFT) and complementary coupled cluster single point energies are used to benchmark the DFT results. Independent of the selected quantum-chemical method, a large set of clusters is required for an accurate thermodynamic description of the binary mixture. The liquid phase of neat NMF is found to be dominated by the cyclic trans-NMF pentamer, which can be interpreted as a linear trimer that is stabilized by explicit solvation of two further NMF molecules. This cluster reflects the known hydrogen bond network preferences of neat NMF.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Model based multivariable controller for large scale compression stations. Design and experimental validation on the LHC 18KW cryorefrigerator

In this paper, a multivariable model-based non-linear controller for Warm Compression Stations (WCS) is proposed. The strategy is to replace all the PID loops controlling the WCS with an optimally designed model-based multivariable loop. This new strategy leads to high stability and fast disturbance rejection such as those induced by a turbine or a compressor stop, a key-aspect in the case of large scale cryogenic refrigeration. The proposed control scheme can be used to have precise control of every pressure in normal operation or to stabilize and control the cryoplant under high variation of thermal loads (such as a pulsed heat load expected to take place in future fusion reactors such as those expected in the cryogenic cooling systems of the International Thermonuclear Experimental Reactor ITER or the Japan Torus-60 Super Advanced fusion experiment JT-60SA). The paper details how to set the WCS model up to synthesize the Linear Quadratic Optimal feedback gain and how to use it. After preliminary tuning at CEA-Grenoble on the 400W@1.8K helium test facility, the controller has been implemented on a Schneider PLC and fully tested first on the CERN's real-time simulator. Then, it was experimentally validated on a real CERN cryoplant. The efficiency of the solution is experimentally assessed using a reasonable operating scenario of start and stop of compressors and cryogenic turbines. This work is partially supported through the European Fusion Development Agreement (EFDA) Goal Oriented Training Program, task agreement WP10-GOT-GIRO.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Expansion in higher harmonics of boson stars using a generalized Ruffini-Bonazzola approach. Part 1. Bound states

The method pioneered by Ruffini and Bonazzola (RB) to describe boson stars involves an expansion of the boson field which is linear in creation and annihilation operators. This expansion constitutes an exact solution to a non-interacting field theory, and has been used as a reasonable ansatz for an interacting one. In this work, we show how one can go beyond the RB ansatz towards an exact solution of the interacting operator Klein-Gordon equation, which can be solved iteratively to ever higher precision. Our Generalized Ruffini-Bonazzola approach takes into account contributions from nontrivial harmonic dependence of the wavefunction, using a sum of terms with energy $k\,E_0$, where $k\geq1$ and $E_0$ is the chemical potential of a single bound axion. The method critically depends on an expansion in a parameter $\Delta \equiv \sqrt{1-E_0{}^2/m^2}<1$, where $m$ is the mass of the boson. In the case of the axion potential, we calculate corrections which are relevant for axion stars in the transition or dense branches. We find with high precision the local minimum of the mass, $M_{min}\approx 463\,f^2/m$, at $\Delta\approx0.27$, where $f$ is the axion decay constant. This point marks the crossover from transition to dense branches of solutions, and a corresponding crossover from structural instability to stability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimal Voltage Regulation for Unbalanced Distribution Networks Considering Distributed Energy Resources

With increasing penetration of distributed generation in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative quadratic constrained quadratic programming model to minimize voltage deviations and maximize distributed energy resource (DER) active power output in a three phase unbalanced distribution system is developed. The optimization model is based on the linearized sensitivity coefficients between controlled variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DERs). To avoid the oscillation of solution when it is close to the optimum, a golden search method is introduced to control the step size. Numerical simulations on modified IEEE 13 nodes test feeders show the efficiency of the proposed model. Compared to the results solved by heuristic search (harmony algorithm), the proposed model converges quickly to the global optimum.

distributed energy resources↗

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗

Pressure stability in explicitly coupled simulations of poromechanics with application to CO 2 sequestration

We study in detail the pressure stabilizing effects of the non-iterated fixed-stress splitting in poromechanical problems which are nearly undrained and incompressible. When applied in conjunction with a spatial discretization which does not satisfy the discrete inf–sup condition, namely a mixed piecewise linear–piecewise constant spatial discretization, the explicit fixed-stress scheme can have a pressure stabilizing effect in transient problems. This effect disappears, however, upon time step refinement or the attainment of steady state. The interpretation of the scheme as an Augmented Lagrangian method similar to Uzawa iteration for incompressible flow helps explain these results. Moreover, due to the slowly evolving solution within undrained seal regions, we show that the explicit fixed-stress scheme requires very large time steps to reveal its pressure stabilizing effect in examples of geologic CO 2 sequestration. We note that large time steps can result in large errors in drained regions, such as the aquifer or reservoir regions of these examples, and can prevent convergence of nonlinear solvers in the case of multiphase flows, which can make the explicit scheme an unreliable source of pressure stabilization. We conclude by demonstrating that pressure jump stabilization is as effective in the explicit fixed-stress setting as in the fully implicit setting for undrained problems, while maintaining the stability and convergence of the fixed-stress split for drained problems.

58 GEOSCIENCES↗

An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications

In this paper, we explore using the Harrow–Hassidim–Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton–Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms’ scalability and efficiency in domain applications.

hybrid software for QC-HPC↗

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Low-Rank Multigrid Method for the Stochastic Steady-State Diffusion Problem

We study a multigrid method for solving large linear systems of equations with tensor product structure here. Such systems are obtained from stochastic finite element discretization of stochastic partial differential equations such as the steady-state diffusion problem with random coefficients. When the variance in the problem is not too large, the solution can be well approximated by a low-rank object. In the proposed multigrid algorithm, the matrix iterates are truncated to low rank to reduce memory requirements and computational effort. The technique is proved convergent with an analytic error bound. Numerical experiments show its effectiveness in solving the Galerkin systems compared to the original multigrid solver, especially when the number of degrees of freedom associated with the spatial discretization is large.

97 MATHEMATICS AND COMPUTING↗

Validation of the paraxial beam-tracing method in critical cases

Paraxial Wentzel-Kramers-Brillouin (WKB) (beam-tracing) solutions of a scalar wave equation are compared to the exact solutions for the two important cases of reflection from a plasma with linearly increasing density and of oblique propagation in the presence of an absorbing half plane. In these situations, the beam-tracing technique is close to its limits of validity, yet these conditions are often met in practical applications. More specifically, the first case is relevant to reflectometry diagnostics, whereas the second case models the absorption of electron-cyclotron beams obliquely launched onto the resonance layer, as envisaged, for instance, for the ITER upper launcher [M. A. Henderson et al., Nucl. Fusion 48, 054013 (2008)]. In both cases, the beam-tracing approach is found to reproduce well the exact behavior of the wave for experimentally relevant parameters, confirming the robustness of WKB-based techniques close to or even beyond their range of applicability. For the latter case, moreover, the analysis presented here allows an evaluation of the reflection of part of the beam by the steep gradients of the absorption coefficient at the resonance layer, our results yielding an upper bound on the amount of reflected power.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Accurate coarse-grained models for mixtures of colloids and linear polymers under good-solvent conditions

A coarse-graining strategy, previously developed for polymer solutions, is extended here to mixtures of linear polymers and hard-sphere colloids. In this approach, groups of monomers are mapped onto a single pseudoatom (a blob) and the effective blob-blob interactions are obtained by requiring the model to reproduce some large-scale structural properties in the zero-density limit. We show that an accurate parametrization of the polymer-colloid interactions is obtained by simply introducing pair potentials between blobs and colloids. For the coarse-grained (CG) model in which polymers are modelled as four-blob chains (tetramers), the pair potentials are determined by means of the iterative Boltzmann inversion scheme, taking full-monomer (FM) pair correlation functions at zero-density as targets. For a larger number n of blobs, pair potentials are determined by using a simple transferability assumption based on the polymer self-similarity. We validate the model by comparing its predictions with full-monomer results for the interfacial properties of polymer solutions in the presence of a single colloid and for thermodynamic and structural properties in the homogeneous phase at finite polymer and colloid density. The tetramer model is quite accurate for q ≲ 1 (q=R{sup ^}{sub g}/R{sub c}, where R{sup ^}{sub g} is the zero-density polymer radius of gyration and R{sub c} is the colloid radius) and reasonably good also for q = 2. For q = 2, an accurate coarse-grained description is obtained by using the n = 10 blob model. We also compare our results with those obtained by using single-blob models with state-dependent potentials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FIRST PRECISION LIGHT CURVE ANALYSIS OF THE NEGLECTED EXTREME MASS RATIO SOLAR-TYPE BINARY HR BOOTIS

HR Bootis is a neglected binary that is found to be a solar-type (G2V) extreme mass ratio binary (EMRB). It was discovered by Hanley and Shapley in 1940. Surprisingly, little has been published in the intervening years. In 1999 it was characterized by a 0.31587 day orbital period. Since that time it has been observed by various observers who have determined ∼20 timings of minimum light over the past ∼15,000 orbits. Our observations in 2012 represent the first precision curves in the BVR{sub c}I{sub c} Johnson–Cousins wavelength bands. The light curves have rather low amplitudes, averaging some 0.5 magnitudes, yet they exhibit total eclipses, which is typical of the rare group of solar-type EMRBs. An improved linear ephemeris was computed along with a quadratic ephemeris showing a decaying orbit, which indicates magnetic breaking may be occurring. The light curve solution reveals that HR Boo is a contact system with a somewhat low 21% Roche-lobe fill-out but a mass ratio of q = 4.09 (0.2444), which defines it as an EMRB. Two spots, both hot, were allowed to iterate to fit the light curve asymmetries. Their radii are 32° and 16°. Both are high-latitude polar spots indicative of strong magnetic activity. The shallow contact yet nearly equal component temperatures makes it an unusual addition to this group.

79 ASTRONOMY AND ASTROPHYSICS↗

Security-Constrained Unit Commitment with Linearized AC Optimal Power Flow.

We propose a mathematical programming-based approach to optimize the security-constrained unit commitment problem with a full AC transmission network representation. Our approach is based on our previously introduced successive linear programming (SLP) approach to solving the non-linear, nonconvex AC optimal power flow (ACOPF) problem. By linearizing the ACOPF, we are able to leverage powerful commercial mixed-integer solvers to iteratively optimize the combined unit commitment plus ACOPF model. We demonstrate our approach on six-bus, IEEE RTS-96, and IEEE 118-bus test systems. We perform a comparative analysis of the relative impacts of singlebus, DC, and AC transmission network models on the unit commitment and dispatch solutions and their associated costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid iterative approach for simulation of radio-frequency fields in plasma

In this work, a novel iterative approach for solving discretized linear wave equations in a frequency domain, which combines time evolution with iterative relaxation schemes, is presented. In this hybrid approach, each iteration cycle consists of evolution of electromagnetic (EM) fields in time over a specified number of field periods followed by several iterative relaxations. Provided that there is sufficient dissipation, both the time evolution and the iterative relaxations contribute to the convergence of the EM fields to the solution of the formulated full wave boundary value problem. Time evolution rapidly distributes EM fields, propagating with group velocity, over the simulation domain, while the iterative relaxations smooth the fields, reducing the numerical errors such that iteration cycles converge to a steady state solution, approximating the solution of the formulated problem. This approach is intended for large scale simulations which are beyond the capabilities of direct solvers presently used for solving wave equations in the frequency domain. Lastly, the technique is demonstrated for solving wave equations on a regular grid using a cold plasma dielectric model with collisions for 2D modeling of EM fields in tokamak in an electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

24 POWER TRANSMISSION AND DISTRIBUTION↗