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,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Similarity-transformed equation-of-motion vibrational coupled-cluster theory

A similarity-transformed equation-of-motion vibrational coupled-cluster (STEOM-XVCC) method is introduced as a one-mode theory with an effective vibrational Hamiltonian, which is similarity transformed twice so that its lower-order operators are dressed with higher-order anharmonic effects. The first transformation uses an exponential excitation operator, defining the equation-of-motion vibrational coupled-cluster (EOM-XVCC) method, and the second uses an exponential excitation-deexcitation operator. From diagonalization of this doubly similarity-transformed Hamiltonian in the small one-mode excitation space, the method simultaneously computes accurate anharmonic vibrational frequencies of all fundamentals, which have unique significance in vibrational analyses. We establish a diagrammatic method of deriving the working equations of STEOM-XVCC and prove their connectedness and thus size-consistency as well as the exact equality of its frequencies with the corresponding roots of EOM-XVCC. We furthermore elucidate the similarities and differences between electronic and vibrational STEOM methods and between STEOM-XVCC and vibrational many-body Green’s function theory based on the Dyson equation, which is also an anharmonic one-mode theory. The latter comparison inspires three approximate STEOM-XVCC methods utilizing the common approximations made in the Dyson equation: the diagonal approximation, a perturbative expansion of the Dyson self-energy, and the frequency-independent approximation. The STEOM-XVCC method including up to the simultaneous four-mode excitation operator in a quartic force field and its three approximate variants are formulated and implemented in computer codes with the aid of computer algebra, and they are applied to small test cases with varied degrees of anharmonicit

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Sub-Grid Model Improving Shrinking Core Simulations of Redox-Sensitive Technetium Release From Slag Cement Waste Forms - 17295

Numerical simulation of Tc transport in reducing cementitious materials undergoing oxidation is challenging because the effective solid-solute partition coefficient (K{sub d}) varies greatly between the reduced and oxidized states, assuming the Tc mass loading far exceeds that required to reach solubility in the aqueous phase, as is typical in waste disposal. In a conventional finite-volume formulation, the local aqueous concentration increases orders of magnitude when a computational cell switches from a reducing to oxidizing condition, which is an artifact of numerical discretization. In principal such artifacts can be reduced to an insignificant level by refining the computational grid. However, this approach is not feasible in typical facility scale applications due to computer runtime and storage limitations. In this paper an alternative sub-grid Tc release model is derived to approximately capture redox processes occurring at scales smaller than the computational mesh. This alternative approach introduces minimal additional computational expense, while significantly reducing numerical artifacts in the form of Tc concentration / flux spikes. The method is illustrated for two simple geometries and the Savannah River Site Saltstone waste Disposal Facility. The sub-grid model is shown to significantly reduce artificial spikes in Tc-99 release, resulting in more physically realistic numerical simulations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2015

Reduced Order Model Implementation in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC project aims to develop new advanced simulation-based tools to perform Probabilistic Risk Analysis (PRA) for the existing fleet of U.S. nuclear power plants (NPPs). These tools numerically model not only the thermo-hydraulic behavior of the reactor primary and secondary systems but also external events temporal evolution and components/system ageing. Thus, this is not only a multi-physics problem but also a multi-scale problem (both spatial, µm-mm-m, and temporal, ms-s-minutes-years). As part of the RISMC PRA approach, a large amount of computationally expensive simulation runs are required. An important aspect is that even though computational power is regularly growing, the overall computational cost of a RISMC analysis may be not viable for certain cases. A solution that is being evaluated is the use of reduce order modeling techniques. During the FY2015, we investigated and applied reduced order modeling techniques to decrease the RICM analysis computational cost by decreasing the number of simulations runs to perform and employ surrogate models instead of the actual simulation codes. This report focuses on the use of reduced order modeling techniques that can be applied to any RISMC analysis to generate, analyze and visualize data. In particular, we focus on surrogate models that approximate the simulation results but in a much faster time (µs instead of hours/days). We apply reduced order and surrogate modeling techniques to several RISMC types of analyses using RAVEN and RELAP-7 and show the advantages that can be gained.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2018

Normal and resonant Auger spectroscopy of isocyanic acid, HNCO

In this study, we investigate HNCO by resonant and nonresonant Auger electron spectroscopy at the K-edges of carbon, nitrogen, and oxygen, employing soft X-ray synchrotron radiation. In comparison with the isosteric but linear CO 2 molecule, spectra of the bent HNCO molecule are similar but more complex due to its reduced symmetry, wherein the degeneracy of the π-orbitals is lifted. Resonant Auger electron spectra are presented at different photon energies over the first core-excited 1s → 10a' resonance. All Auger electron spectra are assigned based on ab initio configuration interaction computations combined with the one-center approximation for Auger intensities and moment theory to consider vibrational motion. The calculated spectra were scaled by a newly introduced energy scaling factor, and generally, good agreement is found between experiment and theory for normal as well as resonant Auger electron spectra. A comparison of resonant Auger spectra with nonresonant Auger structures shows a slight broadening as well as a shift of the former spectra between –8 and –9 eV due to the spectating electron. Since HNCO is a small molecule and contains the four most abundant atoms of organic molecules, the reported Auger electron decay spectra will provide a benchmark for further theoretical approaches in the computation of core electron spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

Sublinear scaling for time-dependent stochastic density functional theory

A stochastic approach to time-dependent density functional theory is developed for computing the absorption cross section and the random phase approximation (RPA) correlation energy. The core idea of the approach involves time-propagation of a small set of stochastic orbitals which are first projected on the occupied space and then propagated in time according to the time-dependent Kohn-Sham equations. The evolving electron density is exactly represented when the number of random orbitals is infinite, but even a small number (≈16) of such orbitals is enough to obtain meaningful results for absorption spectrum and the RPA correlation energy per electron. We implement the approach for silicon nanocrystals using real-space grids and find that the overall scaling of the algorithm is sublinear with computational time and memory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗
DOE OSTI2019

Brain Connectomics: Opportunities for High-Performance Computing (Final Report)

The human brain is estimated to contain approximately 100 trillion neural connections. This complex map of connectivity (human connectome) underlies cognitive processes and informs disease states, but until recently, studying the human connectome has been hampered by the difficulty of collecting and processing suitable data for analysis. In this context, an initiative denominated The Human Connectome Project (HCP) was created to acquire and collect the largest, most cohesive set of brain data to accelerate neuroscience research. Recently the HCP released a magnetic resonance (MR) dataset of brain imagery with unprecedented scale and organization, together with high quality spatial and temporal resolution; however, fully taking advantage of this high-resolution brain imagery to estimate neurological connectivity networks requires high-performance computing (HPC). In this project, we explored the feasibility of using HPC resources at Lawrence Livermore to effectively estimate brain connectivity networks from this large set of imagery. Specifically, we addressed one of the main current challenges in brain connectomics, which is to advance the computation of individual structural and functional connectomes.

42 ENGINEERING↗
DOE OSTI2021

Spherical Parameter Estimation and MPDV Applications

A new algebraic least square approach is presented for estimating effective zero center for verification of MPDV(Multichannel Photon Doppler Velocimetry) probe designs. Unlike previous algebraic least square methods for spherical parameter estimation, the new method can be shown to be concise in mathematic formulations, easy of computations, invariant under rigid -body transformations, no need for numerical approximations, and precise in dealing with precise data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A side-by-side comparison of the solidification dynamics of quasicrystalline and approximant phases in the Al–Co–Ni system

Quasicrystals and their approximants have triggered widespread interest due to the challenge of solving their complex crystal structures as well as their possibly exceptional properties. The structural motifs of approximants are similar to those of the corresponding quasicrystals, but to what extent are their crystallization pathways the same? Unfortunately, there have been very few in situ experimental investigations to answer this question. Here, by leveraging the high penetrating power of hard X-rays, synchrotron-based X-ray tomography was conducted in order to capture the nucleation and growth of a decagonal quasicrystal and its related approximant. The combination of data-driven computational analysis with new thermodynamic databases allowed the characterization, with high precision, of the constitutional and kinetic driving forces for crystallization. The experimental results prove that the growth of both crystals from a liquid is dominated by first-order kinetics. Nevertheless, and somewhat surprisingly, significant differences were observed in their rates of nucleation and growth. The reasons for such divergent behaviours are discussed in light of contemporary theories of intermetallic crystallization.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Toward perturbation theory methods on a quantum computer

Perturbation theory, used in a wide range of fields, is a powerful tool for approximate solutions to complex problems, starting from the exact solution of a related, simpler problem. Advances in quantum computing, especially over the past several years, provide opportunities for alternatives to classical methods. Here, we present a general quantum circuit estimating both the energy and eigenstates corrections that is far superior to the classical version when estimating second-order energy corrections. We demonstrate our approach as applied to the two-site extended Hubbard model. In addition to numerical simulations based on qiskit, results on IBM’s quantum hardware are also presented. Our work offers a general approach to studying complex systems with quantum devices, with no training or optimization process needed to obtain the perturbative terms, which can be generalized to other Hamiltonian systems both in chemistry and physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗
DOE OSTI2022

Bayesian optimization to design a novel x-ray shaping device

In radiation therapy, x-ray dose must be precisely sculpted to the tumor, while simultaneously avoiding surrounding organs at risk. This requires modulation of x-ray intensity in space and/or time. Typically, this is achieved using a multi leaf collimator (MLC) - a complex mechatronic device comprising over one hundred individually powered tungsten ‘leaves’ that move in or out of the radiation field as required. Here, an all-electronic x-ray collimation concept with no moving parts is presented, termed “SPHINX”: Scanning Pencil-beam High-speed Intensity-modulated X-ray source. SPHINX utilizes a spatially distributed bremsstrahlung target and collimator array in conjunction with magnetic scanning of a high energy electron beam to generate a plurality of small x-ray “beamlets.” A simulation framework was developed in Topas Monte Carlo incorporating a phase space electron source, transport through user defined magnetic fields, bremsstrahlung x-ray production, transport through a SPHINX collimator, and dose in water. This framework was completely parametric, meaning a simulation could be built and run for any supplied geometric parameters. This functionality was coupled with Bayesian optimization to find the best parameter set based on an objective function which included terms to maximize dose rate for a user defined beamlet width while constraining inter-channel cross talk and electron contamination. Designs for beamlet widths of 5, 7, and 10 mm 2 were generated. Each optimization was run for 300 iterations and took approximately 40 h on a 24-core computer. For the optimized 7-mm model, a simulation of all beamlets in water was carried out including a linear scanning magnet calibration simulation. Finally, a back-of-envelope dose rate formalism was developed and used to estimate dose rate under various conditions. The optimized 5–, 7–, and 10-mm models had beamlet widths of 5.1 , 7.2 , and 10.1 mm 2 and dose rates of 3574, 6351, and 10 015 Gy/C, respectively. The reduction in dose rate for smaller beamlet widths is a result of both increased collimation and source occlusion. For the simulation of all beamlets in water, the scanning magnet calibration reduced the offset between the collimator channels and beam centroids from 2.9 ±1.9 mm to 0.01 ±0.03 mm. A slight reduction in dose rate of approximately 2% per degree of scanning angle was observed. Based on a back-of-envelope dose rate formalism, SPHINX in conjunction with next-generation linear accelerators has the potential to achieve substantially higher dose rates than conventional MLC-based delivery, with delivery of an intensity modulated 100 x 100 mm 2 field achievable in 0.9 to 10.6 s depending on the beamlet widths used. Bayesian optimization was coupled with Monte Carlo modeling to generate SPHINX geometries for various beamlet widths. A complete Monte Carlo simulation for one of these designs was developed, including electron beam transport of all beamlets through scanning magnets, x-ray production and collimation, and dose in water. These results demonstrate that SPHINX is a promising candidate for sculpting radiation dose with no moving parts, and has the potential to vastly improve both the speed and robustness of radiotherapy delivery. A multi-beam SPHINX system may be a candidate for delivering magavoltage FLASH RT in humans.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2022

Efficient emulation of relativistic heavy ion collisions with transfer learning

Measurements from the Large Hadron Collider (LHC) and the Relativistic Heavy Ion Collider (RHIC) can be used to study the properties of quark-gluon plasma. Systematic constraints on these properties must combine measurements from different collision systems and methodically account for experimental and theoretical uncertainties. Such studies require a vast number of costly numerical simulations. While computationally inexpensive surrogate models (“emulators”) can be used to efficiently approximate the predictions of heavy ion simulations across a broad range of model parameters, training a reliable emulator remains a computationally expensive task. We use transfer learning to map the parameter dependencies of one model emulator onto another, leveraging similarities between different simulations of heavy ion collisions. By limiting the need for large numbers of simulations to only one of the emulators, this technique reduces the numerical cost of comprehensive uncertainty quantification when studying multiple collision systems and exploring different models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.

42 ENGINEERING↗
DOE OSTI2023

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗
DOE OSTI2013

Communication: Random phase approximation renormalized many-body perturbation theory

We derive a renormalized many-body perturbation theory (MBPT) starting from the random phase approximation (RPA). This RPA-renormalized perturbation theory extends the scope of single-reference MBPT methods to small-gap systems without significantly increasing the computational cost. The leading correction to RPA, termed the approximate exchange kernel (AXK), substantially improves upon RPA atomization energies and ionization potentials without affecting other properties such as barrier heights where RPA is already accurate. Thus, AXK is more balanced than second-order screened exchange [A. Grüneis et al., J. Chem. Phys. 131, 154115 (2009)], which tends to overcorrect RPA for systems with stronger static correlation. Similarly, AXK avoids the divergence of second-order Møller-Plesset (MP2) theory for small gap systems and delivers a much more consistent performance than MP2 across the periodic table at comparable cost. RPA+AXK thus is an accurate, non-empirical, and robust tool to assess and improve semi-local density functional theory for a wide range of systems previously inaccessible to first-principles electronic structure calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2013

High Performance Computing and Storage Requirements for Biological and Environmental Research Target 2017

The National Energy Research Scientific Computing Center (NERSC) is the primary computing center for the DOE Office of Science, serving approximately 4,500 users working on some 650 projects that involve nearly 600 codes in a wide variety of scientific disciplines. In addition to large-­scale computing and storage resources NERSC provides support and expertise that help scientists make efficient use of its systems. The latest review revealed several key requirements, in addition to achieving its goal of characterizing BER computing and storage needs.

59 BASIC BIOLOGICAL SCIENCES↗