Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “precondition”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Self-potential tomography preconditioned by particle swarm optimization—Self-potential monitoring and streamflow data acquired March 26–September 14, 2023 at East Fork Poplar Creek near Oak Ridge Tennessee

This data release contains self-potential (SP) monitoring data measured on the flood plain of East Fork Poplar Creek (East Fork) in Oak Ridge, Tennessee and streamflow data measured at streamgage EFK5.4 about 310 meters upstream from the SP monitoring site. Additionally, forward and inverse numerical modeling scripts used to model the electrical-potential field on the East Fork flood plain are provided. SP monitoring data included in this data release were measured at 39 different data-collection points on the east flood plain; 30 points were spaced 3-m apart along an 87-m profile parallel to the edge of the streambank, and 9 points were spaced 5-m apart along a 40-m profile approximately perpendicular to the streambank. The two profiles of SP data-collection points intersected at the approximate midpoint of the profile parallel to the streambank. Transient voltages were measured at each data-collection point every 60 seconds between 16:13 Eastern Standard Time (EST) on March 26, 2023, and 11:41 EST on September 14, 2023. Streamflow data included in this data release overlap the time-period of self-potential monitoring and were measured every 900 seconds between 16:23 on March 26, 2023, and 23:53 on September 14, 2023.

54 ENVIRONMENTAL SCIENCES↗
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 OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
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↗
DOE OSTI2020

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Light-Induced Metastabilities in Highly Efficient MZO/CdSeTe/CdTe Thin Film Solar Cells

Metastability effects have been investigated in high efficiency MZO/CdSeTe/CdTe solar cells. Two different preconditioning procedures have been studied to recover the performance of the devices. These preconditioning procedures include light soaking, annealing and cooling down the device under different atmospheric conditions. J-V curves before any preconditioning showed a `S` shaped behavior and disappears after 15 minutes of light soaking under 1000 Wm-2. Both Atmospheric and Vacuum preconditioning showed similar recovery of the device performance. However, this recovery only lasts for 3 days when the devices were kept under vacuum in the dark.

14 SOLAR ENERGY↗
DOE OSTI2022

An adaptive scalable fully implicit algorithm based on stabilized finite element for reduced visco-resistive MHD

The magnetohydrodynamics (MHD) equations are continuum models used in the study of a wide range of plasma physics systems, including the evolution of complex plasma dynamics in tokamak disruptions. However, efficient numerical solution methods for MHD are extremely challenging due to disparate time and length scales, strong hyperbolic phenomena, and nonlinearity. Additionally, therefore the development of scalable, implicit MHD algorithms and high-resolution adaptive mesh refinement strategies is of considerable importance. In this work, we develop a high-order stabilized finite-element algorithm for the reduced visco-resistive MHD equations based on the MFEM finite element library (mfem.org). The scheme is fully implicit, solved with the Jacobian-free Newton-Krylov (JFNK) method with a physics-based preconditioning strategy. Our preconditioning strategy is a generalization of the physics-based preconditioning methods in Chacón et al. (2002) to adaptive, stabilized finite elements. Algebraic multigrid methods are used to invert sub-block operators to achieve scalability. A parallel adaptive mesh refinement scheme with dynamic load-balancing is implemented to efficiently resolve the multi-scale spatial features of the system. Our implementation uses the MFEM framework, which provides arbitrary-order polynomials and flexible adaptive conforming and non-conforming meshes capabilities. Results demonstrate the accuracy, efficiency, and scalability of the implicit scheme in the presence of large scale disparity. The potential of the AMR approach is demonstrated on an island coalescence problem in the high Lundquist-number regime (≥ 10 7 ) with the successful resolution of plasmoid instabilities and thin current sheets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗