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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Computational analysis of the tryptophan cation radical energetics in peroxidase Compound $\mathrm{I}$

Three well-characterized heme peroxidases (cytochrome c peroxidase = CCP, ascorbate peroxidase = APX, and Leishmania major peroxidase = LMP) all have a Trp residue tucked under the heme stacked against the proximal His heme ligand. The reaction of peroxidases with H 2 O 2 to give Compound I results in the oxidation of this Trp to a cationic radical in CCP and LMP but not in APX. Considerable experimental data indicate that the local electrostatic environment controls whether this Trp or the porphyrin is oxidized in Compound I. Attempts have been made to place the differences between these peroxidases on a quantitative basis using computational methods. These efforts have been somewhat limited by the approximations required owing to the computational cost of using fully solvated atomistic models with well-developed forcefields. This now has changed with available GPU computing power and the associated development of software. Here we employ thermodynamic integration and multistate Bennett acceptance ratio methods to help fine-tune our understanding on the energetic differences in Trp radical stabilization in all three peroxidases. These results indicate that the local solvent structure near the redox active Trp plays a significant role in stabilization of the cationic Trp radical.

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

Discrete Hahn polynomials for numerical solution of two-dimensional variable-order fractional Rayleigh–Stokes problem

The main aim of this paper is to find the numerical solutions of 2D Rayleigh–Stokes problem with the variable-order fractional derivatives in the Riemann–Liouville sense. The presented method is based on collocation procedure in combination with the new operational matrix of the variable-order fractional derivatives, in the Caputo sense, for the discrete Hahn polynomials. The main advantage of the proposed method is obtaining a global approximation for spatial and temporal discretizations, and it reduced the problem to an algebraic system, which is easier to solve. Also, the profit of approximating a continuous function by Hahn polynomials is that for computing the coefficients of the expansion, we only have to compute a summation and the calculation of coefficients is exact. The error bound for the approximate solution is estimated. Finally, we evaluate results of the presented method with other numerical methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Advanced Computing Annual Report 2023

In 2023, advanced computing saw the arrival of Kestrel, the National Renewable Energy Laboratory's (NREL's) newest high-performance computing (HPC) system. Kestrel will accelerate clean energy research at a pace and scale more than five times greater than Eagle, with approximately 44 petaflops of computing power. Kestrel's heterogeneous architecture - which includes both CPU-only and GPU-accelerated nodes - is designed to bring a much greater GPU capacity to EERE workloads compared to Eagle, enabling rapidly advancing applications in artificial intelligence and expanding research in new directions for computing. In Fiscal Year (FY) 2023, 333 projects utilized NREL's HPC system, advancing the U.S. Department of Energy's (DOE's) Office of Energy Efficiency and Renewable Energy (EERE) mission across 13 funding areas. Cross-disciplinary collaboration among researchers yielded more than 800 technical outputs, including 177 peer-reviewed journal articles in FY 2023. All this great work continues to advance the science of energy efficiency and renewable energy. This report highlights research that utilized HPC resources in FY 2023.

advanced computing↗
DOE OSTI2022

Performance Evaluations of 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 towards 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 quantum add and quantum multiply within the given context. 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 performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗
DOE OSTI2021

Parameterization of the Stoner-Wohlfarth model of magnetic hysteresis

The Stoner-Wohlfarth (SW) is the most used model of magnetic hysteresis, but its computation is time-consuming. We approximate piecewise this model by easy-to-compute analytic functions. Overall, our parametrization is suitable for fast quantitative evaluations and fitting experimental data, which we exemplify. Applicability of this parametrization is as broad as that of the SW model, which can be extended to include more parameters.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Analysis of picosecond coherent anti-Stokes Raman spectra for gas-phase diagnostics

We present a hybrid frequency- and time-domain solution, applicable to the case of picosecond coherent anti-Stokes Raman scattering (CARS), for gas-phase diagnostics. A solution has been derived based on both physical arguments and four-wave mixing equations for picosecond CARS, with pulse durations that are comparable to the dephasing time scale for gas-phase Raman coherence—a regime where commonly employed solutions for impulsive (femtosecond) or cw (nanosecond) pump/Stokes forcing are not strictly valid. We present the ps-CARS spectrum in the form of incoherent sums of CARS intensity spectra, calculated from the fundamental solution for impulsive pump/Stokes Raman preparation. The solution was examined for temperatures from 1000–3000 K, for four plausible experimental configurations, with laser pulse durations of 50–150 ps, and probe pulse delays from −20 to 240 ps. Approximations based on cw and impulsive pump/Stokes preparation to fit picosecond CARS spectra at atmospheric pressure were examined and the relative thermometric accuracy and computational cost of these approximations were quantified for the case of a zero nonresonant CARS contribution, and a nonresonant susceptibility equal to 10% of the Raman-resonant value at the N 2 bandhead. The nanosecond CARS approximation can result in large fitting errors when the probe pulse time delay is less than the probe pulse duration. Errors as large as 10–20% are observed in the fit temperatures for a zero picosecond probe pulse delay, when the nonresonant background is neglected, largely due to an inability of the time-independent cw model to capture transient frequency spread dephasing effects at the Q -branch bandhead. The inclusion of a nonresonant background results in 40–60% thermometry errors with a nanosecond model at a zero-probe delay. Time-dependent impulsive calculations used for femtosecond CARS better approximate the structure of the N 2 bandhead, reducing temperature fitting errors to 5–10% at a short probe pulse delay. The impulsive approximation results in errors up to 10% at intermediate probe pulse delays, where the coherence of the pump and probe pulses leads to multiple terms in the picosecond CARS solution. Both approximations improve as the probe pulse delay exceeds the probe duration. The nanosecond approximation results in a 2–3% error, while the impulsive model results in differences of less than 1% in some cases. Fits to experimental data obtained using short, ∼60ps pulses at a zero probe time delay and longer 100 ps pulses at a substantial 200 ps delay are presented with accuracies of 1–3% in the fit temperature.

Kearney, Sean P.↗
DOE OSTI2021

Combinatorial Algorithms in Scientific Computing

We provide the final report for this grant, detailing the publications, software produced, students trained who have joined the DOE workforce, and the impact our work has had on computational mathematics and related disciplines.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition

In this paper, we consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine learning. The dth-order empirical moment tensor of a set of p observations of n variables is a symmetric d-way tensor. Our goal is to nd a low-rank tensor approximation comprising r $\ll$ p symmetric outer products. The challenge is that forming the empirical moment tensor costs O(pn d ) operations and O(n d ) storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs O(n d ) per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using O(pnr) operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A computationally-efficient method for flamelet calculations

A new open-source code for the simulation of the diffusion flamelet equations is proposed. Emphasis is placed on using an approximate Jacobian to reduce the computational cost of the matrix operations. Performance of the proposed solvers is tested by performing flamelet calculations with kinetic mechanisms of varying sizes. For the unity Lewis number equations, the present iterative Newton solver using an approximate Jacobian greatly outperforms direct Newton solvers using exact Jacobians. The computation cost scales linearly with the number of species, leading to a reduction in solution times by two orders of magnitude for mechanisms containing thousands of species. The applicability of the Jacobian approximations to the solution of the non-unity Lewis number flamelet equations is assessed. The approximations are generally inadequate to solve the full non-unity Lewis number equations but can be used in some applications depending on the balance of terms in the flamelet equations. As an example, the flamelet solver is applied to the study of sooting tendencies in laminar co-flow diffusion flames where modified non-unity Lewis number flamelet equations, previously shown to accurately reproduce experimentally-measured Yield Sooting Indices (YSI), are solved. Here, the accelerated flamelet solver is well suited for sensitivity analysis and uncertainty quantification with large detailed kinetic mechanisms, tasks for which the computational cost was previously prohibitive.

42 ENGINEERING↗
DOE OSTI2020

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗
DOE OSTI2024

Enhanced Estimation of Quantum Properties with Common Randomized Measurements

We present a technique for enhancing the estimation of quantum state properties by incorporating approximate prior knowledge about the quantum state. This consists in performing randomized measurements on a quantum processor and comparing the results with those obtained from a classical computer that stores an approximation of the quantum state. We provide unbiased estimators for expectation values of multicopy observables and present performance guarantees in terms of variance bounds that depend on the prior knowledge accuracy. We demonstrate the effectiveness of our approach through experimental and numerical examples detecting mixed-state entanglement, and estimating polynomial approximations of the von Neumann entropy and state fidelities. Published by the American Physical Society 2024

Physics↗
DOE OSTI2018

An adaptive local reduced basis method for solving PDEs with uncertain inputs and evaluating risk

Many physical systems are modeled using partial differential equations (PDEs) with uncertain or random inputs. For such systems, naively propagating a fixed number of samples of the input probability law (or an approximation thereof) through the PDE is often inadequate to accurately quantify the "risk" associated with critical system responses. In this paper, we develop a goal-oriented, adaptive sampling and local reduced basis approximation for PDEs with random inputs. Our method determines a set of samples and an associated (implicit) Voronoi partition of the parameter domain on which we build local reduced basis approximations of the PDE solution. The samples are selected in an adaptive manner using an a posteriori error indicator. A notable advantage of the proposed approach is that the computational cost of the approximation during the adaptive process remains constant. We provide theoretical error bounds for our approximation and numerically demonstrate the performance of our method when compared to widely used adaptive sparse grid techniques. In addition, we tailor our approach to accurately quantify the risk of quantities of interest that depend on the PDE solution. We demonstrate our method on an advection-diffusion example and a Helmholtz example. Keywords: stochastic partial differential equation, adaptive sampling, reduced basis, a posteriori error estimation, coherent risk measure, conditional value-at-risk.

42 ENGINEERING↗
DOE OSTI2019

Collaborative Computing Center (C3)

High Performance Computing (HPC) compliments theory and informs experimental processes in support of NE programs Big Data Analytics capabilities aid in the discovery of science-relevant relationships in data The C520 staff is made up of 19 Staff – Engineering, Basic Sciences, Computer Science, Statistics, Data Science, Technology Computer Computing Hardware Operations include: Falcon is fully utilized with an average 3X over subscription of waiting jobs over the past year Lemhi recently deployed in Feb 2019 Sawtooth procurement underway with Fall 2019 delivery 509 HPC accounts, lab, industry, university users 1.2 PB disk storage, 1.0 PB scratch storage, 0.8 PB disaster recovery storage Collaborative Computing Center nearing completion with approximately 200 staff -- Office space and 200 racks -- Data Center space for computer equipment

99 GENERAL AND MISCELLANEOUS↗
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.

36 MATERIALS SCIENCE↗