Results for “Approximate computing” — Page 23

DOE OSTI2019

The Study of Magnetic Fluid Flows in a Laterally Heated Vertical Channel

Convection of a stratified magnetic fluid in a laterally heated vertical channel is investigated experimentally and theoretically. The dynamics of the behavior of convective rolls, their velocity and deformation, are investigated. It is shown that the complex inhomogeneous structure of the flow is attributed to the stratification of nanoparticles in the gravitational field. On the basis of a mathematical model of convection in the Boussinesq approximation, a large series of computational experiments are carried out for various parameters of the problem: the initial distribution of nanopartciles, the Boltzmann number, the Soret parameter, and the sedimentation length. A range of parameters is found in which the numerical and experimental results are qualitatively similar.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2019

Pressio

Reduced-order Models (ROMs). ROMs are "compressed" approximations of high-fidelity computational models. Implementing ROM methods in production codes is typically intrusive, i.e. the native codes must be adapted and modified, with individual ROM methods reimplemented in every application code. This clearly constitutes an obstacle to users who want to use ROMs. To address this, we have developed Pressio, which is a C++ header-only ROM library that can be used by an application code in a non-intrusive fashion. The main objectives behind the design of Pressio are: (a) support for general computational models (data structures, PDE types); (b) heterogeneous hardware (CPU, GPU); (c) performance; and (d) extensibility. Using metaprogramming techniques, Pressio detects and leverages the application?s native linear algebra data structures (e.g. vector and matrix) to run the ROM methods. The application only needs to expose the velocity vector and Jacobian matrix via an adapter class. Pressio checks at compile time that the target application meets the correct API. The library is structured in several modular packages including (a) non-linear least-square solvers (e.g. Gauss-Newton with and without line-search); (b) singular value decomposition (for the computation of the ROM generalized coordinates) and (c) algebraic hyper-reduction.SAND2019-5878 M

Blonigan, Patrick↗

DOE OSTI2019

Pressio v.1.0

Reduced-order Models (ROMs). ROMs are "compressed" approximations of high-fidelity computational models. Implementing ROM methods in production codes is typically intrusive, i.e. the native codes must be adapted and modified, with individual ROM methods reimplemented in every application code. This clearly constitutes an obstacle to users who want to use ROMs. To address this, we have developed Pressio, which is a C++ header-only ROM library that can be used by an application code in a non-intrusive fashion. The main objectives behind the design of Pressio are: (a) support for general computational models (data structures, PDE types); (b) heterogeneous hardware (CPU, GPU); (c) performance; and (d) extensibility. Using metaprogramming techniques, Pressio detects and leverages the application?s native linear algebra data structures (e.g. vector and matrix) to run the ROM methods. The application only needs to expose the velocity vector and Jacobian matrix via an adapter class. Pressio checks at compile time that the target application meets the correct API. The library is structured in several modular packages including (a) non-linear least-square solvers (e.g. Gauss-Newton with and without line-search); (b) singular value decomposition (for the computation of the ROM generalized coordinates) and (c) algebraic hyper-reduction.SAND2019-5878 M

Blonigan, Patrick↗

DOE OSTI2022

Single-Logarithmic Corrections to Small-$x$ Helicity Evolution

The small- x x quark helicity evolution equations at double-logarithmic order, with the kernel \sim\alpha_s\ln^2(1/x) ∼ α s ln 2 ( 1 / x ) , have been derived previously. In this work, we derive the single-logarithmic corrections to the equations, to order \alpha_s\ln(1/x) α s ln ( 1 / x ) of the evolution kernel. The new equations include the effects of the running coupling and the unpolarized small- x x evolution, both of which are parametrically significant at single-logarithmic order. The large- N_c N c and large- N_c\ N_f N c N f approximations to the equation are computed. (Here, N_c N c and N_f N f are the numbers of quark colors and flavors, respectively.) Their solutions will provide more precise estimates of the quark helicity distribution at small x x , contributing to the resolution of the proton spin puzzle.

Tawabutr, Yossathorn↗

DOE OSTI2022

A Vorticity Description of the Nuclear Cloud

We describe a model of the nuclear cloud in terms of the vorticity field associated with a buoyant vortex ring. A series of physical approximations are introduced that lower computational costs and render the model amenable for operational use. The determination of model parameters from the yield and emplacement of the weapon is also discussed.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2024

Leveraging a Neural Network-Enhanced Reproducing Kernel Particle Method for Multiphysics Degradation Modeling of Energy Storage Materials

Energy storage materials exhibit strong electro-chemo-mechanical coupling and highly anisotropic material properties, contributing to the formation and propagation of micro-cracking during charge/discharge cycling and resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation has been developed to analyze this system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is used to represent the complex material microstructures that dictate the coupled physics of these systems. Traditional electro-chemo-mechanical models rely on mesh-based finite element methods, which can lead to difficulties in meshing such complex geometries and capturing crack propagation due to mesh dependency. Here, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. NN-RKPM is additionally used to inform how crack opening and closure in turn affect the coupled chemical equations and material microstructure. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

degradation↗

DOE OSTI2022

Easy-plane spin Hall nano-oscillators as spiking neurons for neuromorphic computing

Here we show analytically using a macrospin approximation that easy-plane spin Hall nano-oscillators excited by a spin current polarized perpendicularly to the easy plane have phase dynamics analogous to that of Josephson junctions. Similarly to Josephson junctions, they can reproduce the spiking behavior of biological neurons that is appropriate for neuromorphic computing. To take advantage of typical spin-orbit torques, we use a nanoconstriction geometry, in which the magnetostatic interaction and magnetocrystalline anisotropy are tuned to create an easy plane that includes the interface normal direction. We perform micromagnetic simulations of such oscillators realized in this geometry and show that the easy-plane spiking dynamics is preserved in this experimentally feasible architecture. Finally we simulate two elementary neural network blocks that implement operations essential for neuromorphic computing. First, we show that output spikes energies from two neurons can be summed and injected into a following layer neuron and second, we demonstrate that outputs can be multiplied by synaptic weights implemented by locally modifying the anisotropy.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Closures and Simulation for Thermal Radiation Transport in Stochastic Media with Nonlinear Temperature Dependence

Because of the practical challenge of rendering very complex realistic spatial structures for numerical work, it is common practice to resort to characterizing such media as stochastic mixtures of materials, ideally parametrized with low order statistics such as the mean, variance, and correlation functions of the now random material properties. This enables realizations of the medium to be repeatedly generated and radiation transport computations to, in principle, be performed for a large ensemble of these realizations to obtain a statistically well-characterized radiation field. Statistical post-processing yields desired quantities such as conditional and unconditional mean radiation flux and probability distributions of transmitted radiation. However, such computations prove expensive for all but the simplest stochastic geometries and are most suited for benchmarking approximate models. The most common approximations lead to homogenized media so that transport computations are required only on a single medium realization but by construct provide only limited statistical information on the radiation field. Almost all approximate approaches to this problem attempt to develop equations for low order moments of the radiation intensity (mean, second moment, correlation function) but inevitably encounter a closure problem: the equation for any statistical moment will contain terms depending on unknown higher-order moments. Thus, the challenge shifts to one of developing closure relations that relate the unknown moments to the lower order moments. Under very special conditions, an exact closure can be derived but in general closures are heuristically stated constitutive relations. Also, closure approaches depend on whether the mixing statistics are spatially and/or temporally continuous as in fluctuating turbulent fields, or discontinuous as in randomly mixed solid chunks of material. Thus, unconditional averaging is generally applied in the former case but conditional averaging is more appropriate when the mixing is discontinuous. In this work, the emphasis is on binary statistical mixtures of immiscible fluids as as such the quantities of interest are averages (flux, temperature) conditioned on the material type.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

QuanSimBench

QuanSimBench is a software program that performs a gate-by-gate simulation of a quantum computer with a full state vector formulation. It simulates a simplified version of Shor's algorithm with increasing number of qubits until resources are exhausted. The score (states/s) is how fast the Approximate Quantum Fourier Transform can be computed (the modular exponentiation is not timed). The goal is to quantify the ability of a computer to simulate ideal quantum circuits.

Pakin, Scott↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

A new approach to the generalization of Planck’s law of black-body radiation

Highlights: A new approximation approach to generalized Planck’s radiation law has been developed. Average energy of radiation derived using the nonextensive partition function. The spectral energy density and spectral radiance have been computed. The present approach has been compared with approximate schemes and the exact method. Deviations of present approach and AA and FA schemes from exact result computed. -- Abstract: In this study, Planck’s law of black-body radiation has been modified within the framework of nonextensive statistical mechanics. The average energy of radiation has been derived by introducing the nonextensive partition function in the statistical relation of internal energy. The spectral energy density and spectral radiance have also been computed. The derived expression has been compared with the earlier developed approximate schemes (i.e. asymptotic approach and factorization approach) and with the recently obtained exact result. We utilize the exact and approximate Stefan–Boltzmann laws in order to compare with the new approach introduced here.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

Effect of energy dependence of the density of states on pressure-dependent rate constants

The F E integral for the normalized Boltzmann-weighted number of unimolecular states above the threshold energy is the key quantity for computing the collision efficiency in the pressure-dependent unimolecular rate theory developed by Troe, who calls this the energy dependence factor of the density of states. By using the Whitten–Rabinovitch approximation and assuming that the Whitten–Rabinovitch a(E) function is independent of energy, F E can be approximated by an analytical formula; this approximate formula is widely used because of its convenience and computational efficiency. Here we test its validity by comparing the rate constants computed by using the approximate F E to the ones determined by using the numerically integrated F E . For small-sized molecules and for reactions with high threshold energies E 0 , the differences are negligible at all temperatures, but in other cases, the approximate formula tends to underestimate F E and thus overestimates the collision efficiency, and this leads to smaller pressure falloff. When a(E) at high energies differs appreciably from a(E 0 ), we find that the underestimation of pressure-dependent rate constants by using the approximate formula can be greater than a factor of 5 at high temperatures. The physical insight we draw from this study is that, for reactions with threshold energies below about 30 kcal mol -1 , the rate of collisional energy transfer can be appreciably slowed down by the increase in the density of states at higher energies, and this increases the falloff effect by which finite-pressure rate constants become lower than the high-pressure limit, especially at higher temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Computation of Auger Electron Spectra in Organic Molecules with Multiconfiguration Pair-Density Functional Theory

Efficient and accurate computation of molecular Auger electron spectra for larger systems is limited by the rapid increase in the number of doubly ionized final states as the system size grows. Here, in this work, we benchmark the application of multiconfiguration pair-density functional theory with a restricted active space (RAS) reference wave function for computing the carbon K-edge decay spectra of 20 organic molecules. Decay rates are computed within the one-center approximation. We evaluate the performance of different basis sets and on-top functionals and find that multiconfiguration pair-density functional theory achieves accuracy comparable to RAS followed by second-order perturbation theory, but at significantly lower computational cost.

Fouda, Adam E. A. [Argonne National Laboratory (AN↗

DOE OSTI2024

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Exact sum rules with approximate ground states

Electromagnetic and weak transitions tell us a great deal about the structure of atomic nuclei. Yet modeling transitions can be difficult: it is often easier to compute the ground state, if only as an approximation, than excited states. One alternative is through transition sum rules, in particular the non-energy-weighted and energy-weighted sum rules, which can be computed as expectation values of operators. We investigate by computing sum rules for a variety of nuclei, comparing the numerically exact full configuration-interaction shell model, as a reference, to Hartree-Fock, projected Hartree-Fock, and the nucleon pair approximation. Furthermore, these approximations yield reasonable agreement, which we explain by prior work on the systematics of transition moments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2018

Applications of Analytic Models to Spent Fuel Cask Analysis

The advent of high performance computing has changed the way scientists and engineers solve problems. Scientists previously would make a tremendous effort to simplify a complex problem to it’s essence by reducing geometry, neglecting changes and only preserving first-order effects. Now, scientist are able to leave the details in the problem and computationally arrive at a result. To develop the computational physics programs used by scientists, developers make assumptions and use approximation to reduce complex, continuous calculus to algebraic expressions which computers are able to solve.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗