Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative solvers”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Adaptive relaxation for the steady-state analysis of Markov chains

We consider a variant of the well-known Gauss-Seidel method for the solution of Markov chains in steady state. Whereas the standard algorithm visits each state exactly once per iteration in a predetermined order, the alternative approach uses a dynamic strategy. A set of states to be visited is maintained which can grow and shrink as the computation progresses. In this manner, we hope to concentrate the computational work in those areas of the chain in which maximum improvement in the solution can be achieved. We consider the adaptive approach both as a solver in its own right and as a relaxation method within the multi-level algorithm. Experimental results show significant computational savings in both cases.

Horton, Graham↗
NASA NTRS1991

Implicit solvers for unstructured meshes

Implicit methods for unstructured mesh computations are developed and tested. The approximate system which arises from the Newton-linearization of the nonlinear evolution operator is solved by using the preconditioned generalized minimum residual technique. These different preconditioners are investigated: the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over-relaxation (SSOR). The preconditioners have been optimized to have good vectorization properties. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also investigated. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.

Venkatakrishnan, V.↗
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗
NASA NTRS1983

Multi-grid calculation of three-dimensional transonic potential flows

A multi-grid algorithm has been developed to speed the iterative convergence of calculations for the transonic potential flow past swept wings and wing-fuselage combinations. The method is based upon a fully-conservative, finite-volume approximation to the steady potential equation which is second-order accurate everywhere in the flow field except near shock waves. The multi-grid scheme is incorporated within the framework of an alternating successive-line-overrelaxation (SLOR) solver of the difference equations. Computed results confirm the second-order accuracy of the scheme, and demonstrate the effectiveness of the multi-grid procedure.

Caughey, D. A.↗
DOE OSTI2023

Training Data Regarding Optimal Power Flow For Efficient Machine Learning

The code is intended to take the data outputted by the MATPOWER OPF solver tools and restructures the data in a way that is best suited for machine learning. The variables are read and the desired values are taken and added to an array in the correct format. This array is then converted into a python array for future use. The code also utilizes MATPOWER's ability to construct different power flow scenarios and repeat them a chosen number of times. Each iteration will add a new line to the formatted array so that the final output is a matrix has a height equal to the number of repetition used.

Seidel, RachaelI↗
NASA NTRS2006

Magnetic Field Solver

The Magnetic Field Solver computer program calculates the magnetic field generated by a group of collinear, cylindrical axisymmetric electromagnet coils. Given the current flowing in, and the number of turns, axial position, and axial and radial dimensions of each coil, the program calculates matrix coefficients for a finite-difference system of equations that approximates a two-dimensional partial differential equation for the magnetic potential contributed by the coil. The program iteratively solves these finite-difference equations by use of the modified incomplete Cholesky preconditioned-conjugate-gradient method. The total magnetic potential as a function of axial (z) and radial (r) position is then calculated as a sum of the magnetic potentials of the individual coils, using a high-accuracy interpolation scheme. Then the r and z components of the magnetic field as functions of r and z are calculated from the total magnetic potential by use of a high-accuracy finite-difference scheme. Notably, for the finite-difference calculations, the program generates nonuniform two-dimensional computational meshes from nonuniform one-dimensional meshes. Each mesh is generated in such a way as to minimize the numerical error for a benchmark one-dimensional magnetostatic problem.

Ilin, Andrew V.↗
NASA NTRS1996

Numerical Modeling of Spray Combustion with an Unstructured-Grid Method

The present unstructured-grid method follows strictly the basic finite volume forms of the conservation laws of the governing equations for the entire flow domain. High-order spatially accurate formulation has been employed for the numerical solutions of the Navier-Stokes equations. A two-equation k-epsilon turbulence model is also incorporated in the unstructured-grid solver. The convergence of the resulted linear algebraic equation is accelerated with preconditioned Conjugate Gradient method. A statistical spray combustion model has been incorporated into the present unstructured-grid solver. In this model, spray is represented by discrete particles, rather than by continuous distributions. A finite number of computational particles are used to predict a sample of total population of particles. Particle trajectories are integrated using their momentum and motion equations and particles exchange mass, momentum and energy with the gas within the computational cell in which they are located. The interaction calculations are performed simultaneously and eliminate global iteration for the two-phase momentum exchange. A transient spray flame in a high pressure combustion chamber is predicted and then the solution of liquid-fuel combusting flow with a rotating cup atomizer is presented and compared with the experimental data. The major conclusion of this investigation is that the unstructured-grid method can be employed to study very complicated flow fields of turbulent spray combustion. Grid adaptation can be easily achieved in any flow domain such as droplet evaporation and combustion zone. Future applications of the present model can be found in the full three-dimensional study of flow fields of gas turbine and liquid propulsion engine combustion chambers with multi-injectors.

Shang, H. M.↗
NASA NTRS2018

Hollow Cathode Thermal Modelling and Self-Consistent Plasma Solution: Work Function Evaluation for a LaB6 Cathode.

Self-heating hollow cathodes are central components in modern electric thrusters. The plasma discharge inside these devices heats the internal components, thus maintaining the temperatures required for electron emission. Precise knowledge of the physical phenomena governing hollow cathode operation is key to predict their lifetime, specifically, their thermionic emission characteristics. A simulation platform has been built to couple plasma and thermal models of the self-heating hollow cathode to produce a self-consistent solution. A self-consistent solution has been found for a LaB6 hollow cathode operating at 25A and 13 sccm where the work function is assumed to be spatially uniform along the emitter with a value which is allowed to vary as the coupled model iterates to a self-consistent solution. The emitter temperature from the converged solution does not agree with experimental temperature measurements, however. The results of a sensitivity analysis suggest that none of the tolerances in the measurement are responsible for the discrepancy. We hypothesize that either the work function needs to be a function of position along the emitting surfaces or the heat fluxes have been overestimated in the plasma solver.

Meiron, Daniel I.↗
DOE OSTI2020

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗
DOE OSTI2023

Physics basis for the Wisconsin HTS Axisymmetric Mirror (WHAM)

The Wisconsin high-temperature superconductor axisymmetric mirror experiment (WHAM) will be a high-field platform for prototyping technologies, validating interchange stabilization techniques and benchmarking numerical code performance, enabling the next step up to reactor parameters. A detailed overview of the experimental apparatus and its various subsystems is presented. WHAM will use electron cyclotron heating to ionize and build a dense target plasma for neutral beam injection of fast ions, stabilized by edge-biased sheared flow. At 25 keV injection energies, charge exchange dominates over impact ionization and limits the effectiveness of neutral beam injection fuelling. This paper outlines an iterative technique for self-consistently predicting the neutral beam driven anisotropic ion distribution and its role in the finite beta equilibrium. Beginning with recent work by Egedal et al. ( Nucl. Fusion , vol. 62, no. 12, 2022, p. 126053) on the WHAM geometry, we detail how the FIDASIM code is used to model the charge exchange sources and sinks in the distribution function, and both are combined with an anisotropic magnetohydrodynamic equilibrium solver method to self-consistently reach an equilibrium. We compare this with recent results using the CQL3D code adapted for the mirror geometry, which includes the high-harmonic fast wave heating of fast ions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2020

Multigrid Preconditioning for a Space-Time Spectral-Element Discontinuous-Galerkin Solver

In this work we examine a multigrid preconditioning approach in the context of a high- order tensor-product discontinuous-Galerkin spectral-element solver. We couple multigrid ideas together with memory lean and efficient tensor-product preconditioned matrix-free smoothers. Block ILU(0)-preconditioned GMRES smoothers are employed on the coarsest spaces. The performance is evaluated on nonlinear problems arising from unsteady scale- resolving solutions of the Navier-Stokes equations: separated low-Mach unsteady ow over an airfoil from laminar to turbulent ow. A reduction in the number of ne space iterations is observed, which proves the efficiency of the approach in terms of preconditioning the linear systems, however this gain was not reflected in the CPU time. Finally, the preconditioner is successfully applied to problems characterized by stiff source terms such as the set of RANS equations, where the simple tensor product preconditioner fails. Theoretical justification about the findings is reported and future work is outlined.

Franciolini, Matteo↗
NASA NTRSDate not supplied

Toward Verification of the γ-Reθt Transition Model in OVERFLOW and FUN3D

The results of an ongoing assessment of the transition modeling capability in NASA's OVERFLOW and FUN3D programs are presented, with a focus on the Langtry-Menter γ-Reθt transition model in combination with the shear-stress transport (SST) turbulence model. While the effect of numerics and boundary conditions on the accuracy and iterative convergence of RANS solutions for fully turbulent flows has been well documented, especially in the context of canonical flow configurations, the same cannot be said for transport-equation-based transition models coupled with RANS-based turbulence models. Given the criticality of transition modeling for new aircraft design and optimization, there has been a renewed focus on the accuracy of such transition models and their inconsistent implementation across different flow solvers as seen from the AIAA and NATO-AVT workshops. In this work, we aim to establish the verification of such models via these two well established CFD codes with different numerics. The goal is to produce high-quality data, such as grids, solutions, and other auxiliary data, that may be utilized for code verification by others in the CFD community. As a first step, the work reported here is focused on the Langtry-Menter transition model as applied to two simple 2D configurations, namely the flat plate, and the NLF-0416, respectively. The paper also highlights how the boundary conditions and baseline turbulence model can affect the solutions from the SST-based Langtry-Menter transition model. A preliminary evaluation of the automatic mesh adaption capabilities of these solvers and potential benefits for flow configurations involving a mix of laminar, transitional, and fully turbulent flows is also reported.

CFD Modeling↗
NASA NTRS1992

Development of iterative techniques for the solution of unsteady compressible viscous flows

The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step.

Sankar, Lakshmi N.↗
NASA NTRS1992

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗
NASA NTRS1986

New integration techniques for chemical kinetic rate equations. I - Efficiency comparison

A comparison of the efficiency of several recently developed numerical techniques for solving chemical kinetic rate equations is presented. The solution procedures examined include two general-purpose codes, EPISODE and LSODE, developed as multipurpose differential equation solvers, and three specialzed codes, CHEMEQ, CREK1D, and GCKP84, developed specifically for chemical kinetics. The efficiency comparison is made by applying these codes to two practical combustion kinetics problems. Both problems describe adiabatic, constant-pressure, gas-phase chemical reactions and include all three combustion regimes: induction, heat release, and equilibration. The comparison shows that LSODE is the fastest routine currently available for solving chemical kinetic rate equations. An important finding is that an iterative solution of the algebraic enthalpy conservation equation for temperature can be significantly faster than evaluation of the temperature by integration of its time derivative. Significant increases in computational speed are realized by updating the reaction rate constants only when the temperature change exceeds an amount Delta-T that is problem dependent. An approximate expression for the automatic evaluation of Delta-T is presented and is shown to result in increased computational speed.

Radhakrishnan, K.↗
DOE OSTI2024

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↗
DOE OSTI2022

Three-dimensional Skyrme Hartree-Fock-Bogoliubov solver in coordinate-space representation

The coordinate-space representation of the Hartree-Fock-Bogoliubov theory is the method of choice to study weakly bound nuclei whose properties are affected by the quasiparticle continuum space. To describe such systems, we developed a three-dimensional Skyrme-Hartree-Fock-Bogoliubov solver HFBFFT based on the existing, highly optimized and parallelized Skyrme-Hartree-Fock code Sky3D. The code does not impose any self-consistent spatial symmetries such as mirror inversions or parity. The underlying equations are solved in HFBFFT directly in the canonical basis using the fast Fourier transform. To remedy the problems with pairing collapse, we implemented the soft energy cutoff and pairing annealing. The convergence of HFB solutions was improved by a sub-iteration method. The Hermiticity violation of differential operators brought by Fourier-transform-based differentiation has also been solved. Furthermore, the accuracy and performance of HFBFFT were tested by benchmarking it against other HFB codes, both spherical and deformed, for a set of nuclei, both well-bound and weakly-bound.

3D coordinate-space representation↗
NASA NTRS1994

New multigrid approach for three-dimensional unstructured, adaptive grids

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

Parthasarathy, Vijayan↗