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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Numerical Solution Of Navier-Stokes Equations

Three-dimensional, incompressible flow simulated on computer. Report discusses mathematical basis of IN3SD computer code and application of code to several test problems. Relies heavily on use of pseudocompressibility to solve numerically three-dimensional Navier-Stokes equations of viscous, incompressible flow. With further study and some modification, valuable computational tool for solution of engineering problems in fluid dynamics.

Rogers, Stuart E.↗
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↗
NASA NTRS1972

A theory of supercritical wing sections, with computer programs and examples.

Mathematical methods for the design of supercritical wings, which depend on the numerical solution of the partial differential equations of two-dimensional gas dynamics, are developed. The main contribution is a computer program for the design of shockless transonic airfoils using the hodograph transformation and analytic continuation into the complex domain. The mathematical theory is described, and a manual for users of the programs is provided. Numerical examples are given and computational results are discussed, and the computer programs themselves are listed. The analysis routine can be used to ascertain whether the profiles behave well at off-design conditions, or to smooth coordinates and obtain a desirable shape more quickly when perfectly shockless flow is not essential.

Bauer, F.↗
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↗
DOE OSTI2021

Cardinality-Regularized Hawkes-Granger Model

We propose a new sparse Granger-causal learning framework for temporal event data. We focus on a specific class of point processes called the Hawkes process. We begin by pointing out that most of the existing sparse causal learning algorithms for the Hawkes process suffer from a singularity in maximum likelihood estimation. As a result, their sparse solutions can appear only as numerical artifacts. In this paper, we propose a mathematically well-defined sparse causal learning framework based on a cardinality-regularized Hawkes process, which remedies the pathological issues of existing approaches. We leverage the proposed algorithm for the task of instance-wise causal event analysis, where sparsity plays a critical role. We validate the proposed framework with two real use-cases, one from the power grid and the other from the cloud data center management domain.

Ide, Tsuyoshi↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
NASA NTRS1984

Manual of phosphoric acid fuel cell stack three-dimensional model and computer program

A detailed distributed mathematical model of phosphoric acid fuel cell stack have been developed, with the FORTRAN computer program, for analyzing the temperature distribution in the stack and the associated current density distribution on the cell plates. Energy, mass, and electrochemical analyses in the stack were combined to develop the model. Several reasonable assumptions were made to solve this mathematical model by means of the finite differences numerical method.

Lu, C. Y.↗
NASA NTRS1988

Digital spectral estimation and modeling of Space Shuttle flight data

Application of the digital signal processing technique of autoregressive-moving-average (ARMA) modeling to the estimation of power spectra and shock spectra from Space Shuttle lift-off flight accelerograms is described in this paper. The background for application to ARMA of lift-off accelerograms which are non-stationary in nature is exemplified through a step-by-step discussion of actual numerical results. Included is a discussion of pertinent mathematical background for the ARMA approximations. Potential areas for application of ARMA modeling in payload integration activities are suggested.

Spanos, P. D.↗
NASA NTRS1993

Statistical computation of tolerance limits

Based on a new theory, two computer codes were developed specifically to calculate the exact statistical tolerance limits for normal distributions within unknown means and variances for the one-sided and two-sided cases for the tolerance factor, k. The quantity k is defined equivalently in terms of the noncentral t-distribution by the probability equation. Two of the four mathematical methods employ the theory developed for the numerical simulation. Several algorithms for numerically integrating and iteratively root-solving the working equations are written to augment the program simulation. The program codes generate some tables of k's associated with the varying values of the proportion and sample size for each given probability to show accuracy obtained for small sample sizes.

Wheeler, J. T.↗
NASA NTRS1995

Computing Surface Coordinates Of Face-Milled Spiral-Bevel Gear Teeth

Surface coordinates of face-milled spiral-bevel gear teeth computed by method involving numerical solution of governing equations. Needed to generate mathematical models of tooth surfaces for use in finite-element analyses of stresses, strains, and vibrations in meshing spiral-bevel gears.

Handschuh, Robert F.↗
NASA NTRS1995

Multirepressor Control Systems For Efficient Promoter Regulation

Report presents numerical-simulation study, based on molecular-level mathematical models, to evaluate effectiveness of eight different configurations of repressor synthesis control of cloned-product-gene expression initiated from promoter/operator genetic sequence. In study, both single- and dual-repressor situations considered, using genetically structured molecules for lac and IPR promotor/operator in example calculations.

Bailey, James E.↗
NASA NTRS1996

Finding New Math Identities by Computer

Recently a number of interesting new mathematical identities have been discovered by means of numerical searches on high performance computers, using some newly discovered algorithms. These include the following: pi = ((sup oo)(sub k=0))(Sigma) (1 / 16) (sup k) ((4 / 8k+1) - (2 / 8k+4) - (1 / 8k+5) - (1 / 8k+6)) and ((17 pi(exp 4)) / 360) = ((sup oo)(sub k=1))(Sigma) (1 + (1/2) + (1/3) + ... + (1/k))(exp 2) k(exp -2), zeta(3, 1, 3, 1, ..., 3, 1) = (2 pi(exp 4m) / (4m+2)! where m = number of (3,1) pairs. and where zeta(n1,n2,...,nr) = (sub k1 (is greater than) k2 (is greater than) ... (is greater than) kr)(Sigma) (1 / (k1 (sup n1) k2 (sup n2) ... kr (sup nr). The first identity is remarkable in that it permits one to compute the n-th binary or hexadecimal digit of pu directly, without computing any of the previous digits, and without using multiple precision arithmetic. Recently the ten billionth hexadecimal digit of pi was computed using this formula. The third identity has connections to quantum field theory. (The first and second of these been formally established; the third is affirmed by numerical evidence only.) The background and results of this work will be described, including an overview of the algorithms and computer techniques used in these studies.

Bailey, David H.↗