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 451 records · Page 25

Complex Langevin simulation of a random matrix model at nonzero chemical potential

In this study we test the complex Langevin algorithm for numerical simulations of a random matrix model of QCD with a first order phase transition to a phase of finite baryon density. We observe that a naive implementation of the algorithm leads to phase quenched results, which were also derived analytically in this article. We test several fixes for the convergence issues of the algorithm, in particular the method of gauge cooling, the shifted representation, the deformation technique and reweighted complex Langevin, but only the latter method reproduces the correct analytical results in the region where the quark mass is inside the domain of the eigenvalues. In order to shed more light on the issues of the methods we also apply them to a similar random matrix model with a milder sign problem and no phase transition, and in that case gauge cooling solves the convergence problems as was shown before in the literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Qubit-efficient entanglement spectroscopy using qubit resets

One strategy to fit larger problems on NISQ devices is to exploit a tradeoff between circuit width and circuit depth. Unfortunately, this tradeoff still limits the size of tractable problems since the increased depth is often not realizable before noise dominates. Here, we develop qubit-efficient quantum algorithms for entanglement spectroscopy which avoid this tradeoff. In particular, we develop algorithms for computing the trace of the n -th power of the density operator of a quantum system, T r ( ρ n ) , (related to the Rényi entropy of order n ) that use fewer qubits than any previous efficient algorithm while achieving similar performance in the presence of noise, thus enabling spectroscopy of larger quantum systems on NISQ devices. Our algorithms, which require a number of qubits independent of n , are variants of previous algorithms with width proportional to n , an asymptotic difference. The crucial ingredient in these new algorithms is the ability to measure and reinitialize subsets of qubits in the course of the computation, allowing us to reuse qubits and increase the circuit depth without suffering the usual noisy consequences. We also introduce the notion of effective circuit depth as a generalization of standard circuit depth suitable for circuits with qubit resets. This tool helps explain the noise-resilience of our qubit-efficient algorithms and should aid in designing future algorithms. We perform numerical simulations to compare our algorithms to the original variants and show they perform similarly when subjected to noise. Additionally, we experimentally implement one of our qubit-efficient algorithms on the Honeywell System Model H0, estimating T r ( ρ n ) for larger n than possible with previous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effect of cell-size dispersity on the mechanical properties of closed-cell aluminum foam

Highlights: • The effect of cell-size dispersity on the Young’s modulus of foam was investigated through experiments and simulations • Crushing experiments were conducted on 27 foam specimens in order measure the relative Young’s modulus • Three types of numerical models, including monodispersed, bidispersed and polydispersed models were studied • The numerical convergence on the model size for different models was also studied • The difference among numerical results obtained from the three models was insignificant - Abstract: The mechanical properties of open-celled and closed-celled metallic foam are strongly influenced by the cellular microstructure and material properties of the base material from which the foam is made. The present study investigated the microstructure and mechanical properties of ALPORAS closed-cell Al foam. In particular, the effect of cell-size dispersity on the Young's modulus of foam was investigated through crushing experiments and numerical simulations. Crushing experiments were first conducted on two mutually perpendicular directions. Numerical models of varying cell-size dispersity and complexity were subsequently developed, including the monodispersed model that is based on the Kelvin structure, the bidispersed model, and the polydispersed model that is based on the random Laguerre tessellation algorithm. The numerical models were discretized using shell elements, and the simulations were conducted using the ABAQUS finite element method software. Relative Young's moduli with various relative densities were predicted, and the numerical convergence on the model size was studied accordingly. Numerical results obtained from all three numerical models developed were found to overestimate the experimental results by a factor of approximately 3. The difference between the numerical and experimental results can be attributed to the difference in detailed microstructural characteristics. Furthermore, the difference among numerical results obtained from the three models was insignificant.

36 MATERIALS SCIENCE↗

A new algorithm for calculating the curvature perturbations in stochastic inflation

We propose a new approach for calculating the curvature perturbations produced during inflation in the stochastic formalism. In our formalism, the fluctuations of the e-foldings are directly calculated without perturbatively expanding the inflaton field and they are connected to the curvature perturbations by the δN formalism. The result automatically includes the contributions of the higher order perturbations because we solve the equation of motion non-perturbatively. In this paper, we analytically prove that our result (the power spectrum and the nonlinearity parameter) is consistent with the standard result in single field slow-roll inflation. We also describe the algorithm for numerical calculations of the curvature perturbations in more general inflation models.

79 ASTRONOMY AND ASTROPHYSICS↗

A Higher Order, Stable Partitioned Scheme for Fluid-Structure Interaction Problems

Although still a very active area of research with many open questions, there exist highly-accurate and efficient algorithms for numerically estimating solutions to the equations of fluid motion. Similarly, great strides have been made in numerically modeling the motion of solids. However, there exist many practical applications where one must solve both fluid and structure in tandem. There is a gap in the literature for high order unconditionally stable partitioned algorithms for problems of this type. We investigate a new partitioned scheme which shows promise in filling this gap. We use a finite-element-based model with an added mass approach on problems coupling the Euler beam equation with the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Numerical Solution of the Steady-State Network Flow Equations for a Non-Ideal Gas

Herein we formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for a broad class of non-ideal pressure-density relations that satisfy a monotonicity property. Further, we develop a Newton-Raphson algorithm for numerical solution of the steady-state problem, which is made possible by a systematic non-dimensionalization of the equations. The developed algorithm has been extensively tested on benchmark instances and shown to converge robustly to a generalized solution. Previous results [1]-[4], indicate that the steady-state network flow equations for an ideal gas are difficult to solve by the Newton-Raphson method because of its extreme sensitivity to the initial guess. In contrast, we find that non-dimensionalization of the steady-state problem is key to robust convergence of the Newton-Raphson method. We identify criteria based on the uniqueness of solutions under which the existence of a non-physical generalized solution found by a non-linear solver implies non-existence of a physical solution, i.e., infeasibility of the problem. Finally, we compare pressure and flow solutions based on ideal and non-ideal equations of state to demonstrate the need to apply the latter in practice. The solver developed in this article is open-source and is made available for both the academic and research communities as well as the industry.

97 MATHEMATICS AND COMPUTING↗

Parallelization in time of numerical simulations of fully-developed plasma turbulence using the parareal algorithm

It is shown that numerical simulations of fully-developed plasma turbulence can be successfully parallelized in time using the parareal algorithm. The result is far from trivial, and even unexpected, since the exponential divergence of Lagrangian trajectories as well as the extreme sensitivity to initial conditions characteristic of turbulence set these type of simulations apart from the much simpler systems to which the parareal algorithm has been applied to this day. It is also shown that the parallel gain obtainable with this method is very promising (close to an order of magnitude for the cases and implementations described), even when it scales with the number of processors quite differently to what is typical for spatial parallelization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance com- putational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly e cient and scalable numer- ical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Tensor network decompositions in the presence of a global symmetry

Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a compact, completely reducible group G, in tensor network decompositions and algorithms. This is achieved by considering tensors that are invariant under the action of the group G. Each symmetric tensor decomposes into two types of tensors: degeneracy tensors, containing all the degrees of freedom, and structural tensors, which only depend on the symmetry group. In numerical calculations, the use of symmetric tensors ensures the preservation of the symmetry, allows selection of a specific symmetry sector, and significantly reduces computational costs. On the other hand, the resulting tensor network can be interpreted as a superposition of exponentially many spin networks. Spin networks are used extensively in loop quantum gravity, where they represent states of quantum geometry. Our work highlights their importance in the context of tensor network algorithms as well, thus setting the stage for cross-fertilization between these two areas of research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative algorithms for processing experimental data

The need to solve linear and nonlinear integral equations arise, e.g., in recovering plasma parameters from the data of multichannel diagnostics. The paper presents an iterative method for solving integral equations with a singularity at the upper limit of integration. The method consists in constructing successive approximations and calculating the integral by quadrature formulas in each integration interval. An example of application of the iterative algorithm to numerically solve an integral equation similar to those arising in recovering the plasma density profile from reflectometry data is presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗

Discontinuous Galerkin methods for plasma physics in the scrape-off layer of tokamaks

A new parallel discontinuous Galerkin solver, called ArcOn, is developed to describe the intermittent turbulent transport of filamentary blobs in the scrape-off layer (SOL) of fusion plasma. The model is comprised of an elliptic subsystem coupled to two convection-dominated reaction–diffusion–convection equations. Upwinding is used for a class of numerical fluxes developed to accommodate cross product driven convection, and the elliptic solver uses SIPG, NIPG, IIPG, Brezzi, and Bassi–Rebay fluxes to formulate the stiffness matrix. A novel entropy sensor is developed for this system, designed for a space–time varying artificial diffusion/viscosity regularization algorithm. Some numerical experiments are performed to show convergence order on manufactured solutions, regularization of blob/streamer dynamics in the SOL given unstable parameterizations, long-time stability of modon (or dipole drift vortex) solutions arising in simulations of drift-wave turbulence, and finally the formation of edge mode turbulence in the scrape-off layer under turbulent saturation conditions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bayesian inference of Stochastic reaction networks using Multifidelity Sequential Tempered Markov Chain Monte Carlo

Stochastic reaction network models are often used to explain and predict the dynamics of gene regulation in single cells.These models usually involve several parameters, such as the kinetic rates of chemical reactions, that are not directly measurable and must be inferred from experimental data. Bayesian inference provides a rigorous probabilistic frame-work for identifying these parameters by finding a posterior parameter distribution that captures their uncertainty.Traditional computational methods for solving inference problems such as Markov Chain Monte Carlo methods based on classical Metropolis-Hastings algorithm involve numerous serial evaluations of the likelihood function, which in turn requires expensive forward solutions of the chemical master equation (CME). We propose an alternate approach based on a multifidelity extension of the Sequential Tempered Markov Chain Monte Carlo (ST-MCMC) sampler. This algorithm is built upon Sequential Monte Carlo and solves the Bayesian inference problem by decomposing it into a sequence of efficiently solved subproblems that gradually increase both model fidelity and the influence of the observed data. We reformulate the finite state projection (FSP) algorithm, a well-known method for solving the CME, to produce a hierarchy of surrogate master equations to be used in this multifidelity scheme. To determine the appropriate fidelity, we introduce a novel information-theoretic criteria that seeks to extract the most information about the ultimate Bayesian posterior from each model in the hierarchy without inducing significant bias. This novel sampling scheme is tested with high performance computing resources using biologically relevant problems.

97 MATHEMATICS AND COMPUTING↗

Expedited Real Time Processing for the NETL HYPER Cyber-Physical System (Final Report)

The primary objective of the proposed project was to provide the National Energy Technology Laboratory’s Hybrid Performance (Hyper) Facility the needed numerical methods algorithm(s), software development and implementation support to enact real time cyber-physical systems (CPSs) that simulate process dynamics on the order of five milliseconds or smaller. The proposed paths forward comprised three distinct approaches to hasten transient simulations. They fell under the numerical methods categorical options of: 1) optimizing key parameters within the facility’s pre-existing real time processing scheme; 2) introducing an “informed” processing approach wherein a priori computations expedite real time attempts; and 3) implementing alternatives to the employed explicit-implicit blended finite difference (spatio-temporal) approach. Each of these three classes were proposed independently as options for improvement, yet in some cases one class of approach could have complemented another.

20 FOSSIL-FUELED POWER PLANTS↗

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. So, we describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

97 MATHEMATICS AND COMPUTING↗

Integrated Model, Batch and Domain Parallelism in Training Neural Networks

We propose a new integrated method of exploiting model, batch and domain parallelism for the training of deep neural networks (DNNs) on large distributed-memory computers using minibatch stochastic gradient descent (SGD). Our goal is to find an efficient parallelization strategy for a fixed batch size using $P$ processes. Our method is inspired by the communication-avoiding algorithms in numerical linear algebra. We see $P$ processes as logically divided into a $P_r \times P_c$ grid where the $P_r$ dimension is implicitly responsible for model/domain parallelism and the $P_c$ dimension is implicitly responsible for batch parallelism. In practice, the integrated matrix-based parallel algorithm encapsulates these types of parallelism automatically. We analyze the communication complexity and analytically demonstrate that the lowest communication costs are often achieved neither with pure model nor with pure data parallelism. We also show how the domain parallel approach can help in extending the theoretical scaling limit of the typical batch parallel method.

97 MATHEMATICS AND COMPUTING↗

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elastic wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.

58 GEOSCIENCES↗

Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle

Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT), unify and improve the presentation of most quantum algorithms. QSP/QSVT characterize the ability, by alternating ansätze, to obliviously transform the singular values of subsystems of unitary matrices by polynomial functions; these algorithms are numerically stable and analytically well-understood. That said, QSP/QSVT require consistent access to a single oracle, saying nothing about computing joint properties of two or more oracles; these can be far cheaper to determine given an ability to pit oracles against one another coherently. This work introduces a corresponding theory of QSP over multiple variables: M-QSP. Surprisingly, despite the non-existence of the fundamental theorem of algebra for multivariable polynomials, there exist necessary and sufficient conditions under which a desired stable multivariable polynomial transformation is possible. Moreover, the classical subroutines used by QSP protocols survive in the multivariable setting for non-obvious reasons, and remain numerically stable and efficient. Up to a well-defined conjecture, we give proof that the family of achievable multivariable transforms is as loosely constrained as could be expected. The unique ability of M-QSP to obliviously approximate joint functions of multiple variables coherently leads to novel speedups incommensurate with those of other quantum algorithms, and provides a bridge from quantum algorithms to algebraic geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗