Search NASA⌕ Search

SEARCH · Search NASA

Results for “fast solver”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Validation of SPH code Spheral to model interacting solid bodies in a supersonic flow

Contemporary discussions of planetary defense involve analyzing the risks posed by smaller sized, 20 to 200 m diameter, asteroids which are capable of breaking up in the atmosphere and generating a blast wave. Consequence assessments for this size class of asteroids are performed through fast-running analytic or semi-analytic models which are informed by high-fidelity hydrocode simulations of asteroid entry and breakup. However, insufficient historical data necessitates validating the independent physical processes which dominate airburst events. Here, the Fluid Solid Interface Smoothed Particle Hydrodynamics solver was previously used by Pearl et al. in 2023 to model the Chelyabinsk airburst and is used here to perform a series of validation simulations. The first effort involves modeling a cylinder in a hypersonic flow and comparing the bow shock geometry to that predicted by analytic theory. The second effort involves modeling the separation of two spherical bodies in supersonic flow and validating against experimental footage. Combined, these exercises demonstrate the ability of the code to model the flight-path of interacting solid bodies in a hypersonic flow.

Airburst↗
NASA NTRS1991

Grid adaptation to multiple functions for applied aerodynamic analysis

A fast and robust method of grid adaptation to multiple functions has been developed for flow analysis in 3D space. It is based on the equidistribution principle and the alternate direction adaptation method. The grid adaptation algorithm has been fully integrated with a space marching flow solver as contained within a 3D Navier-Stokes code and PAB3D-v2. The grid adaptation strategy, details of numerical implementation, examples of application, and potential extensions of the current method are presented in this paper.

Pao, S. P.↗
DOE OSTI2025

A Particle-in-Cell Method for Plasmas with a Generalized Momentum Formulation, Part I: Model Formulation

Here, this paper formulates a new particle-in-cell method for the Vlasov–Maxwell system. Under the Lorenz gauge condition, Maxwell’s equations for the electromagnetic fields can be written as a collection of scalar and vector wave equations. The use of potentials for the fields motivates the adoption of a Hamiltonian formulation for particles that employs the generalized (conjugate) momentum. A notable advantage offered by the Hamiltonian formulation is the elimination of time derivatives in the Lorenz gauge formulation that are required by the standard Newton–Lorentz treatment of the particles. This allows the fields to retain the full time-accuracy guaranteed by the field solver. The resulting updates for particles require only knowledge of the fields and their spatial derivatives. An analytical method for constructing these spatial derivatives is presented that exploits the underlying integral solution used in the field solver for the wave equations. Moreover, these derivatives are demonstrated to converge at the same rate as the fields in both time and space. The Method of Lines Transpose field solver we consider in this work is globally first-order accurate in time and high-order accurate in space (e.g., fourth- and fifth-order) and belongs to a larger class of methods which are unconditionally stable, can address geometry, and leverage $\mathcal {O}(N)$ fast summation methods for efficiency. We demonstrate the method on several well-established benchmark problems on bounded domains, including a plasma sheath as well as a relativistic particle beam. The efficacy of the proposed formulation is established by comparing with a second-order accurate finite-difference time-domain method that employs a leapfrog time advance for particles and a charge conserving map suitable for bounded domains. The new method shows mesh-independent numerical heating properties even in cases where the plasma Debye length is smaller than the grid spacing. This is an important feature of the new method for problems defined on bounded domains, because it permits the use of coarser grids in space in the representation of the fields. Such a capability has significant implications for the simulation of plasmas in bounded domains with complex geometry, where the ratio between the largest and smallest cells can vary significantly. The use of high-order spatial approximations in the new method also means that fewer grid points are required in order to achieve a fixed accuracy. Our results also suggest that the new method can be used with fewer simulation particles per cell compared to the benchmark explicit method, which permits further computational savings.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗
DOE OSTI2026

Surrogates for Valve-Controlled Pipe Flow: Accelerating Nuclear Reactor Design

Neural surrogate models are developed to replace expensive steady-state RANS CFD simulations for valve-controlled pipe flow in nuclear reactor design. Using parametric CFD data generated with MOOSE Pronghorn across a range of valve geometry and flow conditions, three approaches are compared: a POD-based reduced-order model, a structured UNet on a cylindrical grid, and unstructured models (DeepONet and BiStride MeshGraphNet) on nondimensionalized point clouds. POD achieves the highest accuracy (99%) with fast inference but requires storing all solution snapshots, while the DeepONet and BSMS-GNN both achieve ~89% accuracy at sub-second inference, with the BSMS-GNN offering superior geometric generalizability. These surrogates enable rapid ranking of candidate valve designs and can warm-start CFD solvers to accelerate convergence, supporting agentic design iteration on the Prometheus platform.

42 - ENGINEERING↗
NASA NTRS1984

Fast algorithms for combustion kinetics calculations: A comparison

To identify the fastest algorithm currently available for the numerical integration of chemical kinetic rate equations, several algorithms were examined. Findings to date are summarized. The algorithms examined include two general-purpose codes EPISODE and LSODE and three special-purpose (for chemical kinetic calculations) codes CHEMEQ, CRK1D, and GCKP84. In addition, an explicit Runge-Kutta-Merson differential equation solver (IMSL Routine DASCRU) is used to illustrate the problems associated with integrating chemical kinetic rate equations by a classical method. Algorithms were applied to two test problems drawn from combustion kinetics. These problems included all three combustion regimes: induction, heat release and equilibration. Variations of the temperature and species mole fraction are given with time for test problems 1 and 2, respectively. Both test problems were integrated over a time interval of 1 ms in order to obtain near-equilibration of all species and temperature. Of the codes examined in this study, only CREK1D and GCDP84 were written explicitly for integrating exothermic, non-isothermal combustion rate equations. These therefore have built-in procedures for calculating the temperature.

Radhakrishnan, K.↗
DOE OSTI2024

Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems

Herein this paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, $\ell \text{AIR}$ (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of $\ell \text{AIR}$ in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in $\ell \text{AIR}$. The resulting constrained $\ell \text{AIR}$ algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2024

Achieving High Efficiency in Reduced Order Modeling for Large Scale Polycrystal Plasticity Simulations

Reduced order models for the nonlinear response of heterogeneous microstructures typically require a construction (or training) stage to build the reduced order basis. In this manuscript, an efficient model construction strategy for the eigenstrain homogenization method (EHM) is presented. The proposed strategy relies on a parallel, element-by-element, conjugate gradient solver. Near linear scaling has been achieved with respect to the number of degrees of freedom used to resolve the microstructure. Linear scaling with respect to the number of pre-analyses required to construct the reduced order model (ROM) follows from the EHM formulation. Furthermore, a parallel implementation for fast evaluation of the constructed ROM has been developed using shared memory parallelization. It has been shown that for large microstructures with ≈ 10,000 grains, the total computational cost of evaluating the nonlinear response of a polycrystal could be reduced by approximately an order of magnitude using 32 cores with respect to serial ROM simulation. The present methodology has been verified using an additively manufactured polycrystalline microstructure of a nickel-based superalloy, Inconel 625. The capability of the developed framework to construct a ROM for such large microstructures, as well as the ability of the ROM to predict average and local quantities of interest has been demonstrated.

microscale↗
NASA NTRS2003

[Activities of Bay Area Research Corporation]

During the final year of this effort the HALFSHEL code was converted to work on a fast single processor workstation from it s parallel configuration. This was done because NASA Ames NAS facility stopped supporting space science and we no longer had access to parallel computer time. The single processor version of HALFSHEL was upgraded to address low density cells by using a a 3-D SOR solver to solve the equation Delta central dot E = 0. We then upgraded the ionospheric load packages to provide a multiple species load of the ionosphere out to 1.4 Rm. With these new tools we began to perform a series of simulations to address the major topic of this research effort; determining the loss rate of O(sup +) and O2(sup +) from Mars. The simulations used the nominal Parker spiral field and in one case used a field perpendicular to the solar wind flow. The simulations were performed for three different solar EUV fluxes consistent with the different solar evolutionary states believed to exist before today. The 1 EUV case is the nominal flux of today. The 3 EUV flux is called Epoch 2 and has three times the flux of todays. The 6 EUV case is Epoch 3 and has 6 times the EUV flux of today.

Source record↗
DOE OSTI2025

Advancements in NEAMS Tool Capabilities for Multiphysics Simulation of Fast Reactor Core Bowing and Identification of Validation Test Data

Under the U.S. Department of Energy Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) Program, an integrated multiphysics approach is being developed to model the core bowing phenomena important to liquid metal-cooled fast reactors. Core bowing is an important passive safety mechanism in liquid metal-cooled fast reactors and involves Multiphysics effects including radiation transport, fluid flow, heat transfer, and mechanical response to temperature and flux gradients. This report summarizes recent progress on developing a multiphysics, MOOSE-based workflow to predict core bowing and associated reactivity feedback. Last year, thermal fluids and mechanics were coupled on a multi-assembly benchmark problem based on ABR-1000 design. This year, the reactor physics code Griffin was assessed for readiness of core bowing calculations. Preliminary integration of Griffin’s ring-heterogeneous model with thermal fluids and thermal mechanics solvers was performed. Specifically, thermal-mechanics and reactor physics were coupled for single- and multi-assembly problems, and reactor physics and subchannel methods were coupled for a single assembly model. Finally, the workflow of all three physics was preliminarily demonstrated on a single assembly model. Caveats and future development needed have been identified. To supplement the multiphysics demonstration, verification and assessment efforts of thermos-mechanical capabilities for modeling thermo-mechanical core bowing behavior were continued by analyzing IAEA Verification Problem 5 which includes radiation swelling and creep. Additionally, a small core reactor physics benchmark defined by Japan Atomic Energy Agency (JAEA) was performed to assess neutronics models for estimating reactivity feedback. Finally, Fast Flux Test Facility (FFTF) validation test data for core bowing phenomena has been identified and summarized, with a recommended path forward for validation once this capability is mature.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

MOOSE-Based Fast Reactor Core Bowing Capabilities: Coupled Structural Mechanics – Thermal Fluids Demonstration and Related Verification Efforts

Under the U.S. Department of Energy Office of Nuclear Energy’s Advanced Modeling and Simulation (NEAMS) Program, an integrated multiphysics approach is being developed to model the core bowing phenomena important to liquid metal-cooled fast reactors. Core bowing is an important passive safety mechanism in liquid metal-cooled fast reactors and involves multiphysics effects including radiation transport, fluid flow, heat transfer, and mechanical response to temperature and flux gradients. Verification and assessment efforts continued on the Multiphysics Object Oriented Simulation Environment (MOOSE) capabilities relevant for modeling thermo-mechanical core bowing behavior. IAEA Verification Problem 4, which was started in FY23, was further examined with MOOSE capabilities to rectify discrepancies observed in previous years when compared to IAEA benchmark participant data. Meshing and postprocessing capabilities in MOOSE were also advanced by other teams and utilized this year. A thermal fluids-structural mechanical coupling demonstration has performed on 7-assemblyand 19-assembly fast reactor assembly configurations using MOOSE. Subchannel capabilities are used to calculate coolant temperature, and heat conduction capabilities calculate duct wall temperature as well as heat transfer through the inter-assembly gap. Structural mechanical capabilities then deform the mesh, accounting for contact between assemblies, according to the temperature gradients calculated by the thermal solvers. Power distributions are imposed rather than calculated to demonstrate different deformations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗
NASA NTRS1975

A fast semidirect method for computing transonic aerodynamic flows

A fast, semidirect, iterative computational method, previously introduced for finite-difference solution of subsonic and slightly supercritical flow over airfoils, is extended both to apply to strongly supercritical conditions and to include full second-order accuracy in computing inviscid flows over airfoils. The nonlinear small-disturbance equations are solved iteratively by a direct, linear, elliptic solver. General, fully conservative, type-dependent difference equations are formulated, including parabolic- and shock-point transition operators that provide consistency with the integral conservation laws. These equations specialize to either first-order or to fully second-order-accurate equations. Various free parameters are evaluated for rapid convergence of the first-order scheme. Resulting pressure distributions and computing times are compared with the improved Murman-Cole line-relaxation method.

Martin, E. D.↗
NASA NTRS2017

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗
NASA NTRS1999

3D Structured Grid Generation Codes for Turbomachinery

This report describes the research tasks during the past year. The research was mainly in the area of computational grid generation in support of CFD analyses of turbomachinery components. In addition to the grid generation work, a numerical simulation was obtained for the flow through a centrifugal gas compressor using an unstructured Navier-Stokes solver. Other tasks involved many different turbomachinery component analyses. These analyses were performed for NASA projects or for industrial applications. The work includes both centrifugal and axial machines, single and multiple blade rows, and steady and unsteady analyses. Over the past five years, a set of structured grid generation codes were developed that allow grids to be obtained fairly quickly for the large majority of configurations we encounter. These codes do not comprise a generalized grid generation package; they are noninteractive codes specifically designed for turbomachinery blade row geometries. But because of this limited scope, the codes are small, fast, and portable, and they can be run in the batch mode on small workstations. During the past year, these programs were used to generate computational grids were modified for a wide variety of configurations. In particular, the codes or wrote supplementary codes to improve our grid generation capabilities for multiple blade row configurations. This involves generating separate grids for each blade row, and then making them match and overlap by a few grid points at their common interface so that fluid properties are communicated across the interface. Unsteady rotor/stator analyses were performed for an axial turbine, a centrifugal compressor, and a centrifugal pump. Steady-state single-blade-row analyses were made for a study of blade sweep in transonic compressors. There was also cooperation on the application of an unstructured Navier-Stokes solver for turbomachinery flow simulations. In particular, the unstructured solver was used to analyze the flow through a centriftio compressor impeller.

Loellbach, James↗
DOE OSTI2026

Interpretation of high-harmonic fast-wave propagation in the scrape-off layer of NSTX-U as a geometrically bounded-waveguide mode

This paper revisits the onset of high-harmonic fast-wave (HHFW) propagation in the scrape-off layer (SOL) plasma of the NSTX/NSTX-U spherical tokamak, motivated by past HHFW heating and current drive experiments and modelling. Previously, the fast-wave propagation in the SOL was correlated with the opening (suppression) of the fast-wave right-hand cutoff layer in front of the antenna. In this work, the SOL propagation is interpreted as a geometric waveguide mode guided by the SOL geometry, whose radial width can be comparable to the wave’s perpendicular wavelength in the HHFW regime. A two-dimensional circular model is first employed using full-wave solvers to characterise the poloidal eigenmode structures and to clarify their relationship to annulus resonance. By progressively adding a tokamak-like magnetic-field configuration, starting from a uniform axial field, the effects of magnetic-field gradients and pitch on the SOL waveguide mode are characterised. The poloidal mode numbers supported by the SOL plasma agree well with analytic estimates, indicating that an anisotropic plasma in a bounded geometry selectively supports and amplifies the resonant poloidal mode number. Additionally, two-dimensional axisymmetric NSTX-U simulations demonstrate that the SOL eigenmode features identified in the circular model persist in the experimentally relevant configurations. A control approach based on lengthening the wave perpendicular wavelength relative to the SOL width, including a higher magnetic (B)-field operation, is discussed. The analysis here shows the key role of a bounded geometry in interpreting HHFW eigenmode coupling and propagation in the NSTX-U SOL plasma.

plasma heating↗
DOE OSTI2025

SAM User's Guide

The System Analysis Module (SAM) is a modern system analysis tool being developed at Argonne National Laboratory for advanced non-LWR safety analysis. It aims to provide fast-running, whole-plant transient analyses capability with improved-fidelity for Sodium-cooled Fast Reactors (SFR), Lead-cooled Fast Reactors (LFR), and Molten Salt Reactors (MSR) or Fluoride-cooled High-temperature Reactors (FHR). SAM takes advantage of advances in physical modeling, numerical methods, and software engineering to enhance its user experience and usability. It utilizes an object-oriented application framework (MOOSE), and its underlying meshing and finite-element library (libMesh) and linear and non-linear solvers (PETSc), to leverage the modern advanced software environments and numerical methods. This document provides a user’s guide, which will help users understand the input description and core capabilities of the SAM code. A brief overview of the code is presented, as well as how to obtain and run it. The input syntax for various parts of the code is provided. Additionally, a number of example problems, starting with simple unit component problems to problems with increasing complexity, are provided. Because the code is still under active development, this SAM User’s Guide will evolve with periodic updates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1985

Multigrid solutions to quasi-elliptic schemes

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate then corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Brandt, A.↗