Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “direct solver”

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 OSTI2024

DNS of Flame Stabilization Dynamics of a Swirl-Stabilized Spray Burner Using Sustainable Aviation Fuels

Concern for emission reduction has motivated the development of new cost-effective alternative sustainable aviation fuels (SAFs). Drop-in SAFs with blends of the certified and the alternative fuels are beneficial because they do not require engine modifications for use in current aviation engines. Combustion characteristics are of particular concern when comparing a new fuel with Jet-A. Lean blow-off and flame stabilization have been identified to be governed by the fuel propensity to autoignition, i.e. derived cetane number. However, fundamental investigation is required to identify the impact of derived cetane number on the combustion mode of flame stabilization in a realistic combustor. The combustion mode has also a direct impact on turbulent combustion modeling closures. DNS simulations are performed in the low-Mach solver of the Pele Suite called PeleLMeX. Lagrangian multi-phase modeling is used to capture the liquid spray injection of Jet-A (reference fuel) and C1 as a representative of a low cetane number SAF. Adaptive Mesh Refinement (AMR) is used to enable a more efficient simulation of a more realistic domain size and embedded boundary treatment is used to model a bluff-body geometry. Local extinction and edge flame propagation were observed for both fuels. The edge flame propagation mode was quantified in terms of a Damkohler number defined as the ratio between progress variable reaction rate and its diffusive flux. Initial analysis suggests that a mixed mode combustion occurs for the edge flame propagation, with flame propagation assisted by ignition and autoignition co-existing for both Jet-A and C1 flames. The analysis of the extinction region shows a larger progress variable for Jet-A which can further increase the local displacement speed and present a faster reignition of the stoichiometric mixture fraction.

adaptive mesh refinement↗
DOE OSTI2023

MOOSE Reactor Module: An Open-Source Capability for Meshing Nuclear Reactor Geometries

The U.S. Department of Energy (DOE) Nuclear Energy Advanced Modeling and Simulation (NEAMS) program has developed numerous physics solvers utilizing the open-source Multiphysics Object-Oriented Simulation Environment (MOOSE) framework for multiphysics reactor analysis. These solvers require input finite element meshes representing the discretized spatial domain. Typically, reactor analysts turn to licensed tools for the creation of reactor geometry meshes. Recently, open-source functionality has been added to the MOOSE framework to mesh common reactor geometries and improve MOOSE-based nuclear reactor application user workflows. The new functionality is primarily contained in the new Reactor module of MOOSE and includes support for hexagonal pins, assemblies, and cores, extended Cartesian geometry support, options for modeling static and rotating control drums within a hexagonal assembly, core periphery triangulation, and automatic tagging of pin, assembly, plane, and depletion regions for easier post processing of physics results. A set of reactor geometry mesh builder objects further streamlines the construction of hexagonal and Cartesian cores and allows mapping of materials to regions during mesh generation. The meshes produced with the MOOSE Reactor module may be used directly within MOOSE-based applications or exported as Exodus II files for use in other finite element solvers. The tools have been demonstrated and verified using a variety of NEAMS physics solvers on a range of reactor applications, including a sodium-cooled fast reactor core analysis using Griffin, a fast reactor assembly thermal deformation analysis using MOOSE Tensor Mechanics, and a heat pipe–cooled microreactor coupled analysis using Griffin, Bison, and Sockeye. MOOSE’s Reactor module provides significant advantages compared to the use of external meshing tools when analyzing Cartesian and hexagonal reactor lattices using MOOSE-based applications: immediate accessibility (open-source) to the end user, low barrier to entry for new users, speed of mesh generation, volume preservation of meshed fuel pins, and simplification of analysis workflow when used in conjunction with MOOSE-based applications.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

DESC: A stellarator equilibrium solver

In this paper, the new code DESC is presented to solve for fixed-boundary ideal magnetohydrodynamic equilibria in stellarators. The approach directly solves the equilibrium force balance as a system of nonlinear equations in the form f(x) = 0. The independent variables x represent nested magnetic flux surfaces expressed in the inverse representation with toroidal flux coordinates, and the equations f(x) quantify equilibrium force balance errors at discrete points in real space. Discretizing with global Fourier–Zernike basis functions properly treats the magnetic axis and minimizes the number of coefficients needed to describe the flux surfaces. The pseudospectral method provides great flexibility in where the errors are evaluated, and the system of equations is efficiently solved with a Newton–Raphson iteration. Equilibria are computed and compared against VMEC for both axisymmetric and non-axisymmetric examples. The results show fast convergence rates and solutions with low errors throughout the plasma volume.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

MOOSE framework enhancements for meshing reactor geometries

MOOSE is an open-source, parallel finite element framework designed to permit rapid development of robust multi-physics modeling capabilities. Under the DOE-NEAMS program, numerous solvers have been developed utilizing the open-source MOOSE framework for multiphysics reactor analysis. These solvers require input finite element meshes representing the discretized geometry. Typically, reactor analysts turn to licensed external tools for creation of reactor geometry meshes. Recently, enhancements have been added to the MOOSE framework to mesh common reactor geometries and improve MOOSE-based application user workflows. Support for hexagonal pins, assemblies, and cores has been added, and Cartesian support has been extended. Options for modeling static and rotating control drums within a hexagonal assembly are now available. Pin, assembly, and plane regions can be identified through automatically applied tags on the mesh called 'reporting IDs' for easier post- processing of physics results. An external open-source triangle routine has been leveraged within MOOSE to mesh core periphery zones. A set of reactor geometry builder routines further streamline the construction of hexagonal and Cartesian cores and include the ability to assign materials to regions during mesh generation. The new meshing routines are available through the MOOSE framework in the open-source 'Reactor' module, and the resulting directly within MOOSE-based applications or exported as Exodus II files for use in other finite element solvers. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Development of a three-dimensional APOLLO3 neutrons deterministic scheme for the CABRI reactor

CABRI is an experimental reactor to study the fuel behavior during reactivity injection transients. These transients being highly multiphysics, the development of suitable modeling and simulation tools to simulate them is important for the optimization of the tests and the control of the experimental conditions. This paper focuses on the development of an APOLLO3 deterministic core calculation tool dedicated to the CABRI transient analysis. It represents the first stage of the incremental process for the implementation of a multiphysics time-dependent modeling of the CABRI transient. The neutron calculation scheme is based on a classical two-step approach. The first step consists of a 281-energy group calculation flux with the TDT-MOC (Method Of Characteristics) solver for cross-section space and energy (23 groups) collapsing for the CABRI different assembly clusters. The bias on a 2D core neutron calculation due to the self-shielding calculation and collapsing on a restricted pattern are investigated thanks to a comparison with a direct full 2D calculation on a quarter of core. The second step relies on a pin-resolved transport 3D transport core calculation with the SN solver MINARET. A progressive numerical validation process is followed to quantify the calculation biases on reactivity and reaction rates at each step using reference calculations with the stochastic code TRIPOLI4. The next development stage toward a multiphysics scheme will be the implementation of the 3D-kinetics equation resolution and the coupling with a core thermal-hydraulics model. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Exact and locally implicit source term solvers for multifluid-Maxwell systems

Recently, a family of models that couple multifluid systems to the full Maxwell equations have been used in laboratory, space, and astrophysical plasma modeling. These models are more complete descriptions of the plasma than reduced models like magnetohydrodynamic (MHD) since they are derived more closely from the full kinetic Vlasov-Maxwell system, without assumptions like quasi-neutrality, negligible electron mass, etc. Thus these models naturally retain non-ideal MHD effects like electron inertia, Hall term, pressure anisotropy/nongyrotropy, displacement current, among others. One obstacle to broader application of these model is that an explicit treatment of their source terms leads to the need to resolve rapid processes like plasma oscillation and electron cyclotron motion, even when these are not important. In this paper, we suggest two ways to address this issue. First, we derive the analytic solutions to the source update equations, which can be implemented as a practical, but less generic solver. We then develop a time-centered, locally implicit algorithm to update the source terms, allowing stepping over the fast kinetic time-scales. For a plasma with S species, the locally implicit algorithm involves inverting a local (3 S + 3) × (3 S + 3) matrix only, thus is very efficient. The performance can be further increased by using the direct update formulas to skip null calculations. In this paper, we present benchmarks illustrating the exact energy-conservation of the locally implicit solver, as well as its efficiency and robustness for both small-scale, idealized problems and largescale, complex systems. The locally implicit algorithm can be also easily extended to include other local sources, like collisions and ionization, which are difficult to solve analytically.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

On a Spectral Method for β -particle Bound Excitation Collisions in Kilonovae

The interaction of β-particles with the weakly ionized plasma background is an important mechanism for powering the kilonova (KN) transient signal from neutron star mergers. For this purpose, we present an implementation of the approximate fast-particle collision kernel, described by Inokuti following the seminal formulation of Bethe, in a spectral solver of the Vlasov–Maxwell–Boltzmann equation. In particular, we expand the fast-particle plane-wave atomic excitation kernel into coefficients of the Hermite basis, and derive the relevant discrete spectral system. In this fast-particle limit, the approach permits the direct use of atomic data, including optical oscillator strengths, normally applied to photon–matter interaction. The resulting spectral matrix is implemented in the MASS-APP spectral solver framework, in a way that avoids full matrix storage per spatial zone. We numerically verify aspects of the matrix construction, and present a proof-of-principle 3D simulation of a 2D axisymmetric KN ejecta snapshot. Our preliminary numerical results indicate that a reasonable choice of Hermite basis parameters for β-particles in the KN is a bulk velocity parameter u = 0, a thermal velocity parameter α = 0.5c, and a 9 × 9 × 9 mode velocity basis set (Hermite orders of 0–8 in each dimension). For interior-ejecta sample zones, we estimate that the ratio of thermalization from large-angle (≳2fdg5) bound excitation scattering to total thermalization is ~0.002–0.003.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Improvement of Numerical Methods in Pronghorn

During the fiscal year of 2021, the finite-volume method (FVM) was deployed in Pronghorn to provide improved efficiency, stability, and accuracy for coarse-mesh, thermal-hydraulics problems. While the main goals of fiscal year 2021 were met, several issues emerged from the early deployment of the finite-volume method in Pronghorn. These issues were: The compressible and incompressible formulations that were implemented are inadequate for many nuclear reactor flow problems; Omission of terms accounting for the porosity and Darcy-Forchheimer body force discontinuities in the Rhie-Chow interpolation lead to oscillations in pressure and velocity at these discontinuities; The FVM lacks a correction for non-orthogonal grids for computing accurate pressure gradient leading to loss of accuracy in regions with skewed elements; The FVM currently uses a monolithic solver. Monolithic solvers have issues dealing with the saddle-point nature of the discretized fluid equations. The result are bad convergence if direct factorization is not used and large memory consumption when direct factorization is used. These four issues are addressed in this report. In particular, we report the completion of the following task: Implementation of a weakly compressible formulation in the MOOSE Navier-Stokes module; Implementation of Moukalled’s method for including body forces in the RCI. Additionally, we identified the need to smooth the porosity using Moukalled’s face-cell smoothing operator; Implementation of a non-orthogonal correction for the Green-Gauss gradient computation; Preliminary implementation of a SIMPLE segregated solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Low-order preconditioning of the Stokes equations

A well-known strategy for building effective preconditioners for higher-order discretizations of some PDEs, such as Poisson's equation, is to leverage effective preconditioners for their low-order analogs. In this work, we show that high-quality preconditioners can also be derived for the Taylor–Hood discretization of the Stokes equations in much the same manner. In particular, we investigate the use of geometric multigrid based on the Q 1 iso Q 2 /Q 1 discretization of the Stokes operator as a preconditioner for the Q 2 /Q 1 discretization of the Stokes system. We utilize local Fourier analysis to optimize the damping parameters for Vanka and Braess–Sarazin relaxation schemes and to achieve robust convergence. Furthermore, these results are then verified and compared against the measured multigrid performance. While geometric multigrid can be applied directly to the Q 2 /Q 1 system, our ultimate motivation is to apply algebraic multigrid within solvers for Q 2 /Q 1 systems via the Q 1 iso Q 2 /Q 1 discretization, which will be considered in a companion paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗
DOE OSTI2022

Wind farm response to mesoscale-driven coastal low level jets: a multiscale large eddy simulation study

Realistic atmospheric turbulence–wind farm interactions during coastal low-level jet (LLJ) events are captured using high-fidelity, mesoscale-driven large eddy simulations (LES) to understand wind turbine loads, wakes and overall performance. The simulation has been carried out using the ExaWind aeroelastic solver, AMR-Wind. The simulations have been compared against a baseline unstable case matching the wind speed, wind direction and TI at hub-height location. Results indicate that the LLJ has negative impacts on the turbine hub and tower loads, and opens up potential avenues for design load mitigation strategies.

17 WIND ENERGY↗
DOE OSTI2020

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Toward a QUBO-Based Density Matrix Electronic Structure Method

Density matrix electronic structure theory is used in many quantum chemistry methods to “alleviate” the computational cost that arises from directly using wave functions. Although density matrix based methods are computationally more efficient than wave function based methods, significant computational effort is involved. Because the Schrödinger equation needs to be solved as an eigenvalue problem, the time-to-solution scales cubically with the system size in mean-field type approaches such as Hartree–Fock and density functional theory and is solved as many times in order to reach charge or field self-consistency. We hereby propose and study a method to compute the density matrix by using a quadratic unconstrained binary optimization (QUBO) solver. This method could be useful to solve the problem with quantum computers and, more specifically, quantum annealers. Our proposed approach is based on a direct construction of the density matrix using a QUBO eigensolver. We explore the main parameters of the algorithm focusing on precision and efficiency. We show that, while direct construction of the density matrix using a QUBO formulation is possible, the efficiency and precision have room for improvement. Moreover, calculations performed with quantum annealing on D-Wave’s new Advantage quantum computer are compared with results obtained with classical simulated annealing, further highlighting some problems of the proposed method. Finally, we also suggest alternative methods that could lead to a more efficient QUBO-based density matrix construction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Conditional diffusion machine-learning framework for mapping valence electron distribution from convergent beam electron diffraction

Quantitative convergent beam electron diffraction (CBED) enables determination of aspherical valence electron distributions through refinement of low-order structure factors, which are highly sensitive to chemical bonding and charge density variations. However, conventional quantitative CBED (QCBED) requires solving a highly nonlinear inverse problem with many coupled parameters, and computationally intensive dynamical diffraction calculations, making it time-consuming and difficult to apply to complex systems. More broadly, reconstructing charge density and orbital electron distribution from diffraction data has long been a central challenge in both x-ray and electron crystallography. Here, in this study, we introduce an artificial-intelligence (AI)-based framework that replaces traditional refinement with a data-driven inverse solver. Using a large synthetic CBED dataset generated by Bloch-wave simulations, we train a conditional diffusion model to directly infer crystal structural parameters and multipole density formalism parameters, and hence valence electron distributions, from CBED patterns alone. By learning from forward simulations across realistic parameter space, the model effectively solves the inverse problem. Compared with direct regression approaches, the diffusion-based framework provides posterior parameter distributions for rigorous uncertainty quantification while preserving quantitative fidelity and reducing analysis time by orders of magnitude. By eliminating the need for external single-crystal x-ray diffraction data and complex nonlinear refinement, this approach enables practical, high-throughput, and in situ quantitative CBED, enabling real-time mapping of valence electron distributions and their correlation with functional responses in quantum and energy materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

GRIDAPPSD/distopf (33583-E)

DistOPF is an open-source Python package providing a three-phase, asymmetric optimal power flow (OPF) tool specifically designed for distribution systems. The key inventive features include: - Asymmetrical 3-phase OPF modeling for distribution systems with unbalanced phases - Comprehensive control optimization supporting both active (P) and reactive (Q) power control variables - Built-in visualization and validation tools - Standard test system benchmarking platform for algorithm development and comparison - Modular CSV-based input system using Pandas DataFrames for flexible model specification - Standard power distribution model importer enabling direct conversion from CIM and OpenDSS format to optimization-ready models - Multiple solve interface compatibility (PYOMO, CVXPY, SciPy) with automatic solver selection based on problem type

Gray, Nathan [Pacific Northwest National Laborator↗
DOE OSTI2025

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗