Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate computing”

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,099 records · Page 61

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↗

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↗

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↗

Poisson-Vlasov in a strong magnetic field: A stochastic solution approach

Stochastic solutions are obtained for the Maxwell-Vlasov equation in the approximation where magnetic field fluctuations are neglected and the electrostatic potential is used to compute the electric field. This is a reasonable approximation for plasmas in a strong external magnetic field. Both Fourier and configuration space solutions are constructed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emulator Generation Gadget

This software automates the production of standalone emulators for complex computer models. The end result of running the software is a piece of code called an emulator, a statistical approximation which predicts the output of complex computer simulation, but at a much faster speed. The emulator is built using a training set of inputs and outputs from the simulations. The input-output pairs are used in a Bayesian scheme to estimate the parameters of a Gaussian process based regression model that learns the input-output relationship. The estimated parameters are combined with a generic C skeleton to produce a compile-able instantiation of the emulator.

Sweeney, Christine↗

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↗

Vibrational coherence and energy transfer in two-dimensional spectra with the optimized mean-trajectory approximation

The optimized mean-trajectory (OMT) approximation is a semiclassical method for computing vibrational response functions from action-quantized classical trajectories connected by discrete transitions that represent radiation-matter interactions. Here, we extend the OMT to include additional vibrational coherence and energy transfer processes. This generalized approximation is applied to a pair of anharmonic chromophores coupled to a bath. The resulting 2D spectra are shown to reflect coherence transfer between normal modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TH-E-BRE-01: A 3D Solver of Linear Boltzmann Transport Equation Based On a New Angular Discretization Method with Positivity for Photon Dose Calculation Benchmarked with Geant4

Purpose: The Linear Boltzmann Transport Equation (LBTE) solved through statistical Monte Carlo (MC) method provides the accurate dose calculation in radiotherapy. This work is to investigate the alternative way for accurately solving LBTE using deterministic numerical method due to its possible advantage in computational speed from MC. Methods: Instead of using traditional spherical harmonics to approximate angular scattering kernel, our deterministic numerical method directly computes angular scattering weights, based on a new angular discretization method that utilizes linear finite element method on the local triangulation of unit angular sphere. As a Result, our angular discretization method has the unique advantage in positivity, i.e., to maintain all scattering weights nonnegative all the time, which is physically correct. Moreover, our method is local in angular space, and therefore handles the anisotropic scattering well, such as the forward-peaking scattering. To be compatible with image-guided radiotherapy, the spatial variables are discretized on the structured grid with the standard diamond scheme. After discretization, the improved sourceiteration method is utilized for solving the linear system without saving the linear system to memory. The accuracy of our 3D solver is validated using analytic solutions and benchmarked with Geant4, a popular MC solver. Results: The differences between Geant4 solutions and our solutions were less than 1.5% for various testing cases that mimic the practical cases. More details are available in the supporting document. Conclusion: We have developed a 3D LBTE solver based on a new angular discretization method that guarantees the positivity of scattering weights for physical correctness, and it has been benchmarked with Geant4 for photon dose calculation.

97 MATHEMATICS AND COMPUTING↗

Computation of inflationary cosmological perturbations in chaotic inflationary scenarios using the phase-integral method

The phase-integral approximation devised by Froeman and Froeman is used for computing cosmological perturbations in the quadratic chaotic inflationary model. The phase-integral formulas for the scalar and tensor power spectra are explicitly obtained up to fifth order of the phase-integral approximation. We show that the phase integral gives a very good approximation for the shape of the power spectra associated with scalar and tensor perturbations as well as the spectral indices. We find that the accuracy of the phase-integral approximation compares favorably with the numerical results and those obtained using the slow-roll and uniform-approximation methods.

99 GENERAL AND MISCELLANEOUS↗

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↗

Band gap engineering in finite elongated graphene nanoribbon heterojunctions: Tight-binding model

A simple model based on the divide and conquer rule and tight-binding (TB) approximation is employed for studying the role of finite size effect on the electronic properties of elongated graphene nanoribbon (GNR) heterojunctions. In our model, the GNR heterojunction is divided into three parts: a left (L) part, middle (M) part, and right (R) part. The left part is a GNR of width W{sub L}, the middle part is a GNR of width W{sub M}, and the right part is a GNR of width W{sub R}. We assume that the left and right parts of the GNR heterojunction interact with the middle part only. Under this approximation, the Hamiltonian of the system can be expressed as a block tridiagonal matrix. The matrix elements of the tridiagonal matrix are computed using real space nearest neighbor orthogonal TB approximation. The electronic structure of the GNR heterojunction is analyzed by computing the density of states. We demonstrate that for heterojunctions for which W{sub L} = W{sub R}, the band gap of the system can be tuned continuously by varying the length of the middle part, thus providing a new approach to band gap engineering in GNRs. Our TB results were compared with calculations employing divide and conquer rule in combination with density functional theory (DFT) and were found to agree nicely.

36 MATERIALS SCIENCE↗

A Galerkin method with two-dimensional Haar basis functions for the computation of the Karhunen–Loève expansion

We study the numerical approximation of a homogeneous Fredholm integral equation of second kind associated with the Karhunen–Loève expansion of Gaussian random fields. We develop, validate, and discuss an algorithm based on the Galerkin method with two-dimensional Haar wavelets as basis functions. The shape functions are constructed from the orthogonal decomposition of tensor-product spaces of one-dimensional Haar functions, and a recursive algorithm is employed to compute the matrix of the discrete eigenvalue system without the explicit calculation of integrals, allowing the implementation of a fast and efficient algorithm that provides considerable reduction in CPU time, when compared with classical Galerkin methods. Numerical experiments confirm the convergence rate of the method and assess the approximation error and the sparsity of the eigenvalue system when the wavelet expansion is truncated. We illustrate the numerical solution of a diffusion problem with random input data with the present method. In this problem, accuracy was retained after dropping the coefficients below a threshold value that was numerically determined. A similar method with scaling functions rather than wavelet functions does not need a discrete wavelet transform and leads to eigenvalue systems with better conditioning but lower sparsity.

97 MATHEMATICS AND COMPUTING↗

A continuation multilevel Monte Carlo algorithm

Here, we propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. Moreover, the actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding variance and weak error. These parameters are calibrated using Bayesian estimation, taking particular notice of the deepest levels of the discretization hierarchy, where only few realizations are available to produce the estimates. The resulting CMLMC estimator exhibits a non-trivial splitting between bias and statistical contributions. We also show the asymptotic normality of the statistical error in the MLMC estimator and justify in this way our error estimate that allows prescribing both required accuracy and confidence in the final result. Our numerical results substantiate the above results and illustrate the corresponding computational savings in examples that are described in terms of differential equations either driven by random measures or with random coefficients.

97 MATHEMATICS AND COMPUTING↗

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↗

Analytical and computational study of the ideal full two-fluid plasma model and asymptotic approximations for Hall-magnetohydrodynamics

The 5-moment two-fluid plasma model uses Euler equations to describe the ion and electron fluids and Maxwell's equations to describe the electric and magnetic fields. Two-fluid physics becomes significant when the characteristic spatial scales are on the order of the ion skin depth and characteristic time scales are on the order of the ion cyclotron period. The full two-fluid plasma model has disparate characteristic speeds ranging from the ion and electron speeds of sound to the speed of light. Two asymptotic approximations are applied to the full two-fluid plasma to arrive at the Hall-MHD model, namely negligible electron inertia and infinite speed of light. The full two-fluid plasma model and the Hall-MHD model are studied for applications to an electromagnetic plasma shock, geospace environmental modeling (GEM challenge) magnetic reconnection, an axisymmetric Z-pinch, and an axisymmetric field reversed configuration (FRC).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

EMMA: an adaptive mesh refinement cosmological simulation code with radiative transfer

EMMA is a cosmological simulation code aimed at investigating the reionization epoch. It handles simultaneously collisionless and gas dynamics, as well as radiative transfer physics using a moment-based description with the M1 approximation. Field quantities are stored and computed on an adaptive three-dimensional mesh and the spatial resolution can be dynamically modified based on physically motivated criteria. Physical processes can be coupled at all spatial and temporal scales. We also introduce a new and optional approximation to handle radiation: the light is transported at the resolution of the non-refined grid and only once the dynamics has been fully updated, whereas thermo-chemical processes are still tracked on the refined elements. Such an approximation reduces the overheads induced by the treatment of radiation physics. A suite of standard tests are presented and passed by EMMA, providing a validation for its future use in studies of the reionization epoch. The code is parallel and is able to use graphics processing units (GPUs) to accelerate hydrodynamics and radiative transfer calculations. Depending on the optimizations and the compilers used to generate the CPU reference, global GPU acceleration factors between ×3.9 and ×16.9 can be obtained. As a result, vectorization and transfer operations currently prevent better GPU performance and we expect that future optimizations and hardware evolution will lead to greater accelerations.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Eccentric Form of the Loss of Stability of a Rotating Elastoplastic Radially Inhomogeneous Stepped Circular Disk

We propose a procedure for the investigation of the possible loss of stability of a rotating elastoplastic radially inhomogeneous stepped circular disk by the method of small parameter. The characteristic equation for the critical radius of the plastic zone is obtained in the first approximation. The values of the critical angular rotational velocity are numerically found for various parameters of the disk.

97 MATHEMATICS AND COMPUTING↗