Engineering Papers⌕ Search

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.

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

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search

Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate the global minimum of non-convex functions. While quantum optimization offers a potential alternative, mapping continuous problems onto near-term quantum hardware introduces severe scaling limits and barren plateaus. To bridge this gap, we propose the Distributed Quantum-Enhanced Optimization (D-QEO) framework. Instead of forcing the quantum processor to find the exact minimum, we use it simply as a topographical preconditioner. The QPU maps the landscape to locate the most promising basin of attraction, generating high-quality seed points for a classical GPU-accelerated solver to refine. To make this approach viable for utility-scale problems, we exploit the mathematical structure of separable functions. This allows us to cut a 50-qubit (i.e., $2^{50}$) global search space into independent and manageable sub-spaces using 5-qubit subcircuits. By executing these fragments concurrently with CUDA-Q, we completely bypass the overhead of cross-register entanglement and classical tensor knitting for separable functions. Benchmarks on the 10-dimensional Rastrigin and Ackley functions show that D-QEO prevents the exponential failure rates observed in purely classical algorithms. Furthermore, this quantum warm-start significantly reduces the number of classical BFGS iterations required to converge, providing a highly practical blueprint for utilizing near-term quantum resources in complex global search.

Soos, Dominik [Old Dominion U.]↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2026

Understanding and Mitigating Stickiness in Biochar Produced through Acid Hydrolysis and Dehydration

Levulinic acid is a platform chemical with significant potential for conversion into a wide range of biobased chemicals and fuels. A common process for producing levulinic acid from lignocellulosic feedstocks involves acid hydrolysis and dehydration (AHDH), where hexose polymers are hydrolyzed into monomeric sugars and subsequently dehydrated to levulinic acid and formic acid in the presence of dilute sulfuric acid. However, scaling the AHDH process is challenging because of the formation of byproducts such as sticky biochar, which accumulates in continuous-flow reactors, reducing effective reaction volume and increasing process downtime. This study investigates the effect of a chemical preconditioning step on mitigating sticky biochar formation. Woody biomass was preconditioned at 170 °C with 0.26 wt % sulfuric acid for 30 min, resulting in substantial removal of hemicellulose and acid-soluble lignin. AHDH of these preconditioned solids produced biochar that did not adhere to reactor surfaces. TGA analysis confirmed that the chemical preconditioning step minimized interactions between hemicellulose-derived degradation products and lignin side chains, reducing sticky char formation. Additionally, the study observed a 6% higher yield of organic acids from softwood species compared to hardwoods, with bark content shown to negatively impact yield. These findings suggest that targeted preconditioning of lignocellulosic biomass can enhance reactor operability and improve organic acid production efficiency in AHDH processes.

biopolymers↗
DOE OSTI2025

Atmospheric River Frequency-Category Characteristics Shape U.S. West Coast Runoff

Abstractrunoff response to atmospheric rivers (ARs) over the U.S. West Coast. We focused on runoff time series variations impacted by AR characteristics (e.g., category and frequency) and land preconditions during Northern Hemisphere cool seasons in the period of 1940–2023. Results show that high-category ARs significantly increase local runoff with higher hourly precipitation rates leading to a greater incremental rate and peak runoff. Extreme runoff increases greatly with the AR category with an increase rate up to 12.5 times stronger than non-extreme runoff. Besides the AR category, land preconditions such as soil moisture and snowpack also play crucial roles in modulating runoff response. We found that runoff induced by weak-category ARs is more sensitive to land preconditions than high-category ARs, with high peak runoff occurring when soil is nearly saturated. Additionally, more than 50% of high-peak-runoff events in snow-covered grid cells are associated with rain-on-snow events particularly for the events associated with weaker ARs. Regression analysis reveals that AR precipitation and land preconditions jointly influence runoff, emphasizing the importance of including soil moisture and snowpack levels in AR impact assessments. The study also highlights the intensified runoff response to back-to-back ARs with short intervals, which may become more frequent with climate warming, posing increased flood risks via facilitating wet soil conditions. Our findings have significant implications for AR risk predictions and the development of prediction models for AR-induced runoff.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1993

Pseudo-compressibility methods for the incompressible flow equations

Preconditioning methods to accelerate convergence to a steady state for the incompressible fluid dynamics equations are considered. The analysis relies on the inviscid equations. The preconditioning consists of a matrix multiplying the time derivatives. Thus the steady state of the preconditioned system is the same as the steady state of the original system. The method is compared to other types of pseudo-compressibility. For finite difference methods preconditioning can change and improve the steady state solutions. An application to viscous flow around a cascade with a non-periodic mesh is presented.

Turkel, Eli↗
NASA NTRS1973

Liquid hydrogen turbopump rapid start program

This program was to analyze, test, and evaluate methods of achieving rapid-start of a liquid hydrogen feed system (inlet duct and turbopump) using a minimum of thermal preconditioning time and propellant. The program was divided into four tasks. Task 1 includes analytical studies of the testing conducted in the other three tasks. Task 2 describes the results from laboratory testing of coating samples and the successful adherence of a KX-635 coating to the internal surfaces of the feed system tested in Task 4. Task 3 presents results of testing an uncoated feed system. Tank pressure was varied to determine the effect of flowrate on preconditioning. The discharge volume and the discharge pressure which initiates opening of the discharge valve were varied to determine the effect on deadhead (no through-flow) start transients. Task 4 describes results of testing a similar, internally coated feed system and illustrates the savings in preconditioning time and propellant resulting from the coatings.

Wong, G. S.↗
NASA NTRS1988

Numerical solution of large nonsymmetric eigenvalue problems

Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.

Saad, Youcef↗
NASA NTRS1992

The impact of time step definition on code convergence and robustness

We have implemented preconditioning for multi-species reacting flows in two independent codes, an implicit (ADI) code developed in-house and the RPLUS code (developed at LeRC). The RPLUS code was modified to work on a four-stage Runge-Kutta scheme. The performance of both the codes was tested, and it was shown that preconditioning can improve convergence by a factor of two to a hundred depending on the problem. Our efforts are currently focused on evaluating the effect of chemical sources and on assessing how preconditioning may be applied to improve convergence and robustness in the calculation of reacting flows.

Venkateswaran, S.↗
NASA NTRS1992

Design of optimally smoothing multistage schemes for the Euler equations

A recently derived local preconditioning of the Euler equations is shown to be useful in developing multistage schemes suited for multigrid use. The effect of the preconditioning matrix on the spatial Euler operator is to equalize the characteristic speeds. When applied to the discretized Euler equations, the preconditioning has the effect of strongly clustering the operator's eigenvalues in the complex plane. This makes possible the development of explicit marching schemes that effectively damp most high-frequency Fourier modes, as desired in multigrid applications. The technique is the same as developed earlier for scalar convection schemes: placement of the zeros of the amplification factor of the multistage scheme in locations where eigenvalues corresponding to high-frequency modes abound.

Van Leer, Bram↗
NASA NTRS2006

Using Correlation to Compute Better Probability Estimates in Plan Graphs

Plan graphs are commonly used in planning to help compute heuristic "distance" estimates between states and goals. A few authors have also attempted to use plan graphs in probabilistic planning to compute estimates of the probability that propositions can be achieved and actions can be performed. This is done by propagating probability information forward through the plan graph from the initial conditions through each possible action to the action effects, and hence to the propositions at the next layer of the plan graph. The problem with these calculations is that they make very strong independence assumptions - in particular, they usually assume that the preconditions for each action are independent of each other. This can lead to gross overestimates in probability when the plans for those preconditions interfere with each other. It can also lead to gross underestimates of probability when there is synergy between the plans for two or more preconditions. In this paper we introduce a notion of the binary correlation between two propositions and actions within a plan graph, show how to propagate this information within a plan graph, and show how this improves probability estimates for planning. This notion of correlation can be thought of as a continuous generalization of the notion of mutual exclusion (mutex) often used in plan graphs. At one extreme (correlation=0) two propositions or actions are completely mutex. With correlation = 1, two propositions or actions are independent, and with correlation > 1, two propositions or actions are synergistic. Intermediate values can and do occur indicating different degrees to which propositions and action interfere or are synergistic. We compare this approach with another recent approach by Bryce that computes probability estimates using Monte Carlo simulation of possible worlds in plan graphs.

Bryce, Daniel↗
NASA NTRS2020

Integrated Demand Management: Concepts and Procedures

This report provides a comprehensive description of the Integrated Demand Management concept. Motivation: NASA’s Integrated Demand Management (IDM) research explores the idea that, under certain conditions, time-based flow management (TBFM) arrival operations can benefit from the coordinated use of a strategic traffic management initiative (TMI) to “precondition” the inbound demand. The research was motivated by the observation that TBFM was usually turned off during convective weather, even in facilities where it was routinely used. Our hypothesis was that strategic adjustments to the inbound traffic so that it provided a better match to the off-nominal changes in capacity observed during these conditions could enable TBFM scheduling to continue to provide effective support for arrival traffic management. Concept: IDM proposes that a TMI (e.g., a Collaborative Trajectory Options Program, or CTOP) be used to adjust the rate and/or geographic distribution across flows of the traffic inbound to a high-demand, TBFM-managed airport before that traffic reaches the TBFM planning horizon. After this strategic preconditioning, TBFM can then tactically fine-tune the demand to deliver a well-managed, orderly feed to the destination airport. Coordinated use of these two flow management capabilities is intended to improve system performance in terms of: • Equity of ground delay assignment, avoiding excessive ground delay for TBFM-scheduled departures, without penalizing longer flights; • Throughput, by distributing traffic to maximize use of available capacity; • Predictability for operators, providing advance notice about the impact on individual flights; • Increased flexibility, supporting operator mitigation strategies such as slot swapping or trajectory options; • Efficiency of flight operations, using ground delay more effectively and reducing airborne delay. The operational description in this document highlights how the IDM concept builds upon already existing tools and procedures, and also indicates where tool enhancements could facilitate conduct of IDM operations. However, enhanced tools are not a requirement for concept introduction. In fact, initial deployment that focused on training procedures and rationale for coordinated use of TFMS and TBFM, without changes to existing tools, might be a simpler way to introduce and to familiarize traffic managers with the idea of preconditioning. The concept and procedures described in this document can hopefully provide useful guidance for introduction of IDM into field operations..

IDM↗
DOE OSTI2025

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗