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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Practical Aspects of Krylov Subspace Iterative Methods in CFD

Implementation issues associated with the application of Krylov subspace iterative methods, such as Newton-GMRES, are presented within the framework of practical computational fluid dynamic (CFD) applications. This paper categorizes, evaluates, and contrasts the major ingredients (function evaluations, matrix-vector products, and preconditioners) of Newton-GMRES Krylov subspace methods in terms of their effect on the local linear and global nonlinear convergence, memory requirements, and accuracy. The discussion focuses on Newton-GMRES in both a structured multi-zone incompressible Navier-Stokes solver and an unstructured mesh finite-volume Navier-Stokes solver. Approximate versus exact matrix-vector products, effective preconditioners, and other pertinent issues are addressed.

Pulliam, Thomas H.↗
NASA NTRS1994

Canonical-variables multigrid method for steady-state Euler equations

A novel approach for the solution of inviscid flow problems for subsonic compressible flows is described. The approach is based on canonical forms of the equations, in which subsystems governed by hyperbolic operators are separated from those governed by elliptic ones. The discretizations used as well as the iterative techniques for the different subsystems are inherently different. Hyperbolic parts, which describe, in general, propagation phenomena, are discretized using upwind schemes and are solved by marching techniques. Elliptic parts, which are directionally unbiased, are discretized using h-elliptic central discretizations, and are solved by pointwise relaxations together with coarse grid acceleration. The resulting discretization schemes introduce artificial viscosity only for the hyperbolic parts of the system; thus a smaller total artificial viscosity is used, while the multigrid solvers used are much more efficient. Solutions of the subsonic compressible Euler equations are achieved at the same efficiency as the full potential equation.

Taasan, Shlomo↗
DOE OSTI2024

Machine Learning Potentials with the Iterative Boltzmann Inversion: Training to Experiment

Methodologies for training machine learning potentials (MLPs) with quantum-mechanical simulation data have recently seen tremendous progress. Experimental data have a very different character than simulated data, and most MLP training procedures cannot be easily adapted to incorporate both types of data into the training process. Here, we investigate a training procedure based on iterative Boltzmann inversion that produces a pair potential correction to an existing MLP using equilibrium radial distribution function data. By applying these corrections to an MLP for pure aluminum based on density functional theory, we observe that the resulting model largely addresses previous overstructuring in the melt phase. Interestingly, the corrected MLP also exhibits improved performance in predicting experimental diffusion constants, which are not included in the training procedure. The presented method does not require autodifferentiating through a molecular dynamics solver and does not make assumptions about the MLP architecture. Our results suggest a practical framework for incorporating experimental data into machine learning models to improve the accuracy of molecular dynamics simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2025

FY25 Theory and Simulation Performance Target: Development of an integrated modeling framework for fusion reactor design and assessment (Final Report)

This report documents the FY25 Theory and Simulation Performance Target (TSPT) of developing an integrated modeling framework for fusion reactor design and assessment (FREDA). Over Q1-Q4, new capabilities were developed across both plasma and engineering domains and demonstrated on an example representation of a Compact Advanced Tokamak with a Dual Cooled Lead Lithium blanket. This represents a first-of-a-kind demonstration of coupled core-to-wall-to-engineering for a reactor. Self-consistent CESOL workflows were applied to provide core, pedestal, and SOL prediction; new modules were developed for energetic particle stability (FAR3D) and transport (TGLF-EP) analysis; and boundary plasma modeling (SOLPS-ITER, BOUT++/Hermes-3) was expanded to evaluate wall and divertor heat fluxes and interface with engineering thermal analysis. A parameterized CAD tool, TRACER, was expanded to generate medium-fidelity divertor, blanket, and coil geometries; OpenFOAM and Diablo workflows were applied for first-wall and divertor thermal analyses with helium cooling; and reduced-order models were created for high-mass-flux divertor cooling. Magnet multiphysics capabilities were verified between Elmer, Diablo, and a new MFEM-based solver, and workflows enable stress, thermal, and neutron-fluence analysis of TF coils with neutronics-driven heating. Nuclear and blanket analysis workflows were demonstrated, including tritium breeding, transport, and CFD-informed thermo-mechanical assessment. Preliminary multi-fidelity uncertainty quantification workflows were applied to boundary modeling codes and shown to achieve variance reductions with fewer high-fidelity boundary simulations. Key findings highlight the challenges of resolving the ITEP gap to find suitable balance between wall and divertor loads, neutron heating, and practical limits of PFC cooling. Next step priorities are to develop automated workflows to check boundary code convergence and detachment, implement tighter physics-engineering CAD provenance tracking, and inclusion of plasma-material interface models for SLAG and tungsten cracking behavior. Collectively, these developments establish sophisticated capabilities for predictive, multi-fidelity, whole-device modeling that integrates plasma physics, materials, magnets, and nuclear engineering to guide pathways to viable Fusion Pilot Plant design points.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1986

Fast algorithm for calculating chemical kinetics in turbulent reacting flow

This paper addresses the need for a fast batch chemistry solver to perform the kinetics part of a split operator formulation of turbulent reacting flows, with special attention focused on the solution of the ordinary differential equations governing a homogeneous gas-phase chemical reaction. For this purpose, a two-part predictor-corrector algorithm which incorporates an exponentially fitted trapezoidal method was developed. The algorithm performs filtering of ill-posed initial conditions, automatic step-size selection, and automatic selection of Jacobi-Newton or Newton-Raphson iteration for convergence to achieve maximum computational efficiency while observing a prescribed error tolerance. The new algorithm, termed CREK1D (combustion reaction kinetics, one-dimensional), compared favorably with the code LSODE when tested on two representative problems drawn from combustion kinetics, and is faster than LSODE.

Radhakrishnan, K.↗
DOE OSTI2023

Shutdown dose rate analysis with the Shift Monte Carlo radiation transport code and modular verification workflow

Calculation of the shutdown dose rate is crucial for safe fusion reactor operations. The Rigorous-two-step (R2S) method is a method that requires connected neutron transport, activation, and gamma transport. Shift has integrated variance reduction with a deterministic solver Denovo, supports multiple geometry formats, and is scalable. These features make it an attractive transport solver choice for an R2S workflow. An R2S workflow for the Shift Monte Carlo code is developed and compared to the existing Oak Ridge National Laboratory Shutdown Dose Rate Code Suite (ORCS) workflow. Also, a Python framework for integrating two R2S workflows is developed to mix and match each step in the R2S workflow for improved collaboration and verification experience. In this study, results show that the Shift-Denovo R2S workflow and the ORCS workflow calculate the shutdown dose rate of the ITER Shutdown Dose Rate benchmark problem with an average relative error of 2.285%.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Preliminary Monte Carlo and Thermal Hydraulic Analysis using a Hybrid ETF-Corrected-Diffusion Prediction Block

This paper builds upon previous work to accelerate the Picard iteration (PI) method typically applied for coupled Monte Carlo-Thermal hydraulic (MC-TH) solutions. Previously, the use of the generalized transfer functions (GTFs) to predict variation in macroscopic cross sections following a perturbation in TH properties was demonstrated for a subset of simple 3D problems. In addition, the reduced-order transport prediction block relied on the first order perturbation (FOP) method, which was shown to have computational overheads. Recent work replaced the FOP block with a 1-group nodal diffusion solver to eliminate these overheads. While the use of diffusion is desirable for large-scale problems, the new solver introduces significant homogenization error. This work aims to address this issue by using the Jacobian-Free Newton Krylov (JFNK) method to generate a set of super homogenization (SPH) factors to improve the accuracy of the diffusion solution. The SPH factors will be used in conjunction with an improved cross section prediction method – the expanded transfer function (ETF) method – to produce a highly accurate flux prediction for an axial 1D boiling water reactor (BWR) pincell following a large perturbation in moderator density. The ETF-corrected diffusion (ETF-CD) block is shown to be highly accurate for the 1D test case. Future work will investigate the accuracy of the method for a realistic 3D pressurized water reactor core.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1995

Newton-Krylov-Schwarz: An implicit solver for CFD

Newton-Krylov methods and Krylov-Schwarz (domain decomposition) methods have begun to become established in computational fluid dynamics (CFD) over the past decade. The former employ a Krylov method inside of Newton's method in a Jacobian-free manner, through directional differencing. The latter employ an overlapping Schwarz domain decomposition to derive a preconditioner for the Krylov accelerator that relies primarily on local information, for data-parallel concurrency. They may be composed as Newton-Krylov-Schwarz (NKS) methods, which seem particularly well suited for solving nonlinear elliptic systems in high-latency, distributed-memory environments. We give a brief description of this family of algorithms, with an emphasis on domain decomposition iterative aspects. We then describe numerical simulations with Newton-Krylov-Schwarz methods on aerodynamics applications emphasizing comparisons with a standard defect-correction approach, subdomain preconditioner consistency, subdomain preconditioner quality, and the effect of a coarse grid.

Cai, Xiao-Chuan↗
DOE OSTI2020

DESC: A stellarator equilibrium solver

In this paper, the new code DESC is presented to solve for fixed-boundary ideal magnetohydrodynamic equilibria in stellarators. The approach directly solves the equilibrium force balance as a system of nonlinear equations in the form f(x) = 0. The independent variables x represent nested magnetic flux surfaces expressed in the inverse representation with toroidal flux coordinates, and the equations f(x) quantify equilibrium force balance errors at discrete points in real space. Discretizing with global Fourier–Zernike basis functions properly treats the magnetic axis and minimizes the number of coefficients needed to describe the flux surfaces. The pseudospectral method provides great flexibility in where the errors are evaluated, and the system of equations is efficiently solved with a Newton–Raphson iteration. Equilibria are computed and compared against VMEC for both axisymmetric and non-axisymmetric examples. The results show fast convergence rates and solutions with low errors throughout the plasma volume.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1989

A fast, preconditioned conjugate gradient Toeplitz solver

A simple factorization is given of an arbitrary hermitian, positive definite matrix in which the factors are well-conditioned, hermitian, and positive definite. In fact, given knowledge of the extreme eigenvalues of the original matrix A, an optimal improvement can be achieved, making the condition numbers of each of the two factors equal to the square root of the condition number of A. This technique is to applied to the solution of hermitian, positive definite Toeplitz systems. Large linear systems with hermitian, positive definite Toeplitz matrices arise in some signal processing applications. A stable fast algorithm is given for solving these systems that is based on the preconditioned conjugate gradient method. The algorithm exploits Toeplitz structure to reduce the cost of an iteration to O(n log n) by applying the fast Fourier Transform to compute matrix-vector products. Matrix factorization is used as a preconditioner.

Pan, Victor↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

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

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. 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. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗
NASA NTRS2003

Study of Unsteady Flows with Concave Wall Effect

This paper presents computational fluid dynamic studies of the inlet turbulence and wall curvature effects on the flow steadiness at near wall surface locations in boundary layer flows. The time-stepping RANS numerical solver of the NASA Glenn-HT RANS code and a one-equation turbulence model, with a uniform inlet turbulence modeling level of the order of 10 percent of molecular viscosity, were used to perform the numerical computations. The approach was first calibrated for its predictabilities of friction factor, velocity, and temperature at near surface locations within a transitional boundary layer over concave wall. The approach was then used to predict the velocity and friction factor variations in a boundary layer recovering from concave curvature. As time iteration proceeded in the computations, the computed friction factors converged to their values from existing experiments. The computed friction factors, velocity, and static temperatures at near wall surface locations oscillated periodically in terms of time iteration steps and physical locations along the span-wise direction. At the upstream stations, the relationship among the normal and tangential velocities showed vortices effects on the velocity variations. Coherent vortices effect on the velocity components broke down at downstream stations. The computations also predicted the vortices effects on the velocity variations within a boundary layer flow developed along a concave wall surface with a downstream recovery flat wall surface. It was concluded that the computational approach might have the potential to analyze the flow steadiness in a turbine blade flow.

Wang, Chi R.↗
DOE OSTI2023

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1997

External Boundary Conditions for Three-Dimensional Problems of Computational Aerodynamics

We consider an unbounded steady-state flow of viscous fluid over a three-dimensional finite body or configuration of bodies. For the purpose of solving this flow problem numerically, we discretize the governing equations (Navier-Stokes) on a finite-difference grid. The grid obviously cannot stretch from the body up to infinity, because the number of the discrete variables in that case would not be finite. Therefore, prior to the discretization we truncate the original unbounded flow domain by introducing some artificial computational boundary at a finite distance of the body. Typically, the artificial boundary is introduced in a natural way as the external boundary of the domain covered by the grid. The flow problem formulated only on the finite computational domain rather than on the original infinite domain is clearly subdefinite unless some artificial boundary conditions (ABC's) are specified at the external computational boundary. Similarly, the discretized flow problem is subdefinite (i.e., lacks equations with respect to unknowns) unless a special closing procedure is implemented at this artificial boundary. The closing procedure in the discrete case is called the ABC's as well. In this paper, we present an innovative approach to constructing highly accurate ABC's for three-dimensional flow computations. The approach extends our previous technique developed for the two-dimensional case; it employs the finite-difference counterparts to Calderon's pseudodifferential boundary projections calculated in the framework of the difference potentials method (DPM) by Ryaben'kii. The resulting ABC's appear spatially nonlocal but particularly easy to implement along with the existing solvers. The new boundary conditions have been successfully combined with the NASA-developed production code TLNS3D and used for the analysis of wing-shaped configurations in subsonic (including incompressible limit) and transonic flow regimes. As demonstrated by the computational experiments and comparisons with the standard (local) methods, the DPM-based ABC's allow one to greatly reduce the size of the computational domain while still maintaining high accuracy of the numerical solution. Moreover, they may provide for a noticeable increase of the convergence rate of multigrid iterations.

Tsynkov, Semyon V.↗
DOE OSTI2025

Towards Automated Reasoning Chains for Verification of LLM-Generated Scientific Code

With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.

Oschatz, Quentin [Carnegie Mellon University,Pitts↗
NASA NTRSDate not supplied

Edge Based Viscous Method for Node-Centered Formulations

This paper presents a novel, efficient, conservative, edge-based method for evaluation of mean flow viscous fluxes and turbulence-model diffusion terms of the Reynolds-averaged Navier-Stokes equations on tetrahedral grids. The new method is implemented in a practical, node-centered, finite-volume computational fluid dynamics solver. The baseline finite-volume scheme that is equivalent to a second-order accurate finite-element Galerkin approximation of viscous stresses is reformulated. The order of operations to compute the cell-based Green-Gauss gradients is changed to combine the operations by edge, which leads to an equivalent formulation on tetrahedral grids, improves efficiency, and preserves the compact discretization stencil based on the nearest neighbors. The computational results presented in this paper verify the implementation of this edge-based method by comparing its accuracy and iterative convergence with those of the well verified and validated baseline formulation. Efficiency gains for residual and Jacobian evaluations result in significant reduction of time to solution. This novel edge-based formulation on tetrahedra can be seamlessly combined with the baseline formulation on cells of other types for computing solutions on mixed-element grids.

Edge Based↗