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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Capturing many-body correlation effects with quantum and classical computing

Theoretical descriptions of excited states of molecular systems in high-energy regimes are crucial for supporting and driving many experimental efforts at light source facilities. However, capturing their complicated correlation effects requires formalisms that provide a hierarchical infrastructure of approximations. These approximations lead to an increased overhead in classical computing methods and, therefore, decisions regarding the ranking of approximations and the quality of results must be made on purely numerical grounds. The emergence of quantum computing methods has the potential to change this situation. Here, in this study, we demonstrate the efficiency of the quantum phase estimator (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled-cluster formulations, which are some of the most accurate methods for states dominated by collective correlation effects.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2018

Reduced scaling CASPT2 using supporting subspaces and tensor hyper-contraction

Here, we present a reduced scaling formulation of the state specific complete active space second-order perturbation method (CASPT2) requiring O( N 4 ) operations and O( N 2 ) memory for a fixed active space, where N is proportional to system size. Motivated by the properties of the Kronecker sum, we introduce the supporting subspace technique (SST), which decomposes the CASPT2 linear equations into two parts: a single-reference MP2 energy term using dressed orbitals, plus a reduced linear system with dimension scaling as O( N 2 ). Together with Laplace quadrature, the SST allows us to reformulate CASPT2 using a MP2 energy computation and Fock builds. By further applying the tensor hyper-contraction (THC) approximation, the MP2-like term can be computed with O( N 4 ) operations, and the remainder can be solved with O( N 3 ) operations using the preconditioned conjugate gradient method. This is the first application of THC in the context of multi-reference methods. We also developed an efficient implementation of the method by utilizing graphical processing units and exploiting spatial sparsity in tensor operations. We benchmark the accuracy of the new method against conventional CASPT2 for reactions in the gas phase. We apply the new method to Menshutkin S N 2 reactions in carbon nanotubes, demonstrating the feasibility of CASPT2 calculations with O(100) atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Learning likelihood ratios with neural network classifiers

The likelihood ratio is a crucial quantity for statistical inference in science that enables hypothesis testing, construction of confidence intervals, reweighting of distributions, and more. Many modern scientific applications, however, make use of data- or simulation-driven models for which computing the likelihood ratio can be very difficult or even impossible. By applying the so-called “likelihood ratio trick,” approximations of the likelihood ratio may be computed using clever parametrizations of neural network-based classifiers. A number of different neural network setups can be defined to satisfy this procedure, each with varying performance in approximating the likelihood ratio when using finite training data. We present a series of empirical studies detailing the performance of several common loss functionals and parametrizations of the classifier output in approximating the likelihood ratio of two univariate and multivariate Gaussian distributions as well as simulated high-energy particle physics datasets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A parallel hierarchical blocked adaptive cross approximation algorithm

This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Slip velocity boundary conditions for the lattice Boltzmann modeling of microchannel flows

Abstract Slip flows in ducts are important in numerous engineering applications, most notably in microchannel flows. Compared to the standard no‐slip Dirichlet condition, the case of slip formulates as a Robin‐type condition for the fluid tangential velocity. Such an increase in mathematical complexity is accompanied by a more challenging numerical transcription. The present work concerns with this topic, addressing the modeling of the slip velocity boundary condition in the lattice Boltzmann method (LBM) applied to steady slow viscous flows inside ducts of nontrivial shapes. As novelty, we extend the newly revised local second‐order boundary (LSOB) Dirichlet fluid flow method [ Philos. Trans. R. Soc. A 378, 20190404 (2020)] to implement the slip velocity condition within the two‐relaxation‐time (TRT) framework. The LSOB follows an in‐node philosophy where its operation principle seeks to explicitly reconstruct the unknown boundary populations in the form of a third‐order accurate Chapman–Enskog expansion, where the wall slip condition is built‐in as a normal Taylor‐type condition. The key point of this approach is that the required first‐ and second‐order momentum derivatives, rather than computed through nonlocal finite difference approximations, are locally determined through a simple local linear algebra procedure, whose formulation is particularly aided by the TRT symmetry argument. To express the obtained derivatives, two approaches are considered, called and , which operate with node and wall variables, respectively. These two formulations are developed to prescribe the physical slip condition over plane and curved walls, including the corners. Their consistency and accuracy characteristics are examined against alternative linkwise strategies to impose the wall slip velocity, such as the kinetic‐based diffusive bounce‐back scheme, the central linear interpolation slip scheme, and the multireflection slip scheme. The several slip schemes are tested over different 3D microchannel configurations, with walls not conforming with the LBM uniform mesh. Numerical tests confirm the advanced accuracy characteristics of the proposed LSOB slip boundary scheme, revealing the added challenge of the wall slip modeling, and that parabolic accuracy is a necessary requirement to reach second‐order accuracy within this problem class.

Silva, Goncalo↗
DOE OSTI2021

Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation

Abstract We consider the problem of learning the level set for which a noisy black-box function exceeds a given threshold. To efficiently reconstruct the level set, we investigate Gaussian process (GP) metamodels. Our focus is on strongly stochastic simulators, in particular with heavy-tailed simulation noise and low signal-to-noise ratio. To guard against noise misspecification, we assess the performance of three variants: (i) GPs with Student- t observations; (ii) Student- t processes (TPs); and (iii) classification GPs modeling the sign of the response. In conjunction with these metamodels, we analyze several acquisition functions for guiding the sequential experimental designs, extending existing stepwise uncertainty reduction criteria to the stochastic contour-finding context. This also motivates our development of (approximate) updating formulas to efficiently compute such acquisition functions. Our schemes are benchmarked by using a variety of synthetic experiments in 1–6 dimensions. We also consider an application of level set estimation for determining the optimal exercise policy of Bermudan options in finance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A reduced basis approach for PDEs on parametrized geometries based on the shifted boundary finite element method and application to a Stokes flow

Here we propose a model order reduction technique integrating the Shifted Boundary Method (SBM) with a POD-Galerkin strategy. This approach allows to deal with complex parametrized domains in an efficient and straightforward way. The impact of the proposed approach is threefold. First, problems involving parametrizations of complex geometrical shapes and/or large domain deformations can be efficiently solved at full-order by means of the SBM. This unfitted boundary method permits to avoid remeshing and the tedious handling of cut cells by introducing an approximate surrogate boundary. Second, the computational effort is reduced by the development of a Reduced Order Model (ROM) technique based on a POD-Galerkin approach. Third, the SBM provides a smooth mapping from the true to the surrogate domain, and for this reason, the stability and performance of the reduced order basis are enhanced. This feature is the net result of the combination of the proposed ROM approach and the SBM. Similarly, the combination of the SBM with a projection-based ROM gives the great advantage of an easy and fast to implement algorithm considering geometrical parametrization with large deformations. The transformation of each geometry to a reference geometry (morphing) is in fact not required. These combined advantages will allow the solution of PDE problems more efficiently. We illustrate the performance of this approach on a number of two-dimensional Stokes flow problems.

42 ENGINEERING↗
DOE OSTI2018

Computational framework for modeling membrane processes without process and solution property simplifications

Accurately modeling membrane processes is critical to evaluating novel process configurations, designing scalable membrane systems, informing process cost estimates, and directing future research. Most membrane process models trade accuracy for computational efficiency by employing simplified approximations of the process (i.e. no salt flux, no pressure drop) and solution properties (i.e. ideal solution, and constant density, viscosity, and diffusivity). Our report introduces a detailed one-dimensional finite difference model for evaluating membrane processes that avoids these common simplifications. We apply this model to quantify the error introduced by these simplifications for case studies of reverse osmosis, osmotically assisted reverse osmosis, forward osmosis, and pressure retarded osmosis. While the magnitude of error introduced by these simplifications is reliant on the case study parameters and specifications, we find that existing model formulations can underestimate or overestimate average water flux by nearly 50% for some membrane processes operating under standard conditions. Lastly we investigate the error introduced by simplified inlet-outlet models that do not solve the governing system of differential equations, and we assess the accuracy of novel inlet-outlet formulations that use a log and geometric mean, instead of the typical arithmetic mean, to represent non-linear water flux profiles.

42 ENGINEERING↗
DOE OSTI2026

Second-order wave excitation forces in WEC-Sim/MOST: Implementation, experimental validation, and code-to-code comparison

Accurate prediction of second-order hydrodynamic loads is essential for floating bodies, including floating offshore wind turbines, wave energy converters, and hybrid wind–wave platforms. These nonlinear effects, arising from both sum- and difference-frequency forcing, are critical for capturing key response characteristics but remain challenging to model efficiently. In this work, we extend the open-source Wave Energy Converter Simulator / MATLAB for Offshore Simulation Tool by implementing second-order wave excitation forces, supporting both the full Quadratic Transfer Function formulation and the Newman approximation. The full Quadratic Transfer Function method is used for all code-to-code comparisons and experimental validation, while the Newman approximation is provided as a computationally lighter alternative. To benchmark the new capability, we perform a code-to-code comparison with OpenFAST and OrcaFlex. We then validate the enhanced model using wave-tank measurements of a 1:96 scale DeepCwind semi-submersible, showing that second-order effects are required to reproduce platform motions. The implementation employs a computationally efficient pre-computation strategy for second-order wave excitation forces, reducing simulation cost while maintaining engineering accuracy. Overall, this work advances the tool as an open-source and versatile tool for modelling floating offshore renewable-energy systems requiring second-order hydrodynamic fidelity.

17 WIND ENERGY↗
DOE OSTI2022

A Dataset of 3D Structural and Simulated Transport Properties of Complex Porous Media

Physical processes that occur within porous materials have wide-ranging applications including - but not limited to - carbon sequestration, battery technology, membranes, oil and gas, geothermal energy, nuclear waste disposal, water resource management. The equations that describe these physical processes have been studied extensively; however, approximating them numerically requires immense computational resources due to the complex behavior that arises from the geometrically-intricate solid boundary conditions in porous materials. Here, we introduce a new dataset of unprecedented scale and breadth, DRP-372: a catalog of 3D geometries, simulation results, and structural properties of samples hosted on the Digital Rocks Portal. The dataset includes 1736 flow and electrical simulation results on 217 samples, which required more than 500 core years of computation. This data can be used for many purposes, such as constructing empirical models, validating new simulation codes, and developing machine learning algorithms that closely match the extensive purely-physical simulation. This article offers a detailed description of the contents of the dataset including the data collection, simulation schemes, and data validation.

3D images↗
DOE OSTI2019

Charge fluctuations from molecular simulations in the constant-potential ensemble

We revisit the statistical mechanics of charge fluctuations in capacitors. In constant-potential classical molecular simulations, the atomic charges of electrode atoms are treated as additional degrees of freedom which evolve in time so as to satisfy the constraint of fixed electrostatic potential for each configuration of the electrolyte. The present work clarifies the role of the overall electroneutrality constraint, as well as the link between the averages computed within the Born–Oppenheimer approximation and that of the full constant-potential ensemble. This allows us in particular to derive a complete fluctuation–dissipation relation for the differential capacitance, that includes a contribution from the charge fluctuations (around the charges satisfying the constant-potential and electroneutrality constraints) also present in the absence of an electrolyte. We provide a simple expression for this contribution from the elements of the inverse of the matrix defining the quadratic form of the fluctuating charges in the energy. We then illustrate numerically the validity of our results, and recover the expected continuum result for an empty capacitor with structureless electrodes at large inter-electrode distances. By considering a variety of liquids between graphite electrodes, we confirm that this contribution to the total differential capacitance is small compared to that induced by the thermal fluctuations of the electrolyte.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Generalized single excitation configuration interaction: an investigation into the impact of the inclusion of non-orthogonality on the calculation of core-excited states

In this paper, we investigate different non-orthogonal generalizations of the configuration interaction with single substitutions (CIS) method for the calculation of core-excited states. Fully non-orthogonal CIS (NOCIS) has been described previously for species with singlet and doublet ground states, and this paper reports the extension to molecules in their triplet ground state. In addition to NOCIS, we present a novel method, one-center NOCIS (1C-NOCIS), for open-shell molecules which is intermediate between NOCIS and the computationally less demanding static exchange approximation (STEX). We explore this hierarchy of spin-pure methods for core excitations of molecules with singlet, doublet, and triplet ground states. We conclude that, while NOCIS provides the best results and preserves the spatial symmetry of the wavefunction, 1C-NOCIS retains much of the accuracy of NOCIS at a dramatically reduced cost. For molecules with closed-shell ground states, STEX and 1C-NOCIS are identical.

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

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Nondegenerate Noise-Resilient Superconducting Qubit

We propose a superconducting qubit based on engineering the first and second harmonics of the Josephson energy and phase relation 𝐸 𝐽⁢1 ⁢cos 𝜑 and 𝐸 𝐽⁢2 ⁢cos 2⁢𝜑. By constructing a circuit such that 𝐸 𝐽⁢2 is negative and |𝐸 𝐽⁢1 | ≪ |𝐸 𝐽⁢2 |, we create a periodic potential with two nondegenerate minima. The qubit, which we dub “harmonium,” is formed from the lowest-energy states of each minimum. Bit-flip protection of the qubit arises due to the localization of each qubit state to their respective minima, while phase-flip protection can be understood by considering the circuit within the Born-Oppenheimer approximation. We demonstrate with time-domain simulations that single- and two-qubit gates can be performed in approximately 100 ns. Finally, we compute the qubit coherence times using numerical diagonalization of the complete circuit in conjunction with state-of-the-art noise models. We estimate out-of-manifold heating times on the order of milliseconds, which can be treated as erasure errors using conventional dispersive readout. We estimate pure-dephasing times on the order of many tens of milliseconds, and bit-flip times on the order of seconds.

quantum error correction↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Nuclear kinetic density from ab initio theory

The nuclear kinetic density is one of many fundamental, nonobservable quantities in density functional theory (DFT) dependent on the nonlocal nuclear density. Often, approximations may be made when computing the density that may result in spurious contributions in other DFT quantities. With the ability to compute the nonlocal nuclear density from ab initio wave functions, it is now possible to estimate effects of such spurious contributions. Herein, we derive the kinetic density using ab initio nonlocal scalar one-body nuclear densities computed within the no-core shell model (NCSM) approach, utilizing two- and three-nucleon chiral interactions as the sole input. The ability to compute translationally invariant nonlocal densities allows us to gauge the impact of the spurious center-of-mass (c.m.) contributions in DFT quantities, such as the kinetic density, and provide ab initio insight into refining energy density functionals. The nonlocal nuclear densities are derived from the NCSM one-body densities calculated in second quantization. We present a review of c.m. contaminated and translationally invariant nuclear densities. We then derive an analytic expression for the kinetic density using these nonlocal densities, producing an ab initio kinetic density. The ground-state nonlocal densities of He 4 , 6 , 8 , C 12 , and O 16 are used to compute the kinetic densities of the aforementioned nuclei. The impact of c.m. removal techniques in the density are discussed and compared to a procedure applied in DFT. The results of this work can be extended to other fundamental quantities in DFT. The use of a general nonlocal density allows for the calculation of fundamental quantities taken as input in theories such as DFT. This allows benchmarking c.m. removal procedures and provides a bridge for comparison between ab initio and DFT many-body techniques.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A Step-Down Test Procedure for Wavelet Shrinkage Using Bootstrapping

Wavelet thresholding (or shrinkage) attempts to remove the noises existing in the signals while preserving inherent pattern characteristics in the reconstruction of true signals. For data-denoising purpose, we present a new wavelet thresholding procedure which employs the step-down testing idea of identifying active contrasts in unreplicated fractional factorial experiments. The proposed method employs bootstrapping methods to a step-down test for thresholding wavelet coefficients. By introducing the concept of a false discovery error rate in testing wavelet coefficients, we shrink the wavelet coefficients with p -values higher than the error rate. The error rate controls the expected proportion of wrongly accepted coefficients among chosen wavelet coefficients. Bootstrap samples are used to approximate the p -value for computational efficiency. We also present some guidelines for selecting the values of hyper-parameters which affect the performance in the step-down thresholding procedure. Based on some common testing signals and an air-conditioner sounds example, the comparison of our proposed procedure with other thresholding methods in the literature is performed. The analytical results show that the proposed procedure has a potential in data-denoising and data-reduction in a variety of signal reconstruction applications.

42 ENGINEERING↗
DOE OSTI2021

srMO-BO-3GP: A sequential regularized multi-objective Bayesian optimization for constrained design applications using an uncertain Pareto classifier

Bayesian optimization (BO) is an efficient and flexible global optimization framework that is applicable to a very wide range of engineering applications. To leverage the capability of the classical BO, many extensions, including multi-objective, multi-fidelity, parallelization, and latent-variable modeling, have been proposed to address the limitations of the classical BO framework. In this work, we propose a novel multi-objective BO formalism, called srMO-BO-3GP, to solve multi-objective optimization problems in a sequential setting. Three different Gaussian processes (GPs) are stacked together, where each of the GPs is assigned with a different task. The first GP is used to approximate a single-objective computed from the multi-objective definition, the second GP is used to learn the unknown constraints, and the third one is used to learn the uncertain Pareto frontier. At each iteration, a multi-objective augmented Tchebycheff function is adopted to convert multi-objective to single-objective, where the regularization with a regularized ridge term is also introduced to smooth the single-objective function. Finally, we couple the third GP along with the classical BO framework to explore the convergence and diversity of the Pareto frontier by the acquisition function for exploitation and exploration. The proposed framework is demonstrated using several numerical benchmark functions, as well as a thermomechanical finite element model for flip-chip package design optimization.

42 ENGINEERING↗