SEARCH · Engineering Papers

Results for “Preconditioning”

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Understanding Electric Vehicle Range and Charging Needs: Interactions Between Ambient Temperature, Commute Patterns, and State-of-Charge Usage

Electric vehicle (EV) performance can vary substantially under real-world operating conditions, particularly due to ambient temperature effects on energy consumption, battery behavior, and thermal management requirements. This study quantifies how weather conditions, daily driving patterns, and State-of-Charge (SOC) usage strategies jointly influence EV driving range, charging frequency, and overall energy efficiency. A detailed and experimentally validated Autonomie vehicle model is developed, integrating a powertrain, a mono-zonal cabin model, and a battery electro-thermal model. Three battery sizes (200-, 300-, and 400-mile homologated ranges) are assessed across five commute profiles (20–200 miles) and six ambient temperatures (−18 °C to 50 °C), including scenarios with and without preconditioning. Results show that extreme temperatures could significantly decrease the maximum achievable range by up to 55% in cold conditions (−18 °C) and 40% in hot conditions (50 °C), relative to moderate conditions. Larger battery packs retain a greater fraction of their nominal range under thermal stress, while smaller packs experience sharper relative penalties due to the higher contribution of thermal loads to total energy demand. The analysis further demonstrates that limiting operation to partial SOC windows (e.g., 80–20%), a common real-world practice, significantly reduces achievable range and increases charging frequency, particularly in cold weather. Thermal preconditioning while plugged in is shown to mitigate these effects for short trips, reducing energy consumption by up to 31% in hot conditions and 7% in cold conditions. The findings demonstrate how climate, SOC usage behavior, and thermal management jointly shape the practical driving capability of EVs, highlighting the importance of efficient thermal management and realistic user charging strategies for ensuring reliable EV operation across diverse climatic scenarios.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2026

Integral Kernel Methods for Nonlinear Parabolic-Elliptic Systems

Nonlinear parabolic-elliptic systems arise in many physical, biological, and chemical phenomena such as chemotaxis, ion transport, self-gravitating particles, and Brownian vortices. Existing methods struggle with the strong coupling and high nonlinearity and nonlocality of some of these systems, especially the ill-conditioned, convection-dominated problems. To overcome numerical difficulties, current approaches rely on initial guesses, preconditioning, or iterative techniques with no convergence guarantees. They might suffer from poor scalability, large memory usage, and difficulty to parallelize. Inspired by the connection of parabolic-elliptic systems to stochastic processes, we introduce a novel meshless, monolithic, and fully explicit method that naturally encapsulates the elliptic and parabolic operators into a single step which updates each node deterministically with global information. By being fully quadrature-based, it avoids solving systems of discretized equations and does not utilize initial guesses or preconditioning, while requiring little memory and being easy to parallelize. We first derive the method in an integral kernel formulation with quadratic complexity in the number of integration nodes and then leverage kernel-independent fast multipole methods (FMM) to present a scalable algorithm with linear complexity. We provide numerical examples for the Poisson-Nernst-Planck equations in one, two, and three dimensions, together with the derivation of the integral kernel for each case. Furthermore, the examples demonstrate the fast convergence and scalability of the FMM-accelerated algorithm, as well as its suitability for convection-dominated problems, making it competitive against traditional PDE solvers.

PDE systems↗

DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS1978

Emittance of TD-NiCr after simulated reentry

The effects of simulated reentry heating on the emittance of TD-NiCr were investigated. Groups of specimens with three different preconditioning treatments were exposed to 6, 24, and 30 half-hour simulated reentry exposure cycles in a supersonic arc tunnel at each of three conditions intended to produce surface temperatures of 1255, 1365, and 1475 K. Emittance was determined at 1300 K on specimens which were preconditioned only and specimens after completion of reentry simulation exposure. Oxide morphology and chemistry were studied by scanning electron microscopy and X-ray diffraction analysis. A consistent relationship was established between oxide morphology and total normal emittance. Specimens with coarser textured oxides tended to have lower emittances than specimens with finer textured oxides.

Clark, R. K.↗

NASA NTRS1983

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

NASA NTRS1983

An iterative method for the Helmholtz equation

An iterative algorithm for the solution of the Helmholtz equation is developed. The algorithm is based on a preconditioned conjugate gradient iteration for the normal equations. The preconditioning is based on an SSOR sweep for the discrete Laplacian. Numerical results are presented for a wide variety of problems of physical interest and demonstrate the effectiveness of the algorithm.

Bayliss, A.↗

NASA NTRS1984

Conjugate gradient coupled with multigrid for an indefinite problem

An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.

Gozani, J.↗

NASA NTRS1982

A minimal residual method for transonic potential flows

For transonic flow calculations, a combination of the successive line over-relaxation (SLOR) and the preconditioned conjugate gradient (CG) method has been suggested by Wong and Hafez (1981). This paper studies the method of minimal residual (MR) which avoids a combined iteration. This method is closely related to the CG method, may be regarded as a first-order gradient method, and is applicable to symmetric and nonsymmetric matrices. The problem is formulated as a nonlinear mixed elliptic-hyperbolic partial differential equation which includes an artificial viscosity and a switching function which is zero in subsonic regions and nonzero in supersonic regions. Alternatives to the SLOR method which provide faster convergence rates are introduced. The preconditioned MR algorithm is developed, and transonic potential flows around NACA 0012 airfoil are calculated for different Mach numbers and angles of attack. Preliminary results are presented, demonstrating that the MR algorithm requires no parameter estimation and rapidly converges for subsonic flows.

Wong, Y. S.↗

NASA NTRS1984

Lubricity of well-characterized jet and broad-cut fuels by ball-on-cylinder machine

A ball-on-cylinder machine (BOCM) was used to measure the lubricity of fuels. The fuels tested were well-characterized fuels available from other programs at the NASA Lewis Research Center plus some in-house mildly hydroprocessed shale fuels from other programs included Jet-A, ERBS fuel, ERBS blends, and blend stock. The BOCM tests were made before and after clay treatment of some of these fuels with both humidified air and dry nitrogen as the preconditioning and cover gas. As expected, clay treatment always reduced fuel lubricity. Using nitrogen preconditioning and cover gas always resulted in a smaller wear scar diameter than when humidified air was used. Also observed was an indication of lower lubricity with lower boiling range fuels and lower aromatic fuels. Gas chromatographic analysis indicted changes in BOCM-stressed fuels.

Prok, G. M.↗

NASA NTRS1985

Algorithms for the Euler and Navier-Stokes equations for supercomputers

The steady state Euler and Navier-Stokes equations are considered for both compressible and incompressible flow. Methods are found for accelerating the convergence to a steady state. This acceleration is based on preconditioning the system so that it is no longer time consistent. In order that the acceleration technique be scheme-independent, this preconditioning is done at the differential equation level. Applications are presented for very slow flows and also for the incompressible equations.

Turkel, E.↗

NASA NTRS1985

GMRES acceleration of computational fluid dynamics codes

The generalized minimal residual algorithm (GMRES) is a conjugate-gradient like method that applies directly to nonsymmetric linear systems of equations. In this paper, GMRES is modified to handle nonlinear equations characteristic of computational fluid dynamics. Attention is devoted to the concept of preconditioning and the role it plays in assuring rapid convergence. A formulation is developed that allows GMRES to be preconditioned by the solution procedures already built into existing computer codes. Examples are provided that demonstrate the ability of GMRES to greatly improve the robustness and rate of convergence of current state-of-the-art fluid dynamics codes. Theoretical aspects of GMRES are presented that explain why it works. Finally, the advantage GMRES enjoys over related methods such as conjugate gradients are discussed.

Wigton, L. B.↗

NASA NTRS1985

Algorithms for the Euler and Navier-Stokes equations for supercomputers

Turkel, E.↗

NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

NASA NTRS1987

Fault diagnosis based on continuous simulation models

The results are described of an investigation of techniques for using continuous simulation models as basis for reasoning about physical systems, with emphasis on the diagnosis of system faults. It is assumed that a continuous simulation model of the properly operating system is available. Malfunctions are diagnosed by posing the question: how can we make the model behave like that. The adjustments that must be made to the model to produce the observed behavior usually provide definitive clues to the nature of the malfunction. A novel application of Dijkstra's weakest precondition predicate transformer is used to derive the preconditions for producing the required model behavior. To minimize the size of the search space, an envisionment generator based on interval mathematics was developed. In addition to its intended application, the ability to generate qualitative state spaces automatically from quantitative simulations proved to be a fruitful avenue of investigation in its own right. Implementations of the Dijkstra transform and the envisionment generator are reproduced in the Appendix.

Feyock, Stefan↗

NASA NTRS1988

Krylov subspace methods on supercomputers

A short survey of recent research on Krylov subspace methods with emphasis on implementation on vector and parallel computers is presented. Conjugate gradient methods have proven very useful on traditional scalar computers, and their popularity is likely to increase as three-dimensional models gain importance. A conservative approach to derive effective iterative techniques for supercomputers has been to find efficient parallel/vector implementations of the standard algorithms. The main source of difficulty in the incomplete factorization preconditionings is in the solution of the triangular systems at each step. A few approaches consisting of implementing efficient forward and backward triangular solutions are described in detail. Polynomial preconditioning as an alternative to standard incomplete factorization techniques is also discussed. Another efficient approach is to reorder the equations so as to improve the structure of the matrix to achieve better parallelism or vectorization. An overview of these and other ideas and their effectiveness or potential for different types of architectures is given.

Saad, Youcef↗

NASA NTRS1989

Solution of the incompressible Navier-Stokes equations using artificial compressibility methods

A modified artificial compressibility formulation is derived from a preconditioned low Mach number compressible formulation, and these two methods are compared on a two-dimensional laminar leading edge flow using a LBI/ADI solution algorithm. The two methods are essentially equivalent with appropriate preconditioning parameters and have the same convergence rates and efficiency, giving 4 orders of residual reduction in about 75 iterations with a vectorized CRAY-XMP run time of 20 seconds for 3000 grid points.

Briley, W. R.↗

NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗