Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 811 records · Page 45

Single-shot Quantum Signal Processing Interferometry

Quantum systems of infinite dimension, such as bosonic oscillators, provide vast resources for quantum sensing. Yet, a general theory on how to manipulate such bosonic modes for sensing beyond parameter estimation is unknown. We present a general algorithmic framework, quantum signal processing interferometry (QSPI), for quantum sensing at the fundamental limits of quantum mechanics by generalizing Ramsey-type interferometry. Our QSPI sensing protocol relies on performing nonlinear polynomial transformations on the oscillator's quadrature operators by generalizing quantum signal processing (QSP) from qubits to hybrid qubit-oscillator systems. We use our QSPI sensing framework to make efficient binary decisions on a displacement channel in the single-shot limit. Theoretical analysis suggests the sensing accuracy, given a single-shot qubit measurement, scales inversely with the sensing time or circuit depth of the algorithm. We further concatenate a series of such binary decisions to perform parameter estimation in a bit-by-bit fashion. Numerical simulations are performed to support these statements. Our QSPI protocol offers a unified framework for quantum sensing using continuous-variable bosonic systems beyond parameter estimation and establishes a promising avenue toward efficient and scalable quantum control and quantum sensing schemes beyond the NISQ era.

Physics↗

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

Sampling and resolution characteristics in reduced order models of shallow water equations: Intrusive vs nonintrusive

We investigate the sensitivity of reduced order models (ROMs) to training data spatial resolution as well as sampling rate. In particular, we consider proper orthogonal decomposition (POD), coupled with Galerkin projection (POD-GP), as an intrusive reduced order modeling technique. For non-intrusive ROMs, we consider two frameworks. The first is using dynamic mode decomposition (DMD), and the second is based on artificial neural networks (ANNs). For ANN, we utilized a residual deep neural network, and for DMD we have studied two versions of DMD approaches; one with hard thresholding and the other with sorted bases selection. Also, we highlight the differences between mean-subtracting the data (centering) and using the data without mean-subtraction. We tested these ROMs using a system of 2D shallow water equations for four different numerical experiments, adopting combinations of sampling rates and spatial resolutions. For these cases, we found that the DMD basis obtained with hard threshodling is sensitive to sampling rate. The sorted DMD algorithm helps to mitigate this problem and yields more stabilized and converging solution. Furthermore, we demonstrate that both DMD approaches without mean subtraction provide significantly more accurate results than DMD with mean-subtracting the data. On the other hand, POD is relatively insensitive to sampling rate and yields better representation of the flow field. Meanwhile, spatial resolution has little effect on both POD and DMD performances. Here, the numerical results reveal that an ANN on POD subspace (POD-ANN) performs remarkably better than POD-GP and DMD in capturing system dynamics, even with a small number of modes.

42 ENGINEERING↗

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive resource allocation for surrogate modeling of systems comprised of multiple disciplines with varying fidelity

We present an adaptive algorithm for constructing surrogate models for integrated systems composed of a set of coupled components. With this goal we introduce ‘coupling’ variables with a priori unknown distributions that allow approximations of each component to be built independently. Once built, the surrogates of the components are combined and used to predict system-level quantities of interest (QoI) at a fraction of the cost of interrogating the full system model. We use a greedy experimental design procedure, based upon a modification of Multi-Index Stochastic Collocation (MISC), to minimize the error of the combined surrogate. This is achieved by refining each component surrogate in accordance with its relative contribution to error in the approximation of the system-level QoI. Our adaptation of MISC is a multi-fidelity procedure that can leverage ensembles of models of varying cost and accuracy, for one or more components, to produce estimates of system-level QoI. Several numerical examples demonstrate the efficacy of the proposed approach on systems involving feed-forward and feedback coupling. For a fixed computational budget, the proposed algorithm is able to produce approximations that are orders of magnitude more accurate than approximations that treat the integrated system as a black-box.

97 MATHEMATICS AND COMPUTING↗

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗

First Principles Nonadiabatic Excited-State Molecular Dynamics in NWChem

Computational simulation of non-adiabatic molecular dynamics is an indispensable tool for understanding complex photoinduced processes such as internal conversion, energy transfer, charge separation, and spatial localization of excitons, to name a few. Here, we report an implementation of the fewest-switches surface hopping algorithm in the NWChem computational chemistry program. Here the surface hopping method is combined with linear-response time-dependent density functional theory calculations of adiabatic excited state potential energy surfaces. To treat quantum transitions between arbitrary electronic Born{Oppenheimer states, we have implemented both numerical and analytical differentiation schemes for derivative non-adiabatic couplings. A numerical approach for the time-derivative non-adiabatic couplings together with an analytical method for calculating non-adiabatic coupling vectors is an efficient combination for surface hopping approaches. Additionally, electronic decoherence schemes and a state reassigned unavoided crossings algorithm are also implemented to improve the accuracy of the simulated dynamics and to handle trivial unavoided crossings. We apply our code to study the ultrafast decay of photoexcited benzene, including a detailed analysis of the potential energy surface, population decay time scales, and vibrational coordinates coupled to the excitation dynamics. The development presented in this work is a baseline for future implementations of more sophisticated frameworks for simulating of non-adiabatic molecular dynamics in NWChem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

Neutronics Calculation Advances at Los Alamos: Manhattan Project to Monte Carlo

The history and advances of neutronics calculations at Los Alamos during the Manhattan Project through the present are reviewed. Substantial improvements to neutron diffusion methods and the invention of both the Monte Carlo neutron transport methods in 1947 and deterministic discrete ordinates Sn in 1953 were all made at Los Alamos just after the Manhattan Project. We briefly summarize early simpler and more approximate neutronics methods and then describe the need to better predict neutronics behavior through consideration of theoretical equations, models and algorithms, experimental measurements, and available computing capabilities and their limitations. This paper briefly covers key advances in deterministic methods during the Manhattan Project. These capabilities, coupled with increasing postwar defense needs and the invention of electronic computing with the Electronic Numeric Integrator and Computer, known as ENIAC, and the Mathematical Analyzer Numerical Integrator and Automatic Computer Model, known as MANIAC, led to the creation of Monte Carlo and deterministic discrete ordinates neutronics transport methods. We note the important role that the scientific comradery between the Los Alamos scientists played in the process. This paper briefly covers the early methods, algorithms, computers, and electronic and women pioneers that enabled Monte Carlo to spread to all areas of science. We focus heavily on these early developments and the subsequent creation of the MCNP® code, advances in its associated nuclear data, and its applications to problems of national defense at Los Alamos.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

A dynamic solvent chamber propagation estimation framework using RNN for warm solvent injection in heterogeneous reservoirs

Warm solvent injection (WSI), injecting low-temperature solvent into formations to reduce the viscosity of heavy oil, is a clean technology for heavy oil production through reducing greenhouse gas emissions and water usage. The success of WSI operation depends on the uniform development and propagation of solvent chambers in reservoirs. However, reservoir heterogeneity stemming from shale barriers plays a detrimental role in the conformance of solvent chamber development and oil production rate. In this work, we developed a novel recurrent neural network (RNN)-based framework with the capability of efficiently tracking and estimating the solvent chamber positions in heterogeneous reservoirs based on only production time-series data. The developed estimation model utilizes the “sequence-to-sequence" mapping methodology to correlate observed production time-series sequence and solvent chamber edge sequence via a long short-term memory (LSTM) algorithm. The trained RNN models exhibit high accuracy, evidenced by the predicted dynamic solvent chamber locations match the corresponding true locations from numerical simulation, with a high coefficient of determination (R 2 ) and a low mean squared error. Specifically, the achieved R 2 values exceed 0.98 on both the training and testing data. The developed RNN-based workflow was tested via several cases from both regularly- and irregularly-shaped shale barriers, and the results were promising. The predicted solvent chambers showed strong agreement with those obtained from numerical simulations. The major benefits of this workflow include reducing computational time and saving overall monitoring and tracking costs for conventional techniques. In conclusion, the present work would provide a good demonstration of the capability of practical integration of machine learning methods in solving engineering problems.

58 GEOSCIENCES↗

Development of a CPU/GPU portable software library for Lagrangian–Eulerian simulations of liquid sprays

The Lagrangian–Eulerian method is widely used for simulations of fuel sprays in turbulent combustion because of the advantage of treating the spray droplets as discrete points. One challenge of the Lagrangian–Eulerian method is the intense computational requirement when tracking the large number of Lagrangian particles needed for high fidelity. We have developed a performance-portable library, Grit, to track the Lagrangian particles in parallel on central processing unit (CPU) and graphics processing unit (GPU) accelerated high performance computing (HPC) architectures. Grit is a C++ library which employs Message Passing Interface (MPI) for distributed memory parallelism and Kokkos programming model for on-node shared memory parallelism with performance portability across different architectures of GPUs and multi-core/manycore CPUs. The parallel algorithms, key parallel kernels, and their performances on the pre-exascale supercomputer, Summit, are presented. Grit is coupled with a direct numerical simulation (DNS) solver, S3D, for multiphase simulations. A conservative formulation has been developed and implemented in Grit for phase coupling with thermodynamic consistency. The formulation separates the conservation of mass, momentum and energy from the physical models to prevent accidental violation of conservation laws due to inconsistent models. The formulation also enforces consistent definitions of enthalpies of the fuel for both phases and the latent heat of evaporation. Finally, simulations of turbulent particle-laden flow and the evaporation of dilute turbulent spray jet are performed to verify the software implementation, and to demonstrate the scalability of Grit for large-scale multiphase simulations.

97 MATHEMATICS AND COMPUTING↗

High performance sparse multifrontal solvers on modern GPUs

Here, we have ported the numerical factorization and triangular solve phases of the sparse direct solver STRUMPACK to GPU. STRUMPACK implements sparse LU factorization using the multifrontal algorithm, which performs most of its operations in dense linear algebra operations on so-called frontal matrices of various sizes. Our GPU implementation off-loads these dense linear algebra operations, as well as the sparse scatter–gather operations between frontal matrices. For the larger frontal matrices, our GPU implementation relies on vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs and rocBLAS and rocSOLVER for AMD GPUs. For the smaller frontal matrices we developed custom CUDA and HIP kernels to reduce kernel launch overhead. Overall, high performance is achieved by identifying submatrix factorizations corresponding to sub-trees of the multifrontal assembly tree which fit entirely in GPU memory. The multi-GPU setting uses SLATE (Software for Linear Algebra Targeting Exascale) as a modern GPU-aware replacement for ScaLAPACK. On 4 nodes of SUMMIT the code runs ~10X faster when using all 24 V100 GPUs compared to when it only uses the 168 POWER9 cores. On 8 SUMMIT nodes, using 48 V100 GPUs, the sparse solver reaches over 50TFlop/s. Compared to SuperLU, on a single V100, for a set of 17 matrices our implementation is faster for all but one matrix, and is on average 5X (median 4X) faster

97 MATHEMATICS AND COMPUTING↗

Interior soft x-ray tomography with sparse global sampling

To investigate the feasibility of interior imaging reconstruction in soft X-ray tomography for higher-resolution cellular imaging, including whole-cell imaging, we develop an alignment and reconstruction algorithm that combines a small number of sparse whole-cell images with a high-resolution local interior scan. Based on numerical simulations, we demonstrate that combined reconstructions mitigate the depth-of-field limitation in high-resolution scans, enable radiation dose optimization, and yield quantitative X-ray absorption values with sparse sampling. We further validate our numerical approach using experimental data from two different cell types and show that the combined reconstruction reliably provides high spatial resolution within an interior region of interest of a whole cell. The resulting sparse reconstruction framework offers robust, faithful visualization of cellular organelles in soft X-ray tomography. This mesoscale imaging strategy allows one to ‘scout’ and zoom into selected subcellular volumes of interest, enabling increased spatial resolution without sacrificing larger-volume imaging and providing information on the relative positions of all organelles within a cell.

3D imaging↗

Realizable hyperuniform and nonhyperuniform particle configurations with targeted spectral functions via effective pair interactions

The capacity to identify realizable many-body configurations associated with targeted functional forms for the pair correlation function $g_2(r)$ or its corresponding structure factor $\textit{S(k)}$ is of great fundamental and practical importance. While there are obvious necessary conditions that a prescribed structure factor at number density ρ must satisfy to be configurationally realizable, sufficient conditions are generally not known due to the infinite degeneracy of configurations with different higher-order correlation functions. A major aim of this paper is to expand our theoretical knowledge of the class of pair correlation functions or structure factors that are realizable by classical disordered ensembles of particle configurations, including exotic “hyperuniform” varieties. We first introduce a theoretical formalism that provides a means to draw classical particle configurations from canonical ensembles with certain pairwise-additive potentials that could correspond to targeted analytical functional forms for the structure factor. This formulation enables us to devise an improved algorithm to construct systematically canonical-ensemble particle configurations with such targeted pair statistics, whenever realizable. As a proof of concept, we test the algorithm by targeting several different structure factors across dimensions that are known to be realizable and one hyperuniform target that is known to be nontrivially unrealizable. Our algorithm succeeds for all realizable targets and appropriately fails for the unrealizable target, demonstrating the accuracy and power of the method to numerically investigate the realizability problem. Subsequently, we also target several families of structure-factor functions that meet the known necessary realizability conditions but are not known to be realizable by disordered hyperuniform point configurations, including $\textit{d}$-dimensional Gaussian structure factors, $\textit{d}$-dimensional generalizations of the two-dimensional one-component plasma (OCP), and the $\textit{d}$-dimensional Fourier duals of the previous OCP cases. Moreover, we also explore unusual nonhyperuniform targets, including “hyposurficial” and “antihyperuniform” examples. In all of these instances, the targeted structure factors are achieved with high accuracy, suggesting that they are indeed realizable by equilibrium configurations with pairwise interactions at positive temperatures. Remarkably, we also show that the structure factor of nonequilibrium perfect glass, specified by two-, three-, and four-body interactions, can also be realized by equilibrium pair interactions at positive temperatures. In this work, our findings lead us to the conjecture that any realizable structure factor corresponding to either a translationally invariant equilibrium or nonequilibrium system can be attained by an equilibrium ensemble involving only effective pair interactions. Our investigation not only broadens our knowledge of analytical functional forms for $g_2(r)$ and $\textit{S(k)}$ associated with disordered point configurations across dimensions but also deepens our understanding of many-body physics. Moreover, our work can be applied to the design of materials with desirable physical properties that can be tuned by their pair statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-Fidelity Gaussian Process for Distribution System Voltage Probabilistic Estimation with PVs

The increasing penetration of behind-the-meter PVs causes challenges to maintain voltage security due to the lack of distribution system visibility. This paper proposes a nonlinear autoregressive Gaussian process (NARGP) approach to fuse limited number of SCADA/AMI data together with historical pseudo measurements for distribution node voltage probabilistic estimation. The high-fidelity SCADA data are fused with the low-fidelity AMI and pseudo measurements by the autoregressive algorithm embedded in the Gaussian process. This allows us to use multi-fidelity data to achieve entire distribution system voltage visibility. Numerical results carried out on the IEEE 123node system demonstrate that the NARGP method is able to obtain high accuracy in estimating bus voltage and quantifying estimation uncertainties as compared to other approaches.

distribution system estimation↗

Online State Estimation for Time-Varying Systems

The paper investigates the problem of estimating the state of a time-varying system with a linear measurement model; in particular, the paper considers the case where the number of measurements available can be smaller than the number of states. In lieu of a batch linear least-squares (LS) approach well-suited for static networks, where a sufficient number of measurements could be collected to obtain a full-rank design matrix the paper proposes an online algorithm to estimate the possibly time-varying state by processing measurements as and when available. The design of the algorithm hinges on a generalized LS cost augmented with a proximal-point-type regularization. With the solution of the regularized LS problem available in closed-form, the online algorithm is written as a linear dynamical system where the state is updated based on the previous estimate and based on the new available measurements. Conditions under which the algorithmic steps are in fact a contractive mapping are shown, and bounds on the estimation error are derived for different noise models. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗