SEARCH · Search NASA

Results for “Linear 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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

A Nonlinear Schur Complement Solver for CFD-Based Multidisciplinary Models

CFD-based multidisciplinary models are the fundamental building blocks of multidis- ciplinary design optimization frameworks. Linear and nonlinear solutions of these coupled models are difficult, especially when the Jacobian matrices represent a saddle point problem, where a block-diagonal corresponding to a discipline is non-invertible. These scenarios necessitate the use of a coupled solver algorithm such as the Newton’s method instead of the popular block Gauss– Seidel-based methods because of this non-invertible block. To address this challenge, we introduce a nonlinear Schur complement solver suitable for CFD-based multidisciplinary models. The solver leverages the specialized linear and nonlinear solvers of the CFD code, and therefore, does not require the solution of a large coupled linear system as the coupled Newton’s method. Further- more, because the solver primarily uses the specialized linear and nonlinear solvers of the CFD code, it does not suffer from the same robustness limitations as the coupled Newton’s method. In this work, we will implement this solver in NASA’s OpenMDAO framework and demonstrate its effectiveness using a CFD-based aeropropulsive model. The solver will contribute to the develop- ment of aeropropulsive design optimization and CFD-based design optimization methods with the ultimate goal of accelerating the design and integration of advanced propulsion systems.

Nonlinear Solvers↗

NASA NTRS2000

Three-Dimensional Nacelle Aeroacoustics Code With Application to Impedance Education

A three-dimensional nacelle acoustics code that accounts for uniform mean flow and variable surface impedance liners is developed. The code is linked to a commercial version of the NASA-developed General Purpose Solver (for solution of linear systems of equations) in order to obtain the capability to study high frequency waves that may require millions of grid points for resolution. Detailed, single-processor statistics for the performance of the solver in rigid and soft-wall ducts are presented. Over the range of frequencies of current interest in nacelle liner research, noise attenuation levels predicted from the code were in excellent agreement with those predicted from mode theory. The equation solver is memory efficient, requiring only a small fraction of the memory available on modern computers. As an application, the code is combined with an optimization algorithm and used to reduce the impedance spectrum of a ceramic liner. The primary problem with using the code to perform optimization studies at frequencies above I1kHz is the excessive CPU time (a major portion of which is matrix assembly). The research recommends that research be directed toward development of a rapid sparse assembler and exploitation of the multiprocessor capability of the solver to further reduce CPU time.

Watson, Willie R.↗

DOE OSTI2026

or-topas: Operations Research Toolkit for Pyomo Alternative Solutions

SAND2026-16702O OR-TOPAS: Operations Research Toolkit for Pyomo Alternative Solutions is a tool that enhances optimization applications defined by the Pyomo modeling library. It offers functions to generate optimal or near-optimal solutions, operating independently of Pyomo’s solver interface. Users can configure these functions with specific solver names and options, resulting in a custom solution object that returns a list of solutions. The OR-TOPAS library includes methods tailored to the properties of the model, such as binary integer programs versus linear programs, and specific solver interfaces like Gurobi. It does not provide models for specific applications, but it is applicable to a wide range of Pyomo optimization models. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Siirola, John [Sandia National Lab. (SNL-CA), Live↗

NASA NTRS1993

Unsteady aerodynamics and flutter based on the potential equation

A time-domain three-dimensional full-potential solver is coupled with a linear structural dynamics model to investigate the unsteady aerodynamics and aeroelasticity of propfans. The solver allows calculations in multiple blade passages with independent blade motions. Aeroelastic calculations are performed in both frequency and time domains. Results are presented for two propfan configurations. Good agreement is seen between the full-potential results and results from linear theory since the flow is subsonic and the thickness of the propfan blades is small; the agreement is not as good for the cases in which the angle of attack is high. Some difficulty is encountered due to wave reflections from outer computational boundaries; however, this does not affect the results in the range of frequencies of interest.

Bakhle, Milind A.↗

NASA NTRS1993

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

NASA NTRSDate not supplied

Eigenvalue Sensitivity Computations for Linear Stability Theory

To realize the drag reduction benefit of boundary-layer transition control strategies, it is crucial to integrate transition prediction into the vehicle design through an optimization process. The integration of transition prediction based on linear stability analysis into adjoint d design optimization requires coupling an adjoint enabled computational fluid dynamics (CFD) solver with an adjoint enabled linear stability code. In particular, the boundary-layer transition location is often predicted using the N-factor method based on linear stability theory (LST). Thus, sensitivity of the linear-stability eigenvalues constitute an essential building block for optimizing the laminar flow performance. The present paper describes an implementation of LST eigenvalue sensitivity analysis that can be easily coupled with a CFD solver. Specifically, we describe a discrete adjoint formulation for the transition location prediction based on the N-factor method. The verification of this formulation is carried out by comparing the adjoint-based sensitivity of the local growth rate of a given instability mode with respect to the disturbance frequency, and the adjoint-based sensitivity of the transition location with respect to spanwise wavenumber with those sensitivities computed using a finite-difference approximation. Finally, the adjoint LST formulation is applied to flat-plate boundary-layer flows at transonic, supersonic, and hypersonic conditions, to determine the behavior and sensitivities of the transition location with respect to a range of disturbance spanwise wavenumbers.

Boundary Layer Transition↗

DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗

NASA NTRS1983

A new algorithm for constrained nonlinear least-squares problems, part 1

A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.

Hanson, R. J.↗

DOE OSTI2025

Excitation of whistler and slow-X waves by runaway electrons in a collisional plasma

Runaway electrons are known to provide robust ideal or collisionless kinetic drive for plasma wave instabilities in both the whistler and slow-X branches, via the anomalous Doppler-shifted cyclotron resonances. In a cold and dense post-thermal-quench plasma, collisional damping of the plasma waves can compete with the collisionless drive. Previous studies have found that, due to their higher wavelength and frequency, slow-X waves suffer stronger collisional damping than the whistlers, while the ideal growth rate of slow-X modes is higher. Here, we study runaway avalanche distributions that maintain the same eigen distribution and increase only in magnitude over time. The distributions are computed from the relativistic Fokker–Planck–Boltzmann solver, upon which a linear dispersion analysis is performed to search for the most unstable or least damped slow-X and whistler modes. Taking into account the effect of plasma density, plasma temperature, and effective charge number, we find that the slow-X modes tend to be excited before the whistlers in a runaway current ramp-up. Furthermore, even when the runaway current density is sufficiently high that both branches are excited, the most unstable slow-X mode has a much higher growth rate than the most unstable whistler mode. The qualitative and quantitative trends uncovered in the current study indicate that even though past experiments and modeling efforts have concentrated on whistler modes, there is a compelling case that slow-X modes should also be a key area of focus in the runaway self-mediation through wave instabilities.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1989

An Euler analysis of a High-Speed Civil Transport (HSCT) concept at Mach 3

A marching Euler solver, GEM3D, was used to predict the Mach 3 flow field for the wing and body of a High-Speed Civil Transport concept. The analysis focused on a typical cruise lift coefficient of 0.1 at alpha = 3 deg. The Euler solution indicated that embedded shocks formed on the upper surface of the inboard wing panel and at the leading-edge of the outboard wing panel, due to its supersonic leading edge condition. According to a simple static-pressure criterion, the embedded wing upper-surface shocks were sufficiently strong to separate a turbulent boundary layer. Comparison of aerodynamic coefficients from the Euler solver with those from linear theory shows that the linear theory estimates of lift and drag are optimistic, which would lead to optimistic estimates of cruise range.

Pittman, James L.↗

NASA NTRS2017

Optimization Routine for Generating Medical Kits for Spaceflight Using the Integrated Medical Model

The Integrated Medical Model (IMM) is a MATLAB model that provides probabilistic assessment of the medical risk associated with human spaceflight missions.Different simulations or profiles can be run in which input conditions regarding both mission characteristics and crew characteristics may vary. For each simulation, the IMM records the total medical events that occur and “treats” each event with resources drawn from import scripts. IMM outputs include Total Medical Events (TME), Crew Health Index (CHI), probability of Evacuation (pEVAC), and probability of Loss of Crew Life (pLOCL).The Crew Health Index is determined by the amount of quality time lost (QTL). Previously, an optimization code was implemented in order to efficiently generate medical kits. The kits were optimized to have the greatest benefit possible, given amass and/or volume constraint. A 6-crew, 14-day lunar mission was chosen for the simulation and run through the IMM for 100,000 trials. A built-in MATLAB solver, mixed-integer linear programming, was used for the optimization routine. Kits were generated in 10% increments ranging from 10%-100% of the benefit constraints. Conditions wheremass alone was minimized, volume alone was minimized, and where mass and volume were minimizedjointly were tested.

Medical Kit↗

NASA NTRSDate not supplied

Reduced-Order Aerodynamic Modeling Based on CFD Frequency Responses from Multisine Inputs

A system identification analysis was performed to determine a reduced-order model (ROM) of a computational fluid dynamics (CFD) solver in support of linear aeroservoelastic model development and feedback control design. The approach was applied to the FUN3D code for the half-span wind tunnel test article used in the NASA-Boeing collaboration called the Integrated Adaptive Wing Technology Maturation (IAWTM) project. In a transonic flow condition, multiple inputs (11 structural mode displacements and 3 control surface deflections) were simultaneously excited with orthogonal phase-optimized multisines while multiple outputs (the corresponding 14 generalized aerodynamic forces) were recorded. From these recorded times series, the matrix of frequency responses was computed and subsequently fit using rational function approximations (RFAs). It was found that the entire (14 x 14) matrix of frequency responses could be determined from a single CFD run and that results generally followed trends predicted using other methods. Differences were attributed to the modeling fidelity and nonlinearities from structural mode and control surface interactions at higher reduced frequencies. More accurate fits of the RFAs to the frequency response data were obtained by making two CFD runs, one with only structural mode excitations and one with only control surface excitations, which reduced the degree of nonlinearity in the modeling data.

Aeroservoelasticity↗

NASA NTRSDate not supplied

Progress on Flutter Analysis of the X-56A for the Third Aeroelastic Prediction Workshop

An aeroelastic analysis is presented for the X-56A test case of the upcoming third aeroelastic prediction workshop. Results using the FUN3D linearized frequency-domain solver are shown for four different structural models corresponding to increasing fuel loads. The present study is blind since only redacted and normalized flight test data have been published. However, trends in body-freedom flutter mode frequencies and damping with respect to fuel load are seen to agree well with previously published redacted flight test data.

Steven J Massey↗

DOE OSTI2025

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗

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 NTRS2000

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver)

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Reddy, C. J.↗

NASA NTRS1990

Fast secant methods for the iterative solution of large nonsymmetric linear systems

A family of secant methods based on general rank-1 updates was revisited in view of the construction of iterative solvers for large non-Hermitian linear systems. As it turns out, both Broyden's good and bad update techniques play a special role, but should be associated with two different line search principles. For Broyden's bad update technique, a minimum residual principle is natural, thus making it theoretically comparable with a series of well known algorithms like GMRES. Broyden's good update technique, however, is shown to be naturally linked with a minimum next correction principle, which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized partial differential equations of convection diffusion type in 2-D with integral layers give a first impression of the possible power of the derived good Broyden variant.

Deuflhard, Peter↗

NASA NTRS1993

Preconditioned conjugate-gradient methods for low-speed flow calculations

An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.

Ajmani, Kumud↗