Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithms”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗
DOE OSTI2024

Efficient numerical algorithm for multi-level ionization of high-atomic-number gases

An efficient numerical algorithm for laser driven multi-level ionization of high-atomic-number gases is proposed and implemented in an electromagnetic particle-in-cell code SPACE. The algorithm is based on analytical solutions to the system of differential equations describing ionization evolution. Using analytical solutions resolves the multiscale issue of ionization due to different characteristic time scales of ionization processes and the main code time step. Algorithm efficiency and memory requirements are significantly improved by using a locally reduced system of differential equations. The algorithm also assigns proper orbital quantum numbers and their projections to ionization states. The algorithm is verified and validated using experimental data.

Cheng, A. (ORCID:000000021945282X)↗
DOE OSTI2024

Comparison of source-location algorithms for atmospheric samplers

Numerous algorithms have been developed to determine the source characteristics for an atmospheric release, e.g., (Bieringer et al., 2017). This study compares three models that have been applied to the data collected by the International Monitoring System operated by the Comprehensive Nuclear-Test-Ban Treaty Preparatory Commission to estimate source event parameters. Each model uses a different approach to estimate the parameters. A deterministic model uses a possible source region (PSR) approach (Ringbom et al., 2014) that is based on the correlation between predicted and measured sample values. An unnamed model developed at Pacific Northwest National Laboratory (herein called BAYEST) uses a Bayesian formulation (Eslinger et al., 2019; Eslinger et al., 2020; Eslinger and Schrom, 2016). The FREAR model uses a different Bayesian formulation (De Meutter and Hoffman, 2020; De Meutter et al., 2021; Pieter De Meutter, 2021). The performance of the three source-location models is evaluated with 100 synthetic release cases for the single xenon isotope, 133 Xe. The release cases resulted in detections in a fictitious network with 120 noble gas samplers. All three source-location models use the same sampling data. The two Bayesian models yield more accurate location estimates than the deterministic PSR model, with FREAR having slightly better location performance than BAYEST. Samplers with collection periods of 3, 6, 8, 12, and 24-h were used. Results from BAYEST show that location accuracy improves with each reduction in sample collection length. The BAYEST model is slightly better for estimating the start time of the release. The PSR model has about the same spread in start times as the FREAR model, but the PSR results have a better average start time. The Bayesian source-location algorithms give more accurate results than the PSR approach, and provide release magnitude estimates, while the base PSR model does not estimate the release magnitude. This investigation demonstrates that a reasonably dense sampling grid will sometimes yield poor location and time estimates regardless of the model. The poor estimates generally coincide with cases where there is a much larger distance between the release point and the first detecting sampler than the average sampler spacing.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2024

Algorithms for numerically stable scattering amplitudes

The numerically stable evaluation of scattering matrix elements near the infrared limit of gauge theories is of great importance for the success of collider physics experiments. We present a novel algorithm that utilizes double-precision arithmetic and reaches higher precision than a naive quadruple-precision implementation at smaller computational cost. The method is based on physics-driven modifications to propagators, vertices, and external polarizations. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Adaptive Mesh Refinement Simulations for Turbulent Reacting Flow

With the increased availability of exascale computing hardware, detailed simulations of realistic devices can be performed at practically relevant time and length scales. Insights into the multiscale driving mechanisms in compressible reacting flow systems with complex geometry, such as combustors, can be used for design optimization and technology improvements. However, to effectively perform these simulations, advanced numerical algorithms must be used to maintain solution accuracy without incurring undue computational costs. PeleC, part of the Pele suite of codes, leverages block-structured adaptive mesh refinement (AMR) through the AMReX library to capture fine-scale flow features in compressible reacting flows. In this talk, we discuss recent improvements to the numerical algorithms, particularly in regard to describing flows at complex boundary structures, and PeleC's performance on exascale computing hardware. We will demonstrate that PeleC is well-suited for modern, extreme-scale, heterogenous compute platforms.

combustion↗
DOE OSTI2024

ExaWind: Open‐source CFD for hybrid‐RANS/LES geometry‐resolved wind turbine simulations in atmospheric flows

Abstract Predictive high‐fidelity modeling of wind turbines with computational fluid dynamics, wherein turbine geometry is resolved in an atmospheric boundary layer, is important to understanding complex flow accounting for design strategies and operational phenomena such as blade erosion, pitch‐control, stall/vortex‐induced vibrations, and aftermarket add‐ons. The biggest challenge with high‐fidelity modeling is the realization of numerical algorithms that can capture the relevant physics in detail through effective use of high‐performance computing. For modern supercomputers, that means relying on GPUs for acceleration. In this paper, we present ExaWind, a GPU‐enabled open‐source incompressible‐flow hybrid‐computational fluid dynamics framework, comprising the near‐body unstructured grid solver Nalu‐Wind, and the off‐body block‐structured‐grid solver AMR‐Wind, which are coupled using the Topology Independent Overset Grid Assembler. Turbine simulations employ either a pure Reynolds‐averaged Navier–Stokes turbulence model or hybrid turbulence modeling wherein Reynolds‐averaged Navier–Stokes is used for near‐body flow and large eddy simulation is used for off‐body flow. Being two‐way coupled through overset grids, the two solvers enable simulation of flows across a huge range of length scales, for example, 10 orders of magnitude going from O(μm) boundary layers along the blades to O(10 km) across a wind farm. In this paper, we describe the numerical algorithms for geometry‐resolved turbine simulations in atmospheric boundary layers using ExaWind. We present verification studies using canonical flow problems. Validation studies are presented using megawatt‐scale turbines established in literature. Additionally presented are demonstration simulations of a small wind farm under atmospheric inflow with different stability states.

17 WIND ENERGY↗
DOE OSTI2026

Feasibility Study on Implementing a Staggered-Grid Finite Volume Method for System Analysis Code Development Under the MOOSE Framework

Here, this work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key to the test bed is the implementation of high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. The test bed utilized a more flexible code structure to enable the finite volume method implementation and direct interacting with the solver package, instead of using the natively supported finite element method by the framework. Using a suite of selected test problems with different problem sizes and levels of complexity, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. For a complex reactor model, transient simulation was performed using the newly developed finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development.

MOOSE↗
DOE OSTI2025

Advanced System Thermal Fluids Solver Development for SAM

This work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key is the implementation of a high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. Leveraging the existing capabilities of the SAM code, significant code coverages were established in the finite volume method code. This in turn allows for a suite of test problems with different problem sizes and levels of complexity to be used to quantify the performance improvement of the finite volume method code. As evidently shown in this study, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE for the wide range of selected problems. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. In addition, for a complex reactor model, transient simulation was performed using the finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development. In this work, short-term priority development and testing items were identified, and long-term code adoption and integration plans were made for the eventual deployment of the finite volume method in the SAM code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Sparsified time-dependent Fourier neural operators for fusion simulations

This paper presents a sparsified Fourier neural operator for coupled time-dependent partial differential equations (ST-FNO) as an efficient machine learning surrogate for fluid and particle-based fusion codes such as NIMROD (Non-Ideal Magnetohydrodynamics with Rotation - Open Discussion) and GTC (Gyrokinetic Toroidal Code). ST-FNO leverages the structures in the governing equations and utilizes neural operators to represent Green's function-like numerical operators in the corresponding numerical solvers. Once trained, ST-FNO can rapidly and accurately predict dynamics in fusion devices compared with first-principle numerical algorithms. In general, ST-FNO represents an efficient and accurate machine learning surrogate for numerical simulators for multi-variable nonlinear time-dependent partial differential equations, with the proposed architectures and loss functions. The efficacy of ST-FNO has been demonstrated using quiescent H-mode simulation data from NIMROD and kink-mode simulation data from GTC. The ST-FNO H-mode results show orders of magnitude reduction in memory and central processing unit usage in comparison with the numerical solvers in NIMROD when computing fields over a selected poloidal plane. The ST-FNO kink-mode results achieve a factor of 2 reduction in the number of parameters compared to baseline FNO models without accuracy loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth-order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Achieving Higher Order Accuracy in Space in Hydrodynamic Simulations of Self-Gravitating Gas

Modern astrophysical simulation codes employ a variety of numerical algorithms capable of achieving higher-order accuracy in both space and time. Albeit they succeed in achieving an effective higher spatial resolution and in suppressing the numerical damping of waves, to our knowledge, all current astrophysical simulations invoking self-gravity are limited to second-order accuracy in space. If we can devise an algorithm to evaluate self-gravity with a higher-order spatial accuracy, we can better the evaluation of the gravitational acceleration and gravitational energy release which dictate the evolution of many astrophysical systems. Herein, we present a numerical algorithm for self-gravitating hydrodynamics capable of achieving fourth order accuracy for a given density distribution on a Cartesian uniform grid. First, we derive the cell-averaged gravitational potential at fourth-order accuracy from the cell-averaged density by solving the Poisson equation. Next, we obtain the cell average of the product of the density and gravitational acceleration, which differs from the cell-averaged density multiplied by the cell-averaged gravitational acceleration. We then show the verification of the algorithm by applying it to critical test problems: (1) maintaining equilibria of self-gravitating slabs, even upon advection, (2) evolving a polytropic sphere with a massive power-law envelope, and (3) conservation of specific entropy during the propagation of a sound wave.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Development of High-Fidelity and Efficient Modeling Capabilities for Enabling Co-Optimization of Fuels and Multi-Mode Engines

The objective of this closely coordinated research project is to develop improved physical sub-models and innovative numerical algorithms to enable accurate and efficient predictions of multi-mode combustion to support EERE’s Co-Optima program. To this end, a research pro-gram is proposed that seeks • to develop accurate submodels for predicting multi-mode combustion regimes, wall-heat transfer, non-equilibrium plasma ignition, and combustion-mode transition, • to develop dynamic load-rebalancing algorithms and efficient semi-implicit time-integration schemes for enabling exascale computing, • to validate the computational submodels against experiments and direct numerical simulation (DNS) data in conjunction with sensitivity analysis, and • to support the direct transition of the resulting sub-models into other engine-simulation tools through the development of self-contained modules. All sub-models will be integrated into the open-source exascale engine-simulation platform Nek5000.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Euler equations and the Sod shock tube problem

The Euler equations are a subset of the magnetohydrodynamic (MHD) equations in the infinitely collisional, unmagnetized limit. MHD modeling is central to many areas of plasma physics, ranging from low-temperature glow discharges to inertial confinement fusion. An important aspect of the Euler equations is their ability to describe states with discontinuities, such as shock waves. A standard benchmark test for numerical implementation of the Euler equations is the Sod shock tube. In this test, the system is initialized at rest with a pressure and density discontinuity, which results in a shock wave traveling into the low-pressure region and a rarefaction wave traveling into the high-pressure region. Starting with the presentation of the Euler equations, a numerical algorithm is presented here to solve these equations in one dimension. This is followed by an overview of the Sod shock tube problem that includes the precise initial setup and the analytic solution. Finally, the analytic solution is compared with results from numerical simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Energy-momentum-conserving stochastic differential equations and algorithms for the nonlinear Landau-Fokker-Planck equation

Coulomb collision is a fundamental diffusion process in plasmas that can be described by the Landau-Fokker-Planck (LFP) equation or the stochastic differential equation (SDE). While energy and momentum are conserved exactly in the LFP equation, they are conserved only on average by the conventional corresponding SDEs, suggesting that the underlying stochastic process may not be well defined by such SDEs. Here, in this study, we derive new SDEs with exact energy-momentum conservation for the Coulomb collision by factorizing the collective effect of field particles into individual particles and enforcing Newton's third law. These SDEs, when interpreted in the Stratonovich sense, have a particularly simple form that represents pure diffusion between particles without drag. To demonstrate that the new SDEs correspond to the LFP equation, we develop numerical algorithms that converge to the SDEs and preserve discrete conservation laws. Simulation results are presented in a benchmark of various relaxation processes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗