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 343 records · Page 19

Un-collided-flux preconditioning for the first order transport equation

Two codes were tested for the first order neutron transport equation using finite element methods. The un-collided-flux solution is used as a preconditioner for each of these methods. These codes include a least squares finite element method and a discontinuous finite element method. The performance of each code is shown on problems in one and two dimensions. The un-collided-flux preconditioner shows good speedup on each of the given methods. The un-collided-flux preconditioner has been used on the second-order equation, and here we extend those results to the first order equation. (authors)

97 MATHEMATICS AND COMPUTING↗

Plant Decontamination as a Precondition of the Remote Dismantling Concept of the Karlsruhe Vitrification Plant VEK - 12206

Vitrification of the high-active liquid waste concentrates (HAWC) was a major milestone in the WAK decommissioning project (StiWAK). From September 2009 to June 2010, about 56 m{sup 3} of HAWC were vitrified at the Karlsruhe vitrification facility (VEK) and filled into 123 canisters. HAWC vitrification was followed by an extensive rinsing and shutdown program, in the course of which both the VEK process installations and the facilities for the storage and evaporation of high-active fission product solutions (LAVA) are prepared specifically for dismantling. Finally the rinsing programme leads to an overall reduction of the remaining contamination in the installations by a factor of approx. 5 - 10. The amount of liquids arisen from this program has been vitrified and another 17 canisters have been filled. In total, 140 canisters were packed into 5 CASTOR casks that were already transported to the Zwischenlager Nord (interim store North) of EWN GmbH (ZLN) in the mid of February 2011. The melter of the VEK was already shut down in the late November 2010. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

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.]↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

Developing A Fully Implicit Compressible Flow Valve Model in RELAP-7 and Its Application in Short Term BWR Station Black-Out Analyses

This paper presents a set of dynamical models for SRV simulation and their implementation in the RELAP-7 code, which is a new reactor system analysis code being developed at INL. RELAP-7 is based on the MOOSE (the Multi-Physics Object-Oriented Simulation Environment) framework. The compressible flow SRV model covers three different sets of models: fully closed case, subsonic case, and choking case. The RELAP-7 is a fully implicit code and the preconditioned Jacobian-free Newton-Krylov (JFNK) method is used to solve the discretized nonlinear problem. The JFNK method generally needs a good preconditioning scheme to be effective and efficient. There are different ways to precondition the JFNK method. In RELAP-7, two main options are used to obtain the preconditioning matrix: (1) FDP (Finite Difference Preconditioning) option which uses the default finite differencing method provided in the PETSc package. PETSc is the numerical solver software developed by Argonne National Laboratory and used by MOOSE as the numerical solution engine; (2) SMP (Single Matrix Preconditioning) option which requires code developers to provide approximate analytical Jacobian inputs for the important diagonal and off-diagonal terms. Due to the strong discontinuity in the residual vector space when the compressible flow valve model switches from one set of model to another, FDP option cannot guarantee convergence. Instead, accurate analytical Jacobain terms are provided for the compressible flow valve model. With the SMP option selected, the compressible flow valve model can be solved efficiently under different cases. The developed compressible flow valve model has been used for SRV component simulation in several simplified BWR SBO (Station Black-Out) simulations with RELAP-7. This paper only presents cases for short-term SBO in which all the safety systems fail to start and function properly when SBO occurs. Consequently, only the SRVs automatically open and close periodically to control the primary system pressure and discharge the high temperature and high pressure steam into the suppression pool. Although simplified, this case is quite similar to what happened in Fukushima Daiichi Unit 1. Unit 1 had no RCIC system, while the isolation condenser system was believed to be non-functioning, or only available for a very short period of time during the accident. Therefore, the Unit 1 reactor core reached a fuel failure temperature only a few hours into the accident. Two short-term SBO cases will be compared: one with single SRV discharge line which represents all the SRV lines and another case with multi-group SRVs which represent each group of SRV line with different setting points.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

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↗

Solving linear equations with messenger-field and conjugate gradient techniques: An application to CMB data analysis

We discuss linear system solvers invoking a messenger-field and compare them with (preconditioned) conjugate gradient approaches. We show that the messenger-field techniques correspond to fixed point iterations of an appropriately preconditioned initial system of linear equations. We then argue that a conjugate gradient solver applied to the same preconditioned system, or equivalently a preconditioned conjugate gradient solver using the same preconditioner and applied to the original system, will in general ensure at least a comparable and typically better performance in terms of the number of iterations to convergence and time-to-solution. We illustrate our conclusions with two common examples drawn from the cosmic microwave background (CMB) data analysis: Wiener filtering and map-making. In addition, and contrary to the standard lore in the CMB field, we show that the performance of the preconditioned conjugate gradient solver can depend significantly on the starting vector. In conclusion, this observation seems of particular importance in the cases of map-making of high signal-to-noise ratio sky maps and therefore should be of relevance for the next generation of CMB experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Radiation belt seed population and its association with the relativistic electron dynamics: A statistical study: Radiation Belt Seed Population

Using the Van Allen Probes data, we study the radiation belt seed population and it associated with the relativistic electron dynamics during 74 geomagnetic storm events. Based on the flux changes of 1 MeV electrons before and after the storm peak, these storm events are divided into two groups of “non-preconditioned” and “preconditioned”. The statistical study shows that the storm intensity is of significant importance for the distribution of the seed population (336 keV electrons) in the outer radiation belt. However, substorm intensity can also be important to the evolution of the seed population for some geomagnetic storm events. For non-preconditioned storm events, the correlation between the peak fluxes and their L-shell locations of the seed population and relativistic electrons (592 keV, 1.0 MeV, 1.8 MeV, and 2.1 MeV) is consistent with the energy-dependent dynamic processes in the outer radiation belt. For preconditioned storm events, the correlation between the features of the seed population and relativistic electrons is not fully consistent with the energy-dependent processes. It is suggested that the good correlation between the radiation belt seed population and ≤1.0 MeV electrons contributes to the prediction of the evolution of ≤1.0 MeV electrons in the Earth’s outer radiation belt during periods of geomagnetic storms.

79 ASTRONOMY AND ASTROPHYSICS↗

PCG method with Strang’s circulant preconditioner for Hermitian positive definite linear system in Riesz space fractional advection–dispersion equations

In this paper, preconditioned conjugate gradient (PCG) method with Strang’s circulant preconditioner is investigated to solve the Hermitian positive definite linear systems, which is result from the Crank–Nicolson (C-N) finite difference scheme with the weighted and shifted Grünwald difference (WSGD) operators to discretize the Riesz space fractional advection–dispersion equation (RSFADE). We show that the spectrum of the preconditioned matrix is clustered around 1, and the singular values of the preconditioned matrix are uniformly bounded away from zero under a certain condition, respectively; hence the PCG method, when applied to solving the preconditioned system, converges superlinearly. Moreover, the complexity in each iteration of the PCG method is O(Nlog N) via using the fast Fourier transforms, where N is the matrix size. Numerical experiments are included to demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

A Monte Carlo synthetic-acceleration method for solving the thermal radiation diffusion equation

We present a novel synthetic-acceleration-based Monte Carlo method for solving the equilibrium thermal radiation diffusion equation in three spatial dimensions. The algorithm performance is compared against traditional solution techniques using a Marshak benchmark problem and a more complex multiple material problem. Our results show that our Monte Carlo method is an effective solver for sparse matrix systems. For solutions converged to the same tolerance, it performs competitively with deterministic methods including preconditioned conjugate gradient and GMRES. We also discuss various aspects of preconditioning the method and its general applicability to broader classes of problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗