Search NASA⌕ Search

SEARCH · Search NASA

Results for “equation solving”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Supersaturation Variability from Scalar Mixing: Evaluation of a New Subgrid-Scale Model Using Direct Numerical Simulations of Turbulent Rayleigh–Bénard Convection

We report that supersaturation fluctuations in the atmosphere are critical for cloud processes. A nonlinear dependence on two scalars - water vapor and temperature - leads to different behavior than single scalars in turbulent convection. For modeling such multiscalar processes at subgrid scales (SGS) in large-eddy simulations (LES) or convection-permitting models, a new SGS scheme is implemented in CM1 that solves equations for SGS water vapor and temperature fluctuations and their covariance. The SGS model is evaluated using benchmark direct-numerical simulations (DNS) of turbulent Rayleigh–Bénard convection with water vapor as in the Michigan Tech Pi Cloud Chamber. This idealized setup allows thorough evaluation of the SGS model without complications from other atmospheric processes. DNS results compare favorably with measurements from the chamber. Results from LES using the new SGS model compare well with DNS, including profiles of water vapor and temperature variances, their covariance, and supersaturation variance. SGS supersaturation fluctuations scale appropriately with changes to the LES grid spacing, with the magnitude of SGS fluctuations decreasing relative to those at the resolved scale as the grid spacing is decreased. Sensitivities of covariance and supersaturation statistics to changes in water vapor flux relative to thermal flux are also investigated by modifying the sidewall conditions. Relative changes in water vapor flux substantially decrease the covariance and increase supersaturation fluctuations even away from boundaries.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Learning Forecasts of Rare Stratospheric Transitions from Short Simulations

Abstract Rare events arising in nonlinear atmospheric dynamics remain hard to predict and attribute. We address the problem of forecasting rare events in a prototypical example, sudden stratospheric warmings (SSWs). Approximately once every other winter, the boreal stratospheric polar vortex rapidly breaks down, shifting midlatitude surface weather patterns for months. We focus on two key quantities of interest: the probability of an SSW occurring, and the expected lead time if it does occur, as functions of initial condition. These optimal forecasts concretely measure the event’s progress. Direct numerical simulation can estimate them in principle but is prohibitively expensive in practice: each rare event requires a long integration to observe, and the cost of each integration grows with model complexity. We describe an alternative approach using integrations that are short compared to the time scale of the warming event. We compute the probability and lead time efficiently by solving equations involving the transition operator, which encodes all information about the dynamics. We relate these optimal forecasts to a small number of interpretable physical variables, suggesting optimal measurements for forecasting. We illustrate the methodology on a prototype SSW model developed by Holton and Mass and modified by stochastic forcing. While highly idealized, this model captures the essential nonlinear dynamics of SSWs and exhibits the key forecasting challenge: the dramatic separation in time scales between a single event and the return time between successive events. Our methodology is designed to fully exploit high-dimensional data from models and observations, and has the potential to identify detailed predictors of many complex rare events in meteorology.

Finkel, Justin↗
DOE OSTI2020

FY20 Verification of BISON Using Analytic and Manufactured Solutions

In 2010, the U.S. Department of Energy created its first Energy Innovation Hub, which is focused on developing high-fidelity and high-resolution Modeling and Simulation (M&S) tools for modeling of Light Water Reactors (LWRs). This hub, Consortium for Advanced Simulation of LWRs (CASL), has developed an LWR simulation tool called Virtual Environment for Reactor Applications (VERA). The multi-physics capability of VERA is achieved through the coupling of single-physics codes, including BISON, CTF, MPACT, and MAMBA. BISON is a fuel performance code which models the thermo-mechanical behavior of nuclear fuel using high performance M&S. It is capable of modeling traditional LWR fuel rods, fuel plates, and TRi-structural ISOtropic (TRISO) fuel particles. It can employ three-dimensional Cartesian, two-dimensional axisymmetric cylindrical, or one-dimensional radial spherical geometry. It includes empirical models for a large variety of fuel physics: temperature- and burnup-dependent thermal properties, fuel swelling and densification, fission gas production, cladding creep, fracture, cladding plasticity, and gap/plenum models. This document details a series of code verification test problems that are used to test BISON. These problems add confidence that the BISON code is a faithful representation of its underlying mathematical model. The suite of verification tests are mapped to the underlying conservation equations solved by the code: heat conduction, mechanics, and species conservation. Twenty-two problems are added for the heat conduction solution, two for the mechanics solution, and none for species conservation. Method of Manufactured Solutions (MMS) capability is demonstrated with three problems, and temperature drops across the fuel gap are tested.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Stacked networks improve physics-informed training: Applications to neural networks and deep operator networks

Physics-informed neural networks and operator networks have shown promise for effectively solving equations modeling physical systems. However, these networks can happen to be difficult or impossible to train accurately. Here, we present a novel multifidelity framework for stacking physics-informed neural networks and operator networks that facilitates training. We successively build a chain of networks, where the output at one step can act as a low-fidelity input for training a longer chain, gradually increasing the expressivity of the learnt model. The equations imposed at each step of the iterative process can be the same or different (akin to simulated annealing). The iterative (stacking) nature of the proposed method allows us to learn progressively features of a solution which could have been hard to learn directly. Through benchmark problems including a nonlinear pendulum, the wave equation, and the viscous Burgers equation, we show how stacking can be used to improve the accuracy and reduce the required size of physics-informed neural networks and operator networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

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

One-shot learning for solution operators of partial differential equations

Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GW-PINN: A deep learning algorithm for solving groundwater flow equations

Machine learning methods provide new perspective for more convenient and efficient prediction of groundwater flow. In this study, a deep learning method “GW-PINN” without labeled data for solving groundwater flow equations with wells was proposed. GW-PINN takes the physics inform neural network (PINN) as the backbone and uses either the hard or soft constraint in the loss function for training. A locally refined sampling strategy (LRS) is adopted to generate the consistent spatial sampling points for problems with strong hydraulic head change, and then combined with an appropriate temporal sampling scheme to obtain the final spatial-temporal sampling points. A snowball-style two-stage training strategy by dividing the temporal domain into two subdomains is designed to decrease the sampling points. Five cases were designed to test the training performance of GW-PINN under different sampling strategies and two constraints. The predicted results of GW-PINN were compared with MODFLOW and the analytical solution. The results demonstrate that GW-PINN possesses strong ability in capturing the hydraulic head change for both confined and un-confined aquifers. The hard constraint owns more robust learning ability than the soft constraint. The LRS strategy can generate more accurate results with much fewer sampling points than traditional sampling strategies, and the snowball-style two-stage training strategy is significantly efficient for problems with the drastic change of hydraulic head. Additionally, the application of GW-PINN as a surrogate model for parameterized groundwater flow equations is illustrated. This study provides an option tool for efficient groundwater flow simulation, especially for those with local refinements are needed.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Applying Physics-Informed Neural Networks to Solve Navier–Stokes Equations for Laminar Flow around a Particle

In recent years, Physics-Informed Neural Networks (PINNs) have drawn great interest among researchers as a tool to solve computational physics problems. Unlike conventional neural networks, which are black-box models that “blindly” establish a correlation between input and output variables using a large quantity of labeled data, PINNs directly embed physical laws (primarily partial differential equations) within the loss function of neural networks. By minimizing the loss function, this approach allows the output variables to automatically satisfy physical equations without the need for labeled data. The Navier–Stokes equation is one of the most classic governing equations in thermal fluid engineering. This study constructs a PINN to solve the Navier–Stokes equations for a 2D incompressible laminar flow problem. Flows passing around a 2D circular particle are chosen as the benchmark case, and an elliptical particle is also examined to enrich the research. The velocity and pressure fields are predicted by the PINNs, and the results are compared with those derived from Computational Fluid Dynamics (CFD). Additionally, the particle drag force coefficient is calculated to quantify the discrepancy in the results of the PINNs as compared to CFD outcomes. The drag coefficient maintained an error within 10% across all test scenarios.

Hu, Beichao (ORCID:0009000163215151)↗
DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗
DOE OSTI2024

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗
DOE OSTI2026

High-Fidelity, Low-Dissipation/Symmetry-Preserving Numerical Scheme for Solving the Euler Equations with Unstructured, Metric-Based Mesh Adaptation

This work presents an overview of a high-fidelity compressible Euler solver that utilizes the continuous Galerkin (CG) method with added artificial numerical diffusion for stabilization to solve a variety of unsteady and steady benchmark inviscid flow problems. This work shows that discretizing the Euler equations with this CG approach and first order basis functions produces a cost-effective stencil as well as simple well-posed boundary conditions. We show through convergence testing with manufactured solutions that the reduced stencil of CG, combined with the low amount of artificial diffusion required when using the stabilization method outlined in this work, leads to stable and highly accurate results for a variety of unsteady and steady applications. When combined with the adaptive mesh refinement approach used for many of the cases in this work, our results show that the flow solver achieves even more accurate results. A variety of inviscid flow cases are presented in this work, including transient 2D cases with complex shock structures and several steady 3D airfoils sections with a constant span.

Doetsch, Kevin [ORNL] (ORCID:0000000267051705)↗
DOE OSTI2023

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Uniform-density Bose-Einstein condensates of the Gross-Pitaevskii equation found by solving the inverse problem for the confining potential

Here, in this work, we consider a “reverse-engineering” approach to construct confining potentials that support exact, constant density kovaton solutions to the classical Gross-Pitaevskii equation (GPE) also known as the nonlinear Schr¨odinger equation (NLSE). In the one-dimensional case, the exact solution is the sum of stationary kink and anti-kink solutions, i.e. a kovaton, and in the overlapping region, the density is constant. In higher dimensions, the exact solutions are generalizations of this wave function. In the absence of self-interactions, the confining potential is similar to a smoothed out finite square well with minima also at the edges. When self-interactions are added, a term proportional to ±gψ*ψ gets added to the confining potential and ±gM, where M is the norm, gets added to the total energy. In the realm of stability analysis, we find (linearly) stable solutions in the case with repulsive self-interactions which also are stable to self-similar deformations. For attractive interactions, however, the minima at the edges of the potential get deeper and a barrier in the center forms as we increase the norm. This leads to instabilities at a critical value of M (related to the number of particles in the BEC). Comparing the stability criteria from Derrick’s theorem and Bogoliubov-de Gennes analysis stability results, we find that both predict stability for repulsive self-interactions and instability at a critical mass M for attractive interactions. However, the numerical analysis gives a much lower critical mass. The numerical analysis shows further that the initial instabilities violate the symmetry x → -x assumed by Derrick’s theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

SUNDIALS time integrators for exascale applications with many independent systems of ordinary differential equations

Many complex systems can be accurately modeled as a set of coupled time-dependent partial differential equations (PDEs). However, solving such equations can be prohibitively expensive, easily taxing the world’s largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This operator splitting approach is used ubiquitously across scientific domains, and in many cases leads to a set of ordinary differential equations (ODEs) that need to be solved as part of a larger “outer-loop” time-stepping approach. The SUNDIALS library provides a plethora of robust time integration algorithms for solving ODEs, and the U.S. Department of Energy Exascale Computing Project (ECP) has supported its extension to applications on exascale-capable computing hardware. In this paper, we highlight some SUNDIALS capabilities and its deployment in combustion and cosmology application codes (Pele and Nyx, respectively) where operator splitting gives rise to numerous, small ODE systems that must be solved concurrently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum-inspired techniques with classical methods. It focuses on fixed-point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed-point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗