Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Solvers”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Feasibility of a multigroup Boltzmann–Fokker–Planck solution for electron beam dose calculations

Legacy nuclear-reactor Boltzmann solvers start clinical deployment as an alternative to Monte Carlo (MC) codes and Fermi–Eyges semiemprical models in radiation oncology treatment planning. Today’s certified clinical solvers are limited to photon beams. In this paper, ELECTR, a state-of-the-art multigroup electron cross sections generation module in NJOY is presented and validated against Lockwood’s calorimetric measurements, EGS-nrc and GEANT-4 for 1–20 MeV unidirectional electron beams. The nuclear-reactor DRAGON-5 solver is upgraded to access the library and solve the Boltzmann–Fokker–Planck (BFP) equation. A variety of heterogeneous radiotherapy and radiosurgery phantom configurations were used for validation purpose. Case studies include a thorax benchmark, that of a typical breast Intra-Operative Radiotherapy and a high-heterogeneity patient-like benchmark. For all beams, 100% of the water voxels satisfied the American Association of Physicists in Medicine accuracy criterion for a BFP-MC dose error below 2%. At least, 97.0% of adipose, muscle, bone, lung, tumor and breast voxels satisfied the 2% criterion. The average BFP-MC relative error was about 0.56% for all voxels, beams and materials combined. By irradiating homogeneous slabs from Z = 1 (hydrogen) to Z = 99 (einsteinium), we reported performance and defects of the CEPXS mode [US. Sandia National Lab., SAND-89-1685] in ELECTR for the entire periodic table. For all Lockwood’s benchmarks, NJOY-DRAGON dose predictions are within the experimental data precision for 98% of voxels.

42 ENGINEERING↗
DOE OSTI2021

Impact of Numerical Hydrodynamics in Turbulent Mixing Transition Simulations

Underresolved simulations are unavoidable in high Reynolds (Re) and Mach (Ma) number turbulent flow applications at scale. Implicit large-Eddy simulation (ILES) often becomes the effective strategy to capture the dominating effects of convectively driven flow instabilities. We evaluate the impact of three distinct numerical strategies in simulations of transition and turbulence decay with ILES: the Harten–Lax–van Leer (HLL) Riemann solver applying Strang splitting and a Lagrange-plus-Remap formalism to solve the directional sweep—denoted split; the Harten–Lax–Van Leer-Contact (HLLC) Riemann solver using a directionally unsplit strategy and parabolic reconstruction—denoted unsplit; and the HLLC Riemann solver using unsplit and a low-Ma correction (LMC)—denoted unsplit*. Three case studies are considered: (1) a shock tube problem prototyping shock-driven turbulent mixing, (2) the Taylor–Green Vortex (TGV) prototyping transition to turbulence, and, (3) an homogeneous isotropic turbulence (HIT) case, focusing on the impact of discretization on transition and decay from fixed well-characterized initial conditions. Significantly more accurate predictions are provided by the unsplit schemes, in particular, when augmented with the LMC. For given resolution, only the unsplit schemes predict the turbulent mixing transition after reshock observed in the shock tube experiments. Relevant comparisons of ILES based on Euler and Navier–Stokes equations addressing potential occurrence of low-Re regimes in the applications are presented. Unsplit schemes are instrumental in allowing to capture the spatial development of the TGV flow and its validation at prescribed Re with significantly less resolution. HIT analysis confirms higher simulated turbulence Re and increased small-scale content associated with the unsplit discretizations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Solving the Hele–Shaw flow using the Harrow–Hassidim–Lloyd algorithm on superconducting devices: A study of efficiency and challenges

The development of quantum processors for practical fluid flow problems is a promising yet distant goal. Recent advances in quantum linear solvers have highlighted their potential for classical fluid dynamics. In this study, we evaluate the Harrow–Hassidim–Lloyd (HHL) quantum linear systems algorithm (QLSA) for solving the idealized Hele–Shaw flow. Our focus is on the accuracy and computational cost of the HHL solver, which we find to be sensitive to the condition number, scaling exponentially with problem size. This emphasizes the need for preconditioning to enhance the practical use of QLSAs in fluid flow applications. Moreover, we perform shots-based simulations on quantum simulators and test the HHL solver on superconducting quantum devices, where noise, large circuit depths, and gate errors limit performance. Error suppression and mitigation techniques improve accuracy, suggesting that such fluid flow problems can benchmark noise mitigation efforts. Finally, our findings provide a foundation for future, more complex application of QLSAs in fluid flow simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Simulation of electron Bernstein waves using FullWave with a 2D non-local hot plasma model

Hot plasma wave simulation capability is expanded in the FullWave code by updating the hybrid iterative solver in the code with a semi-implicit time stepping method. The new approach is used to simulate Electron Bernstein Wave (EBW) heating in over-dense spherical tokamak plasmas. The code’s hybrid iterative solver circumvents the prohibitive memory cost of direct methods by combining a time evolution of Maxwell’s equations with frequency-domain relaxation, while the conductivity kernel, calculated via 3D particle tracking, captures the essential non-local wave–particle interactions. One-dimensional EBW simulations verify the algorithm’s accuracy by demonstrating mode conversion from X-mode wave to EBW at the upper hybrid resonance and a strong cyclotron damping near the plasma core. Two-dimensional simulation reproduces the predicted short EBW wavelength and quantitatively matches the hot-plasma dispersion relation. This study demonstrates the fidelity of the hybrid solver for the electron cyclotron frequency range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Linearized frequency domain Landau-Lifshitz-Gilbert equation formulation

We present a general finite element linearized Landau-Lifshitz-Gilbert equation (LLGE) solver for magnetic systems under weak time-harmonic excitation field. The linearized LLGE is obtained by assuming a small deviation around the equilibrium state of the magnetic system. Inserting such expansion into LLGE and keeping only first order terms gives the linearized LLGE, which gives a frequency domain solution for the complex magnetization amplitudes under an external time-harmonic applied field of a given frequency. We solve the linear system with an iterative solver using generalized minimal residual method. We construct a preconditioner matrix to effectively solve the linear system. The validity, effectiveness, speed, and scalability of the linear solver are demonstrated via numerical examples.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Multilevel-in-Space-and-Energy CMFD in VERA

For full-core modeling in the Virtual Environment for Reactor Analysis (VERA), the three-dimensional multigroup eigenvalue neutron transport problem is solved by MPACT. To improve the efficiency of MPACT, advancements have been made in the transport accelerator. Multilevel-in-energy and multilevel-in-space coarse mesh finite difference (CMFD) solvers were developed to improve the efficiency of the CMFD accelerator. In this paper a new multilevel-in-space-and-energy CMFD solver is developed with coarsening in both space and energy on every level. Several different strategies are investigated for coarsening groups in energy. Modified V-cycle and multiple-cycle algorithms are evaluated for solving the multilevel equations. The performance of these solvers is compared for typical full-core reactor physics problems.

42 ENGINEERING↗
DOE OSTI2026

Mathematical Models and Numerical Methods for High-Fidelity Simulation of Ignition of Reactive Mixtures by Nanosecond Plasma Discharges in Realistic Configurations

We present a newly developed framework for the numerical simulation of ignition of reactive mixtures using single or repeated nanosecond discharge pulses. The framework builds upon the AMReX library, using the existing compressible solver PeleC and low-Mach solver PeleLMeX and allowing for adaptive mesh refinement, complex geometries, and execution on next-generation high-performance computing (HPC) systems. High-fidelity elementary models are adopted for weakly-ionised plasma discharges with significant energy deposition, consistent with nanosecond discharge pulses, and then implemented in the solver. The treatment of non-thermal electrons and charged species, thermodynamics of non-equilbrium species, plasma kinetics, limiting time scales, and boundary conditions for charged species are discussed and addressed for computational efficiency. The framework is demonstrated for three relevant applications: single and multi-pulse discharges in air, single pulse ignition of an ethylene/air mixture, and a three-dimensional plasma discharge in air with temperature stratification. The successful application of the framework demonstrates the feasibility of high-fidelity simulation of ignition of air/hydrocarbon mixtures in three-dimensions with multiple discharge pulses.

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

Source term method for binary neutron stars initial data

The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗
DOE OSTI2024

Scalable Risk Assessment of Rare Events in Power Systems With Uncertain Wind Generation and Loads

Risk assessment of rare events has become increasingly important in power system planning and operation with the increasing integration of renewable energy and the presence of system uncertainties. However, quantifying the risk posed by rare events via the traditional method, i.e., Monte Carlo sampling (MCS), incurs substantial computational expense stemming from the vast ensemble of power flow simulations. To accelerate the assessment, this paper proposes a Deep Neural Network (DNN)-kernelized vector-valued Gaussian Process (VVGP) approach with excellent computational efficiency while maintaining high accuracy. Consequently, serving as a surrogate model for the power flow solver, the DNN-kernelized VVGP enables significantly faster but accurate risk assessment compared to the power flow solver. The developed surrogate model evaluates low-order N - k events that contain more than 90% instances by adeptly capturing the topological features while the high-order N - k events are assessed via a power flow solver, thereby striking a balance between computational efficiency and uncertainty quantification accuracy. Moreover, the model incorporates a Support Vector Machine (SVM) classifier to resample concerning low-probability tail events to counteract the biases potentially introduced during the DNN-kernelized VVGP evaluations. Simulations conducted on the modified IEEE 24-bus, 118-bus, and European 1354-bus systems demonstrate that the proposed method maintains the accuracy benchmark set by MCS while significantly reducing computational demands in large-scale power systems as compared to other state-of-the-art methods.

17 WIND ENERGY↗
DOE OSTI2025

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗
DOE OSTI2021

Comparison of Radiation Models for a Turbulent Piloted Methane/Air Jet Flame: A Frozen-Field Study

Numerical modeling of radiative transfer in nongray reacting media is a challenging problem in computational science and engineering. The choice of radiation models is important for accurate and efficient high-fidelity combustion simulations. Different applications usually involve different degrees of complexity, so there is yet no consensus in the community. In this paper, the performance of different radiative transfer equation (RTE) solvers and spectral models for a turbulent piloted methane/air jet flame are studied. The flame is scaled from the Sandia Flame D with a Reynolds number of 22,400. Three classes of RTE solvers, namely the discrete ordinates method, spherical harmonics method, and Monte Carlo method, are examined. The spectral models include the Planck-mean model, the full-spectrum k-distribution (FSK) method, and the line-by-line (LBL) calculation. The performances of different radiation models in terms of accuracy and computational cost are benchmarked. The results have shown that both RTE solvers and spectral models are critical in the prediction of radiative heat source terms for this jet flame. The trade-offs between the accuracy, the computational cost, and the implementation difficulty are discussed in detail. The results can be used as a reference for radiation model selection in combustor simulations.

David, Chloe↗
DOE OSTI2024

High- and Mid-Fidelity Modeling Comparison for a Floating Marine Turbine System

There is a lack of suitable numerical tools, particularly open-source tools, that can be used for designing and optimizing marine turbine systems. The National Renewable Energy Laboratory has added features to their widely used mid-fidelity wind turbine modeling code, OpenFAST, to enable modeling of axial-flow marine turbines. This necessitated the addition of several physical effects relevant to marine turbines that are neglected for wind turbines. These include buoyancy, added mass and inertial loads, wave-current superposition, and changes to the coordinate systems. This updated version of OpenFAST allows for the modeling of both fixed and floating marine turbines at a speed comparable to real time. While efficient for large sets of load cases and design studies, mid-fidelity codes make simplifying assumptions that may impact their accuracy. High-fidelity computational fluid dynamics (CFD) simulations can capture more flow effects with fewer assumptions and provide detailed body pressure mapping and flow-field information. It is important to compare predictions between mid-fidelity and high-fidelity codes, both to verify the models and to understand the limitations. A floating marine turbine system was modeled both with OpenFAST and with the commercial CFD code STAR-CCM+. The CFD model used a three-dimensional unsteady Reynolds-averaged Navier-Stokes solver for a volume-of-fluid numerical wave and current tank. The blade-resolved simulations used the sliding-interface technique for the spinning rotor and an overset grid to accommodate the rigid-body motion of the floating system. The mooring system was modeled with a custom coupling of the CFD solver with the open-source code MoorDyn. This improves upon the existing quasi-static catenary solver in STAR-CCM+, which lacks seabed contact or line-to-line connections. Simulation results for a floating marine turbine are compared between OpenFAST and CFD, highlighting the capabilities of the mid-fidelity code and identifying the areas where a high-fidelity approach is needed.

CFD↗
DOE OSTI2023

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Formalization of Core Why3 in Coq

Intermediate verification languages like Why3 and Boogie have made it much easier to build program verifiers, transforming the process into a logic compilation problem rather than a proof automation one. Why3 in particular implements a rich logic for program specification with polymorphism, algebraic data types, recursive functions and predicates, and inductive predicates; it translates this logic to over a dozen solvers and proof assistants. Accordingly, it serves as a backend for many tools, including Frama-C, EasyCrypt, and GNATProve for Ada SPARK. But how can we be sure that these tools are correct? The alternate foundational approach, taken by tools like VST and CakeML, provides strong guarantees by implementing the entire toolchain in a proof assistant, but these tools are harder to build and cannot directly take advantage of SMT solver automation. As a first step toward enabling automated tools with similar foundational guarantees, we give a formal semantics in Coq for the logic fragment of Why3. We show that our semantics are useful by giving a correct-by-construction natural deduction proof system for this logic, using this proof system to verify parts of Why3's standard library, and proving sound two of Why3's transformations used to convert terms and formulas into the simpler logics supported by the backend solvers.

97 MATHEMATICS AND COMPUTING↗