Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗
DOE OSTI2024

Numerical modelling of impact seismic sources using the stress glut theory

SUMMARY Meteorite impacts have proved to be a significant source of seismic signal on the Moon, and have now been recorded on Mars by InSight seismometers. Understanding how impacts produce seismic signal is key to the interpretation of this unique data, and to improve their identification in continuous seismic records. Here, we use the seismic Representation Theorem, and particularly the stress glut theory, to model the seismic motion resulting from impact cratering. The source is described by equivalent forces, some resulting from the impactor momentum transfer, and others from the stress glut, which represents the mechanical effect of plasticity and non linear processes in the source region. We condense these equivalent forces into a point-source with a time-varying single force and nine-component moment tensor. This analytical representation bridges the gap between the complex dynamics of crater formation, and the linear point-source representation classically used in seismology. Using the multiphysics modelling software HOSS, we develop a method to compute the stress glut of an impact, and the associated point-source from hypervelocity impact simulations. For a vertical and an oblique impact at 1000 m s−1, we show that the moment tensor presents a significant deviatoric component. Hence, the source is not an ideal isotropic explosion contrary to previous assumptions, and draws closer to a double couple for the oblique impact. The contribution of the point force to the seismic signal appears negligible. We verify this model by comparing two signals: (1) HOSS is coupled to SPECFEM3D to propagate the near-source signal elastically to remote seismic stations; (2) the point-source model derived from the stress-glut theory is used to generate displacements at the same distance. The comparison shows that the point-source model is accurately simulating the low-frequency impact seismic waveform, and its seismic moment is in trend with Lunar and Martian impact data. High-frequencies discrepancies exist, which are partly related to finite-source effects, but might be further explained by the difference in mathematical framework between classical seismology and HOSS’ numerical modelling.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Neural message-passing for objective-based uncertainty quantification and optimal experimental design

Various real-world scientific applications involve the mathematical modeling of complex uncertain systems with numerous unknown parameters. Accurate parameter estimation is often practically infeasible in such systems, as the available training data may be insufficient and the cost of acquiring additional data may be high. In such cases, based on a Bayesian paradigm, we can design robust operators retaining the best overall performance across all possible models and design optimal experiments that can effectively reduce uncertainty to enhance the performance of such operators maximally. While objective-based uncertainty quantification (objective-UQ) based on MOCU (mean objective cost of uncertainty) provides an effective means for quantifying uncertainty in complex systems, the high computational cost of estimating MOCU has been a challenge in applying it to real-world scientific/engineering problems. In this work, we propose a novel scheme to reduce the computational cost for objective-UQ via MOCU based on a data-driven approach. We adopt a neural message-passing model for surrogate modeling, incorporating a novel axiomatic constraint loss that penalizes an increase in the estimated system uncertainty. As an illustrative example, we consider the optimal experimental design (OED) problem for uncertain Kuramoto models, where the goal is to predict the experiments that can most effectively enhance robust synchronization performance through uncertainty reduction. We show that our proposed approach can accelerate MOCU-based OED by four to five orders of magnitude, without any visible performance loss compared to the state-of-the-art. The proposed approach applies to general OED tasks, beyond the Kuramoto model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Mathematical Tools for the Analysis of Periodic and Aperiodic Grid Signals

Numerous sensing techniques and instrumentation are used in determining the state of the electric grid. Coupled with such measurements are the methods and analysis tools used. The parameters of interest result in both periodic and aperiodic signals. An examination of appropriate analysis tools is presented

97 MATHEMATICS AND COMPUTING↗
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 ↗
DOE OSTI2023

Catalyst: Fast and flexible modeling of reaction networks

We introduce Catalyst.jl, a flexible and feature-filled Julia library for modeling and high-performance simulation of chemical reaction networks (CRNs). Catalyst supports simulating stochastic chemical kinetics (jump process), chemical Langevin equation (stochastic differential equation), and reaction rate equation (ordinary differential equation) representations for CRNs. Through comprehensive benchmarks, we demonstrate that Catalyst simulation runtimes are often one to two orders of magnitude faster than other popular tools. More broadly, Catalyst acts as both a domain-specific language and an intermediate representation for symbolically encoding CRN models as Julia-native objects. This enables a pipeline of symbolically specifying, analyzing, and modifying CRNs; converting Catalyst models to symbolic representations of concrete mathematical models; and generating compiled code for numerical solvers. Leveraging ModelingToolkit.jl and Symbolics.jl, Catalyst models can be analyzed, simplified, and compiled into optimized representations for use in numerical solvers. Finally, we demonstrate Catalyst’s broad extensibility and composability by highlighting how it can compose with a variety of Julia libraries, and how existing open-source biological modeling projects have extended its intermediate representation.

59 BASIC BIOLOGICAL SCIENCES↗
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

Green's function methods for multiphysics simulations (Final Report)

Green's functions are important tools for analyzing mathematical properties of partial differential equations (PDEs), and for numerically solving PDEs, especially when equations for the same operator but with multiple right hand sides need to be solved simultaneously. This proposal aims at developing efficient and accurate numerical methods for computing Green's functions, which can be used to tackle a challenging question in multiphysics simulation of DOE-mission science problems: how to couple quantum physics with classical physics. The key mathematical difficulty is properly formulate a "boundary condition" for the region described by quantum physics, and conventional approaches often model such boundary conditions in an empirical way. The proposed Green's function methods use the Dirichlet-to-Neumann map to formulate a boundary condition that is non-empirical and can couple the quantum and classical regions in an in principle exact way. The key ingredient of the new methods is to construct the Dirichlet-to-Neumann map in an efficient, accurate and versatile manner. The new methods have provably low complexity and are ideally suited for massively parallel and emerging many-core computational systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Structure-Preserving Decorated Particle Method for the Vlasov-Poisson System

We revisit the Scovel-Weinstein framework (Scovel & Weinstein, CPAM 1994) for reducing the Vlasov-Poisson system while preserving its Hamiltonian structure. Standard particle-in-cell (PIC) algorithms approximate the distribution function by macro-particles with position and velocity. In contrast, Scovel-Weinstein decorated particles involve additional shape degrees of freedom, while maintaining a finite-dimensional reduction with Hamiltonian structure inherited from the continuum model. Although the original work established this structure three decades ago, its computational potential has remained largely unexplored. We present a practical implementation of the Scovel-Weinstein model and compare it with a standard PIC algorithm. Numerical experiments demonstrate that macro-particles in standard PIC can be replaced by far fewer decorated particles while retaining comparable accuracy. This decorated particle approach offers a new structure-preserving paradigm for kinetic plasma simulation.

65M75, 70H05, 70G65↗
DOE OSTI2023

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Spherical Parameter Estimation and MPDV Applications

A new algebraic least square approach is presented for estimating effective zero center for verification of MPDV(Multichannel Photon Doppler Velocimetry) probe designs. Unlike previous algebraic least square methods for spherical parameter estimation, the new method can be shown to be concise in mathematic formulations, easy of computations, invariant under rigid -body transformations, no need for numerical approximations, and precise in dealing with precise data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Direct numerical simulations of turbulent reacting flows with shock waves and stiff chemistry using many-core/GPU acceleration

Compressible reacting flows may display sharp spatial variation related to shocks, contact discontinuities or reactive zones embedded within relatively smooth regions. The presence of such phenomena emphasizes the relevance of shock-capturing schemes such as the weighted essentially non-oscillatory (WENO) scheme as an essential ingredient of the numerical solver. However, these schemes are complex and have more computational cost than the simple high-order compact or non-compact schemes. In this paper, we present the implementation of a seventh-order, minimally-dissipative mapped WENO (WENO7M) scheme in a newly developed direct numerical simulation (DNS) code called KAUST Adaptive Reactive Flows Solver (KARFS). In order to make efficient use of the computer resources and reduce the solution time, without compromising the resolution requirement, the WENO routines are accelerated via graphics processing unit (GPU) computation. The performance characteristics and scalability of the code are studied using different grid sizes and block decomposition. Furthermore, the performance portability of KARFS is demonstrated on a variety of architectures including NVIDIA Tesla P100 GPUs and NVIDIA Kepler K20X GPUs. In addition, the capability and potential of the newly implemented WENO7M scheme in KARFS to perform DNS of compressible flows is also demonstrated with model problems involving shocks, isotropic turbulence, detonations and flame propagation into a stratified mixture with complex chemical kinetics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Direct numerical simulation of a high-pressure hydrogen micromix combustor: Flame structure and stabilisation mechanism

A high-pressure hydrogen micromix combustor has been investigated using direct numerical simulation with detailed chemistry to examine the flame structure and stabilisation mechanism. The configuration of the combustor was based on the design by Schefer et al., using numerical periodicity to mimic a large square array. A precursor simulation of an opposed jet-in-crossflow was first conducted to generate appropriate partially-premixed inflow boundary conditions for the subsequent reacting simulation. The resulting flame can be described as an predominantly-lean inhomogeneously-premixed lifted jet flame. Five main zones were identified: a jet mixing region, a core flame, a peripheral flame, a recirculation zone, and combustion products. The core flame, situated over the jet mixing region, was found to burn as a thin reaction front, responsible for over 85% of the total fuel consumption. The peripheral flame shrouded the core flame, had low mean flow with high turbulence, and burned at very lean conditions (in the distributed burning regime). It was shown that turbulent premixed flame propagation was an order-of-magnitude too slow to stabilise the flame at these conditions. Stabilisation was identified to be due to ignition events resulting from turbulent mixing of fuel from the jet into mean recirculation of very lean hot products. Ignition events were found to correlate with shear-driven Kelvin-Helmholtz vortices, and increased in likelihood with streamwise distance. At the flame base, isolated events were observed, which developed into rapidly burning flame kernels that were blown downstream. Further downstream, near-simultaneous spatially-distributed ignition events were observed, which appeared more like ignition sheets. The paper concludes with a broader discussion that considers generalising from the conditions considered here.

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

GPU-enabled extreme-scale turbulence simulations: Fourier pseudo-spectral algorithms at the exascale using OpenMP offloading

Fourier pseudo-spectral methods for nonlinear partial differential equations are of wide interest in many areas of advanced computational science, including direct numerical simulation of three-dimensional (3-D) turbulence governed by the Navier-Stokes equations in fluid dynamics. This paper presents a new capability for simulating turbulence at a new record resolution up to 35 trillion grid points, on the world's first exascale computer, Frontier, comprising AMD MI250x GPUs with HPE's Slingshot interconnect and operated by the US Department of Energy's Oak Ridge Leadership Computing Facility (OLCF). Key programming strategies designed to take maximum advantage of the machine architecture involve performing almost all computations on the GPU which has the same memory capacity as the CPU, performing all-to-all communication among sets of parallel processes directly on the GPU, and targeting GPUs efficiently using OpenMP offloading for intensive number-crunching including 1-D Fast Fourier Transforms (FFT) performed using AMD ROCm library calls. With 99% of computing power on Frontier being on the GPU, leaving the CPU idle leads to a net performance gain via avoiding the overhead of data movement between host and device except when needed for some I/O purposes. Memory footprint including the size of communication buffers for MPI_ALLTOALL is managed carefully to maximize the largest problem size possible for a given node count. Detailed performance data including separate contributions from different categories of operations to the elapsed wall time per step are reported for five grid resolutions, from 2048 3 on a single node to 32768 3 on 4096 or 8192 nodes out of 9408 on the system. Both 1D and 2D domain decompositions which divide a 3D periodic domain into slabs and pencils respectively are implemented. The present code suite (labeled by the acronym GESTS, GPUs for Extreme Scale Turbulence Simulations) achieves a figure of merit (in grid points per second) exceeding goals set in the Center for Accelerated Application Readiness (CAAR) program for Frontier. The performance attained is highly favorable in both weak scaling and strong scaling, with notable departures only for 2048 3 where communication is entirely intra-node, and for 32768 3 , where a challenge due to small message sizes does arise. Communication performance is addressed further using a lightweight test code that performs all-to-all communication in a manner matching the full turbulence simulation code. Performance at large problem sizes is affected by both small message size due to high node counts as well as dragonfly network topology features on the machine, but is consistent with official expectations of sustained performance on Frontier. Overall, although not perfect, the scalability achieved at the extreme problem size of 32768 3 (and up to 8192 nodes — which corresponds to hardware rated at just under 1 exaflop/sec of theoretical peak computational performance) is arguably better than the scalability observed using prior state-of-the-art algorithms on Frontier's predecessor machine (Summit) at OLCF. New science results for the study of intermittency in turbulence enabled by this code and its extensions are to be reported separately in the near future.

3D fast Fourier transform↗
DOE OSTI2020

The use of seismic spatial gradients in a single layer neural network for seismic source discrimination: proof of concept

This report describes a proof-of-concept method of seismic source discrimination using seismic gradiometry and a common machine learning technique. The tests described here are purely numerical, using synthetic seismic data and well understood mathematical techniques. The primary innovation described here is the application of a richer seismic data set derived from seismic gradiometry. Seismic gradiometry is a method to estimate the time variable spatial gradient of the wavefield to compute various wavefield attributes such as slowness, dynamic strain, and rotational motions. With the addition of these wavefield attributes, we are afforded up to twenty "compo- nents" of time series data measured at a single point on, or in, the Earth. This is in direct contrast to conventional three-component seismic data collected at several locations using a seismic network. Using the gradiometrically-derived wavefield components directly in a single-layer neural network, I show that it is possible to discriminate between three common seismic source types (earthquakes, explosions, and opening fractures) for various noise conditions and gradiometry configurations.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2020

Neuromorphic scaling advantages for energy-efficient random walk computations

Computing stands to be radically improved by neuromorphic computing (NMC) approaches inspired by the brain's incredible efficiency and capabilities. Most NMC research, which aims to replicate the brain's computational structure and architecture in man-made hardware, has focused on artificial intelligence; however, less explored is whether this brain-inspired hardware can provide value beyond cognitive tasks. We demonstrate that high-degree parallelism and configurability of spiking neuromorphic architectures makes them well-suited to implement random walks via discrete time Markov chains. Such random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Additionally, we show how the mathematical basis for a probabilistic solution involving a class of stochastic differential equations can leverage those simulations to provide solutions for a range of broadly applicable computational tasks. Despite being in an early development stage, we find that NMC platforms, at a sufficient scale, can drastically reduce the energy demands of high-performance computing platforms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Uniqueness of MHV Gravity Amplitudes

We investigate MHV tree-level gravity amplitudes as defined on the spinor-helicity variety. Unlike their gluon counterparts, the gravity amplitudes do not have logarithmic singularities and do not admit Amplituhedron-like construction. Importantly, they are not determined just by their singularities, but rather their numerators have interesting zeroes. We make a conjecture about the uniqueness of the numerator and explore this feature from a more mathematical perspective. This leads us to a new approach for examining adjoints. We outline steps of our proposed proof and provide computational evidence for its validity in specific cases.

adjoints↗