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 793 records · Page 44
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

Alexeev, Yuri↗
DOE OSTI2019

High-order gradients with the shifted boundary method: An embedded enriched mixed formulation for elliptic PDEs

Here, we propose an extension of the embedded boundary method known as “shifted boundary method” to elliptic diffusion equations in mixed form (e.g., Darcy flow, heat diffusion problems with rough coefficients, etc.). Our aim is to obtain an improved formulation that, for linear finite elements, is at least second-order accurate for both flux and primary variable, when either Dirichlet or Neumann boundary conditions are applied. Following previous work of Nishikawa and Mazaheri in the context of residual distribution methods, we consider the mixed form of the diffusion equation (i.e., with Darcy-type operators), and introduce an enrichment of the primary variable. This enrichment is obtained exploiting the relation between the primary variable and the flux variable, which is explicitly available at nodes in the mixed formulation. The proposed enrichment mimics a formally quadratic pressure approximation, although only nodal unknowns are stored, similar to a linear finite element approximation. We consider both continuous and discontinuous finite element approximations and present two approaches: a non-symmetric enrichment, which, as in the original references, only improves the consistency of the overall method; and a symmetric enrichment, which enables a full error analysis in the classical finite element context. Combined with the shifted boundary method, these two approaches are extended to high-order embedded computations, and enable the approximation of both primary and flux (gradient) variables with second-order accuracy, independently on the type of boundary conditions applied. We also show that the primary variable is third-order accurate, when pure Dirichlet boundary conditions are embedded.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A nonlinearly preconditioned conjugate gradient algorithm for rank‐ R canonical tensor approximation

Summary Alternating least squares (ALS) is often considered the workhorse algorithm for computing the rank‐ R canonical tensor approximation, but for certain problems, its convergence can be very slow. The nonlinear conjugate gradient (NCG) method was recently proposed as an alternative to ALS, but the results indicated that NCG is usually not faster than ALS. To improve the convergence speed of NCG, we consider a nonlinearly preconditioned NCG (PNCG) algorithm for computing the rank‐ R canonical tensor decomposition. Our approach uses ALS as a nonlinear preconditioner in the NCG algorithm. Alternatively, NCG can be viewed as an acceleration process for ALS. We demonstrate numerically that the convergence acceleration mechanism in PNCG often leads to important pay‐offs for difficult tensor decomposition problems, with convergence that is significantly faster and more robust than for the stand‐alone NCG or ALS algorithms. We consider several approaches for incorporating the nonlinear preconditioner into the NCG algorithm that have been described in the literature previously and have met with success in certain application areas. However, it appears that the nonlinearly PNCG approach has received relatively little attention in the broader community and remains underexplored both theoretically and experimentally. Thus, this paper serves several additional functions, by providing in one place a concise overview of several PNCG variants and their properties that have only been described in a few places scattered throughout the literature, by systematically comparing the performance of these PNCG variants for the tensor decomposition problem, and by drawing further attention to the usefulness of nonlinearly PNCG as a general tool. In addition, we briefly discuss the convergence of the PNCG algorithm. In particular, we obtain a new convergence result for one of the PNCG variants under suitable conditions, building on known convergence results for non‐preconditioned NCG. Copyright © 2014 John Wiley & Sons, Ltd.

Sterck, Hans De↗
DOE OSTI2024

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs

Quantum chemistry is a discipline which relies heavily on very expensive numerical computations. The scaling of correlated wave function methods lies, in their standard implementation, between O(N-5) and O(e(N)), where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. QUANTUM PACKAGE is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in QUANTUM PACKAGE is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. QUANTUM PACKAGE strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.

Garniron, Yann↗
DOE OSTI2015

FOURIER ANALYSIS OF BLAZAR VARIABILITY: KLEIN–NISHINA EFFECTS AND THE JET SCATTERING ENVIRONMENT

The strong variability of blazars can be characterized by power spectral densities (PSDs) and Fourier frequency-dependent time lags. In previous work, we created a new theoretical formalism for describing the PSDs and time lags produced via a combination of stochastic particle injection and emission via the synchrotron, synchrotron self-Compton, and external Compton (EC) processes. This formalism used the Thomson cross section and simple δ-function approximations to model the synchrotron and Compton emissivities. Here we expand upon this work, using the full Compton cross section and detailed and accurate emissivities. Our results indicate good agreement between the PSDs computed using the δ-function approximations and those computed using the accurate expressions, provided the observed photons are produced primarily by electrons with energies exceeding the lower limit of the injected particle population. Breaks are found in the PSDs at frequencies corresponding to the cooling timescales of the electrons primarily responsible for the observed emission, and the associated time lags are related to the difference in electron cooling timescales between the two energy channels, as expected. If the electron cooling timescales can be determined from the observed time lags and/or the observed EC PSDs, then one could in principle use the method developed here to determine the energy of the external seed photon source for EC, which is an important unsolved problem in blazar physics.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗
DOE OSTI2016

An atomic orbital based real-time time-dependent density functional theory for computing electronic circular dichroism band spectra

One of the challenges of interpreting electronic circular dichroism (ECD) band spectra is that different states may have different rotatory strength signs, determined by their absolute configuration. If the states are closely spaced and opposite in sign, observed transitions may be washed out by nearby states, unlike absorption spectra where transitions are always positive additive. To accurately compute ECD bands, it is necessary to compute a large number of excited states, which may be prohibitively costly if one uses the linear-response time-dependent density functional theory (TDDFT) framework. Here we implement a real-time, atomic-orbital based TDDFT method for computing the entire ECD spectrum simultaneously. The method is advantageous for large systems with a high density of states. In contrast to previous implementations based on real-space grids, the method is variational, independent of nuclear orientation, and does not rely on pseudopotential approximations, making it suitable for computation of chiroptical properties well into the X-ray regime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1986

Semiempirical methods for computing turbulent flows

Two semiempirical theories which provide a basis for determining the turbulent friction and heat exchange near a wall are presented: (1) the Prandtl-Karman theory, and (2) the theory utilizing an equation for the energy of turbulent pulsations. A comparison is made between exact numerical methods and approximate integral methods for computing the turbulent boundary layers in the presence of pressure, blowing, or suction gradients. Using the turbulent flow around a plate as an example, it is shown that, when computing turbulent flows with external turbulence, it is preferable to construct a turbulence model based on the equation for energy of turbulent pulsations.

Belov, I. A.↗
DOE OSTI2022

Neuromorphic scaling advantages for energy-efficient random walk computations

Neuromorphic computing, which aims to replicate the computational structure and architecture of the brain in synthetic hardware, has typically focused on artificial intelligence applications. What is less explored is whether such brain-inspired hardware can provide value beyond cognitive tasks. Here we show that the high degree of parallelism and configurability of spiking neuromorphic architectures makes them well suited to implement random walks via discrete-time Markov chains. Overall, these random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Using IBM’s TrueNorth and Intel’s Loihi neuromorphic computing platforms, we show that our neuromorphic computing algorithm for generating random walk approximations of diffusion offers advantages in energy-efficient computation compared with conventional approaches. We also show that our neuromorphic computing algorithm can be extended to more sophisticated jump-diffusion processes that are useful in a range of applications, including financial economics, particle physics and machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Coupled-cluster based approach for core-level states in condensed phase: Theory and application to different protonated forms of aqueous glycine

A theoretical approach for calculating core-level states in condensed phase is presented. The approach is based on equation-of-motion coupled-cluster theory (EOMCC) and effective fragment potential (EFP) method. By introducing an approximate treatment of double excitations in the EOM-CCSD (EOM-CC with single and double substitutions) ansatz, we address poor convergence issues that are encountered for the core-level states and significantly reduce computational costs. While the approximations introduce relatively large errors in the absolute values of transition energies, the errors are systematic. Consequently, chemical shifts, changes in ionization energies relative to reference systems, are reproduced reasonably well. By using different protonation forms of solvated glycine as a benchmark system, we show that our protocol is capable of reproducing the experimental chemical shifts with a quantitative accuracy. The results demonstrate that chemical shifts are very sensitive to the solvent interactions and that explicit treatment of solvent, such as EFP, is essential for achieving quantitative accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1972

Multipath propagation study for L-band, over-ocean, satellite-aircraft communication link

The results are presented of a study of multipath propagation between an aeronautical relay satellite in synchronous earth orbit and an aircraft flying over the ocean. An analytical model for the reflected power is developed and the results of a computer solution are compared with an approximate solution obtained through integration by the method of steepest descent. The computer solution is shown to differ considerably from the approximate solution. Both methods are compared with the limited experimental results available.

Deal, J. H.↗
NASA NTRS2021

Thermal Inspection of a Composite Fuselage Section Using theMethod of Proper Generalized Decomposition

Proper Generalized Decomposition (PGD) is a reduced order modeling technique for the simulation of physical systems whose governing equations depend on boundary conditions, initial conditions, material properties, and geometric parameters. It uses separated representations of system covariates combined with an iterative approximation method known as successive enrichment in order to compute an accurate parameter-dependent approximation to the full governing equations. PGD can also be used as an alternative to the Singular Value Decomposition (SVD) of a matrix and therefore as an alternative to PCA thermography. In this paper PGD was used to analyze data derived from the inspection of a composite fuselage forward section using flash thermography, and the results were compared against the standard PCA approach.

Nondestructive Evaluation↗
DOE OSTI2023

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Opening band gaps of low-dimensional materials at the meta-GGA level of density functional approximations

The quasiparticle band structure can be properly described by Hedin's GW approximation (GW), at a high computational cost. For band gaps, semilocal density functionals up to the generalized gradient approximation (GGA) level cannot compete with the accuracy of hybrid-based approximations or GW. Meta-GGA density functionals with a strong dependence on the kinetic energy density ingredient can potentially give wider band gaps compared with GGAs. The recent TASK meta-GGA density functional from Aschebrock and Kümmel [ Phys. Rev. Research 1 , 033082 (2019) ], is constructed with an enhanced nonlocality in the generalized Kohn-Sham scheme and therefore harbors great opportunities for band gap prediction. Although this approximation was found to yield excellent band gaps of bulk solids, this accuracy cannot be straightforwardly transferred to low-dimensional materials. Additionally, the reduced screening of these materials results in larger band gaps compared with their bulk counterparts, as an additional barrier to overcome. In this paper we demonstrate how the alteration of this functional affects the band gaps of monolayers and nanoribbons and present accurate band gaps competing with the revised Heyd-Scuseria-Ernzerhof (HSE06) approximation. In order to achieve this goal, we have modified the TASK functional (a) by changing the tight upper bound for one- or two-electron systems ( h X 0 ) from 1.174 to 1.29 and (b) by changing the limit of the interpolation function f X ( α → ∞ ) of the TASK functional that interpolates the exchange enhancement factor F X ( s , α ) from α = 0 to 1. The resulting modified TASK (mTASK) was tested for various materials from three dimensions to two dimensions to one dimension (nanoribbons) and was compared with the results of the higher-level hybrid functional HSE06 or with the G 0 W 0 approximation within many-body perturbation theory. We find that mTASK systematically improves the band gaps and band structures of two-dimensional (2D) and 1D systems, without significantly affecting the accuracy of the original TASK for the bulk 3D materials, when compared with the Perdew-Burke-Ernzerhof (PBE) GGA and the strongly constrained and appropriately normed (SCAN) meta-GGA. We further demonstrate the applicability of mTASK by assessing the band structures of transition metal dichalcogenide nanoribbons with respect to various bending curvatures.

36 MATERIALS SCIENCE↗