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,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Analysis and computation of viscous subsonic primary and secondary flows

A new approximate flow analysis, designed to enable numerical solution as an initial value problem, is developed for a wide class of viscous subsonic flows at high Reynolds number and in straight or smoothly curved three-dimensional flow geometries. The analysis is coordinate-independent and corrects an a priori known inviscid primary flow for viscous and thermal effects, secondary flows, total pressure distortion, internal flow blockage and pressure drop. Computed results include laminar solutions for three-dimensional boundary layer flow, fully viscous flow in circular arc ducts, and also flow in a curved duct shaped like a turbine blade passage.

Briley, W. R.↗
NASA NTRS1981

As-built design specification for PARHIS

The program is part of the CLASFYG package. It produces histograms of the greeness profile derived parameters alpha, beta, t sub o, and chi squared, which are computed by the CLASFYG program. Alpha is the approximate greeness rise time, beta is the approximate greeness decay time, t sub o is the spectral crop emergence date, and chi squared per degree of freedom is the goodness of fit of the actual data to the computed greeness profile. The program also produces statistical information concerning the parameters.

Tompkins, M. A.↗
NASA NTRS1992

Computational structures technology

Computational structures technology (CST), which has emerged from FEM developments, is a fusion of materials modeling, structural and dynamic analysis and synthesis methods, on the one hand, and numerical analysis and approximation theory, on the other. In addition to computational materials modeling, CST encompasses computational methods for predicting the response, performance, failure, and service life of structures and their components, as well as automated methods for structural synthesis and optimization.

Noor, Ahmed K.↗
DOE OSTI2025

Analytical and EZmock covariance validation for the DESI 2024 results

The estimation of uncertainties in cosmological parameters is an important challenge in Large-Scale-Structure (LSS) analyses. For standard analyses such as Baryon Acoustic Oscillations (BAO) and Full-Shape two approaches are usually considered. First: analytical estimates of the covariance matrix use Gaussian approximations and (nonlinear) clustering measurements to estimate the matrix, which allows a relatively fast and computationally cheap way to generate matrices that adapt to an arbitrary clustering measurement. On the other hand, sample covariances are an empirical estimate of the matrix based on an ensemble of clustering measurements from fast and approximate simulations. While more computationally expensive due to the large amount of simulations and volume required, these allow us to take into account systematics that are impossible to model analytically. In this work we compare these two approaches in order to enable DESI's key analyses. We find that the configuration space analytical estimate performs satisfactorily in BAO analyses and its flexibility in terms of input clustering makes it the fiducial choice for DESI's 2024 BAO analysis. On the contrary, the analytical computation of the covariance matrix in Fourier space does not reproduce the expected measurements in terms of Full-Shape analyses, which motivates the use of a corrected mock covariance for DESI's 2024 Full Shape analysis.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

The impact of different neutrino transport methods on multidimensional core-collapse supernova simulations

Neutrinos play a crucial role in the core-collapse supernova (CCSN) explosion mechanism. The requirement of accurately calculating the transport of neutrinos makes simulations of the CCSN mechanism extremely challenging and computationally expensive. Historically, this stiff challenge has been met by making approximations to the full transport equation. In this work, we compare CCSN simulations in one- and two-dimensions with three approximate neutrino transport schemes, each implemented in the FLASH simulation framework. We compare a two-moment M1 scheme with an analytic closure (M1), the isotropic diffusion source approximation (IDSA), and the advanced spectral leakage method. We identify and discuss the advantages and disadvantages of each scheme. For each approximate transport scheme, we use identical grid setups, hydrodynamics, and gravity solvers to investigate the transport effects on supernova shock dynamics and neutrino quantities. We find that the transport scheme has a small effect on the evolution of protoneutron star (PNS) radius, PNS mass, and the mass accretion rate. The neutrino luminosities, mean energies, and shock radii have a ~10%–20% quantitative difference but the overall qualitative trends are fairly consistent between all three approximations. We find larger differences in the gain region properties, including the gain region mass and the net heating rate in the gain region, as well as the strength of PNS convection in the core. We investigate the progenitor, nuclear equation of state, and stochastic perturbation dependence of our simulations and find similar magnitudes of impact on key quantities. We also compare the computational expense of the various approximations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1984

Atmospheric transfer of radiation above an inhomogeneous non-Lambertian reflective ground. II - Computational considerations and results

The theoretical foundation for solution of the three-dimensional radiative transfer problem described in the preceding paper is reviewed. Practical considerations involved in implementing the Fourier transform/Gauss-Seidel method on a minicomputer are discussed, along with derivations of symmetry relations and approximations which can be used to enhance the computational efficiency. Model results for a surface whose albedo varies as a step function are presented and compared with published solutions obtained by using the Monte Carlo method.

Diner, D. J.↗
NASA NTRSDate not supplied

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗
DOE OSTI2017

Towards Highly Scalable Ab Initio Molecular Dynamics (AIMD) Simulations on the Intel Knights Landing Manycore Processor

The Ab Initio Molecular Dynamics (AIMD) method allows scientists to treat the dynamics of molecular and condensed phase systems while retaining a first-principles-based description of their interactions. This extremely important method has tremendous computational requirements, because the electronic Schr¨odinger equation, approximated using Kohn-Sham Density Functional Theory (DFT), is solved at every time step. With the advent of manycore architectures, application developers have a significant amount of processing power within each compute node that can only be exploited through massive parallelism. A compute intensive application such as AIMD forms a good candidate to leverage this processing power. In this paper, we focus on adding thread level parallelism to the plane wave DFT methodology implemented in NWChem. Through a careful optimization of tall-skinny matrix products, which are at the heart of the Lagrange multiplier and nonlocal pseudopotential kernels, as well as 3D FFTs, our OpenMP implementation delivers excellent strong scaling on the latest Intel Knights Landing (KNL) processor. We assess the efficiency of our Lagrange multiplier kernels by building a Roofline model of the platform, and verify that our implementation is close to the roofline for various problem sizes. Finally, we present strong scaling results on the complete AIMD simulation for a 64 water molecules test case, that scales up to all 68 cores of the Knights Landing processor.

Environmental Molecular Sciences Laboratory↗
NASA NTRSDate not supplied

Ab initio ground states of strongly-correlated materials on quantum computers

The accurate first-principles description of strongly-correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving accurate many-body Hamiltonians including strong correlations, representing a subspace of interest of a material, using density functional theory calculations as a starting point. However, the solution of these material-specific models can scale exponentially on classical computers, constituting a challenge. Here we propose that utilizing quantum computers for obtaining the properties of downfolded Hamiltonians yields an accurate description of the ground state properties of strongly-correlated systems, while circumventing the exponential scaling problem. We benchmark the solution of Hubbard-like models obtained through downfolding by utilizing a classical tensor network implementation of variational quantum eigensolvers (VQE), and we reveal a strategy for driving the optimization through a hybrid minimization of the energy and maximization of the overlap with an approximate solution obtained through low-cost computational methods. This results in a reduction of the energy error by orders of magnitude compared to conventional VQE approaches, and allows us to reproduce long-range correlations for the first time. We demonstrate our first-principles approach for diverse strongly-correlated materials, correctly predicting the antiferromagnetic state of one-dimensional cuprate Ca 2 CuO 3 , the excitonic ground state of monolayer WTe2, and the charge-ordered state of correlated metal SrVO 3 . Our efficient computational implementation allows us to simulate large systems with up to 54 qubits and encompassing up to four correlated bands, which is indicative of the complexity that our framework can address.

Antonios M Alvertis↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2023

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗
NASA NTRS1974

Calculation of unsteady transonic aerodynamics for oscillating wings with thickness (computer program)

A computer program has been developed to account approximately for the effects of finite wing thickness in the transonic potential flow over an oscillating wing of finite span. The program is based on the original sonic-box program of Rodemich and Andrew, and accounts for the nonuniform flow caused by finite thickness by application of the local linearization concept. A brief description of each subroutine is given, and the method of input is shown in detail. A sample problem as well as a complete listing of the computer program are presented.

Ruo, S. Y.↗
DOE OSTI2022

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

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

Loschmidt-echo approach to error estimation in Krylov-subspace approximation

The Krylov subspace method is a traditional approach to approximate quantum evolution, allowing us to treat systems with large Hilbert spaces. Despite its popularity, current bounds typically overestimate the error, which translates into more expensive simulation routines. Here, in this paper, we tackle this problem by realizing that the error can be understood as a Loschmidt echo in a one-dimensional (1D) noninteracting tight-binding Hamiltonian. We show that the different time regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error bounds that describe with high precision the actual error in the approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

An improved error analysis of finite element solutions for postbuckled plates

The accurate calculation of stresses at boundaries and interfaces where FEM analysis may be unreliable is presently undertaken by an error analysis that derives a continuous approximation to discrete finite-element data, which can be differentiated to compute continuous stresses for component-failure predictions. An evaluation is conducted of this approximation in the context of the nonlinear PDEs. A novel interpolation formula which is a simple modification of the double Fourier sine series is used to reduce truncation errors near the rectangular plate boundary by means of an 'extended grid'. Results are presented from a FEM solution, a conventional double-Fourier series' continuous approximation, and a solution applying interpolation on the extended grid, which yields superior convergence properties near the plate boundaries.

Sistla, Rajaram↗
NASA NTRS1992

Size-reduction techniques for the determination of efficient aeroservoelastic models

Size-reduction techniques for determining efficient time-domain state-space aeroservoelastic models are presented. Various rational function approximation methods of the unsteady aerodynamic force coefficients are brought to a common motion, emphasizing their differences. Among these, the classic Roger's method is the easier to apply but its resulting number of aerodynamic states is typically equal to or larger than the number of structural states. On the other hand, the minimum-state (MS) method, which typically reduces the number of aerodynamic states by 70 percent or more, requires the solution of an iterative nonlinear least-square solution. The MS computational efforts are reduced significantly when three approximation constraints are applied.

Karpel, Mordechay↗
NASA NTRS1980

Solution of 3-dimensional time-dependent viscous flows. Part 2: Development of the computer code

There is considerable interest in developing a numerical scheme for solving the time dependent viscous compressible three dimensional flow equations to aid in the design of helicopter rotors. The development of a computer code to solve a three dimensional unsteady approximate form of the Navier-Stokes equations employing a linearized block emplicit technique in conjunction with a QR operator scheme is described. Results of calculations of several Cartesian test cases are presented. The computer code can be applied to more complex flow fields such as these encountered on rotating airfoils.

Weinberg, B. C.↗