Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,495 records · Page 83

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

09 BIOMASS FUELS↗

Quantum algorithm for electronic band structures with local tight-binding orbitals

While the main thrust of quantum computing research in materials science is to accurately measure the classically intractable electron correlation effects due to Coulomb repulsion, designing optimal quantum algorithms for simpler problems with well-understood solutions is a useful tactic to advance our quantum “toolbox”. With this in mind, we consider the quantum calculation of a periodic system’s single-electron band structure over a path through reciprocal space. Previous efforts have used the Variational Quantum Eigensolver algorithm to solve the energy of each band, which involves numerically optimizing the parameters of a variational quantum circuit to minimize a cost function, constructed as the expectation value of a Hamiltonian operator. Traditionally, a unique Hamiltonian operator is constructed for each k-point, so that many cost functions, each with their own parameter space, must be optimized to generate a single band. Similarly, calculating higher bands than the first has traditionally involved modifying the cost function with additional overlap terms to ensure higher-energy eigenstates are orthogonal to those of lower bands. In this paper, we adopt a direct space approach, using a novel hybrid first/second-quantized qubit mapping which allows us to construct a single Hamiltonian, and a single cost-function, suitable for solving the entire electronic band structure. In contrast to previous approaches, the k-point and the band index are selected by additional parameters in our quantum circuit, rather than through modifications to the cost function. The result is a technically and conceptually simpler approach to band structure calculations on a quantum computer. Moreover, we expect that the tools developed herein will motivate new strategies for tackling highly-correlated materials beyond the grasp of classical computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multicomponent kinetic simulation of Bernstein–Greene–Kruskal modes associated with ion acoustic and dust-ion acoustic excitations in electron-ion and dusty plasmas

A series of numerical simulations based on a recurrence-free Vlasov kinetic algorithm presented earlier [Abbasi et al., Phys. Rev. E 84, 036702 (2011)] are reported. Electron-ion plasmas and three-component (electron-ion-dust) dusty, or complex, plasmas are considered, via independent simulations. Considering all plasma components modeled through a kinetic approach, the nonlinear behavior of ionic scale acoustic excitations is investigated. The focus is on Bernstein–Greene–Kruskal (BGK) modes generated during the simulations. In particular, we aim at investigating the parametric dependence of the characteristics of BGK structures, namely of their time periodicity (τ{sub trap}) and their amplitude, on the electron-to-ion temperature ratio and on the dust concentration. In electron-ion plasma, an exponential relation between τ{sub trap} and the amplitude of BGK modes and the electron-to-ion temperature ratio is observed. It is argued that both characteristics, namely, the periodicity τ{sub trap} and amplitude, are also related to the size of the phase-space vortex which is associated with BGK mode creation. In dusty plasmas, BGK modes characteristics appear to depend on the dust particle density linearly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Reconstruction of apparent orthotropic conductivity tensor image using magnetic resonance electrical impedance tomography

Magnetic resonance electrical impedance tomography visualizes current density and/or conductivity distributions inside an electrically conductive object. Injecting currents into the imaging object along at least two different directions, induced magnetic flux density data can be measured using a magnetic resonance imaging scanner. Without rotating the object inside the scanner, we can measure only one component of the magnetic flux density denoted as B{sub z}. Since the biological tissues such as skeletal muscle and brain white matter show strong anisotropic properties, the reconstruction of anisotropic conductivity tensor is indispensable for the accurate observations in the biological systems. In this paper, we propose a direct method to reconstruct an axial apparent orthotropic conductivity tensor by using multiple B{sub z} data subject to multiple injection currents. To investigate the anisotropic conductivity properties, we first recover the internal current density from the measured B{sub z} data. From the recovered internal current density and the curl-free condition of the electric field, we derive an over-determined matrix system for determining the internal absolute orthotropic conductivity tensor. The over-determined matrix system is designed to use a combination of two loops around each pixel. Numerical simulations and phantom experimental results demonstrate that the proposed algorithm stably determines the orthotropic conductivity tensor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling of fracture of protective concrete structures under impact loads

This paper presents results of numerical simulation of interaction between a Boeing 747-400 aircraft and the protective shell of a nuclear power plant. The shell is presented as a complex multilayered cellular structure consisting of layers of concrete and fiber concrete bonded with steel trusses. Numerical simulation was performed three-dimensionally using the original algorithm and software taking into account algorithms for building grids of complex geometric objects and parallel computations. Dynamics of the stress-strain state and fracture of the structure were studied. Destruction is described using a two-stage model that allows taking into account anisotropy of elastic and strength properties of concrete and fiber concrete. It is shown that wave processes initiate destruction of the cellular shell structure; cells start to destruct in an unloading wave originating after the compression wave arrival at free cell surfaces.

36 MATERIALS SCIENCE↗

GLOBAL SIMULATIONS OF ACCRETION DISKS. I. CONVERGENCE AND COMPARISONS WITH LOCAL MODELS

Grid-based magnetohydrodynamic (MHD) simulations have proven invaluable for the study of astrophysical accretion disks. However, the fact that angular momentum transport in disks is mediated by MHD turbulence (with structure down to very small scales) raises the concern that the properties of the modeled accretion disks are affected by the finite numerical resolution of the simulation. By implementing an orbital advection algorithm into the Athena code in cylindrical geometry, we have performed a set of global (but unstratified) Newtonian disk simulations extending up to resolutions previously unattained. We study the convergence of these models as a function of spatial resolution and initial magnetic field geometry. The usual viscosity parameter ({alpha}) or the ratio of thermal-to-magnetic pressure ({beta}) is found to be a poor diagnostic of convergence, whereas the average tilt angle of the magnetic field in the (r, {phi})-plane is a very good diagnostic of convergence. We suggest that this is related to the saturation of the MHD turbulence via parasitic modes of the magnetorotational instability. Even in the case of zero-net magnetic flux, we conclude that our highest resolution simulations (with 32 zones and 64 zones per vertical scale height) have achieved convergence. Our global simulations reach resolutions comparable to those used in local, shearing-box models of MHD disk turbulence. We find that the saturation predictors derived from local simulations correspond well to the instantaneous correlations between local flux and stress found in our global simulations. However, the conservation of magnetic flux implicit in local models is not realized in our global disks. Thus, the magnetic connectivity of an accretion disk represents physics that is truly global and cannot be captured in any ab initio local model.

79 ASTRONOMY AND ASTROPHYSICS↗

Training neural networks using Metropolis Monte Carlo and an adaptive variant

Abstract We examine the zero-temperature Metropolis Monte Carlo (MC) algorithm as a tool for training a neural network by minimizing a loss function. We find that, as expected on theoretical grounds and shown empirically by other authors, Metropolis MC can train a neural net with an accuracy comparable to that of gradient descent (GD), if not necessarily as quickly. The Metropolis algorithm does not fail automatically when the number of parameters of a neural network is large. It can fail when a neural network’s structure or neuron activations are strongly heterogenous, and we introduce an adaptive Monte Carlo algorithm (aMC) to overcome these limitations. The intrinsic stochasticity and numerical stability of the MC method allow aMC to train deep neural networks and recurrent neural networks in which the gradient is too small or too large to allow training by GD. MC methods offer a complement to gradient-based methods for training neural networks, allowing access to a distinct set of network architectures and principles.

97 MATHEMATICS AND COMPUTING↗

The Pristine survey – XVI. The metallicity of 26 stellar streams around the Milky Way detected with the STREAMFINDER in Gaia EDR3

ABSTRACT We use the photometric metallicities provided by the panoramic Pristine survey to study the veracity and derive the metallicities of the numerous stellar streams found by the application of the STREAMFINDER algorithm to the Gaia Early Data Release 3 data. All 26 streams present in Pristine show a clear metallicity distribution function, which provides an independent check of the reality of these structures, supporting the reliability of STREAMFINDER in finding streams and the power of Pristine to measure precise metallicities. We further present six candidate structures with coherent phase-space and metallicity signals that are very likely streams. The majority of studied streams are very metal-poor (14 structures with [Fe/H] < −2.0) and include three systems with [Fe/H] < −2.9 (C-11, C-19, and C-20). These streams could be the closest debris of low-luminosity dwarf galaxies or may have originated from globular clusters of significantly lower metallicity than any known current Milky Way globular cluster. Our study shows that the promise of the Gaia data for Galactic Archeology studies can be substantially strengthened by quality photometric metallicities, allowing us to peer back into the earliest epochs of the formation of our Galaxy and its stellar halo constituents.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast Fourier transform evaluation of the Fresnel integral for gravitational-wave lensing

Gravitational waves (GWs) exhibit wave-optics effects when their wavelength is comparable to the scale of the gravitational lens. This may occur in lensing from galactic subhalos in GWs emitted by binary black-hole mergers and is gaining interest as a novel probe of dark matter. Predictions for observables in these cases ultimately rely on evaluating a Fresnel integral that quantifies the effect of lensing on the amplitude of a GW at a given frequency. However, numerical evaluation of this Fresnel integral is tricky, and several algorithms and publicly available codes that implement it have been developed. Here, we show that the dependence of this integral on the lens position can be written as a two-dimensional Fourier transform. Modern FFT techniques then enable rapid evaluation at all-sky positions simultaneously for general lenses without symmetry. Vectorization of FFT routines allows for derivatives with respect to model parameters to be obtained with only incremental additional computational cost. If the lens is axisymmetric, further speedups can be achieved with recently developed techniques for nonuniform fast Hankel transforms. To demonstrate, we make available Fresnel Integral Optimization with Nonuniform Transforms (fiona), an efficient and accurate code that is significantly faster than current methods for dense source grids, reaching 2 orders of magnitude speedups for ∼10 6 GW-emitting points. As part of FIONA , we developed code that provides vectorized nonuniform fast Hankel transforms that may have other uses (e.g., calculation of cosmological two-point correlation functions) beyond those considered here.

dark matter↗

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Joint Planning of EV Fast Charging Stations and Power Distribution Systems With Balanced Traffic Flow Assignment

To tackle the challenges introduced by the fast-growing charging demand of electric vehicles (EVs), the power distribution systems (PDSs) and fast charging stations (FCSs) of EVs should be planned and operated in a more coordinated fashion. However, existing planning approaches generally aim to minimize investment costs in PDSs while ignoring the risk of worsening traffic conditions. To overcome this research gap, this article integrates the interests of traffic networks into PDS and FCS joint planning model to mitigate negative impacts on traffic conditions caused by installing FCSs. First, a novel microscopic method that is different from traditional assignment methods is proposed to simulate the influences of FCSs on traffic flows and EV charging loads. Then, a multiobjective joint planning model is developed to minimize both the planning costs and unbalanced traffic flows. A new bilayer Benders decomposition algorithm is designed to solve the proposed joint planning model. Numerical results on two practical systems in China validate the feasibility of our microscopic method by comparing the simulated results with real data. Compared with existing approaches, it is also demonstrated that the proposed joint planning approach helps to balance traffic flow assignments and relieve traffic congestion.

bilayer expanded Benders decomposition↗

Distributionally Robust Decentralized Volt-Var Control With Network Reconfiguration

Here, this paper presents a decentralized volt-var optimization (VVO) and network reconfiguration strategy to address the challenges arising from the growing integration of distributed energy resources, particularly photovoltaic (PV) generation units, in active distribution networks. To reconcile control measures with different time resolutions and empower local control centers to handle intermittency locally, the proposed approach leverages a two-stage distributionally robust optimization; decisions on slow-responding control measures and set points that link neighboring subnetworks are made in advance while considering all plausible distributions of uncertain PV outputs. We present a decomposition algorithm with an acceleration scheme for solving the proposed model. Numerical experiments on the IEEE 123 bus distribution system are given to demonstrate its outstanding out-of-sample performance and computational efficiency, which suggests that the proposed method can effectively localize uncertainty via risk-informed proactive timely decisions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Computationally Efficient Decompositions of Oblique Projection Matrices

Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Source record↗

A New Approach to Charged Particle Slowing Down and Dispersion

The process by which super-thermal ions slow down against background Coulomb potentials arises in many fields of study. In particular, this is one of the main mechanisms by which the mass and energy from the reaction products of fusion reactions is deposited back into the background. Many of these fields are characterized by length and time scales that are the same magnitude as the range and duration of the trajectory of these particles, before they thermalize into the background. This requires numerical simulation of this slowing down process through numerically integrating the velocities and energies of these particles. This paper first presents a simple introduction to the required plasma physics, followed by the description of the numerical integration used to integrate a beam of particles. This algorithm is unique in that it combines in an integrated manner both a second-order integration of the slowing down with the particle beam dispersion. These two processes are typically computed in isolation from each other. A simple test problem of a beam of alpha particles slowing down against an inert background of deuterium and tritium with varying properties of both the beam and the background illustrate the utility of the algorithm. This is followed by conclusions and appendices. The appendices define the notation, units, and several useful identities.

97 MATHEMATICS AND COMPUTING↗

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗

Model-based tomographic reconstruction

A model-based approach to estimating wall positions for a building is developed and tested using simulated data. It borrows two techniques from geophysical inversion problems, layer stripping and stacking, and combines them with a model-based estimation algorithm that minimizes the mean-square error between the predicted signal and the data. The technique is designed to process multiple looks from an ultra wideband radar array. The processed signal is time-gated and each section processed to detect the presence of a wall and estimate its position, thickness, and material parameters. The floor plan of a building is determined by moving the array around the outside of the building. In this paper we describe how the stacking and layer stripping algorithms are combined and show the results from a simple numerical example of three parallel walls.

97 MATHEMATICS AND COMPUTING↗