Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Solving the Bethe-Salpeter equation on a subspace: Approximations and consequences for low-dimensional materials

It is well known that the ambient environment can dramatically renormalize the quasiparticle gap and exciton binding energies in low-dimensional materials, but the effect of the environment on the energy splitting of the spin-singlet and spin-triplet exciton states is less understood. A prominent effect is the renormalization of the exciton binding energy and optical strength (and hence the optical spectrum) through additional screening of the direct Coulomb term describing the attractive electron-hole interaction in the kernel of the Bethe-Salpeter equation. The repulsive exchange interaction responsible for the singlet-triplet splitting, on the other hand, is unscreened within formal many-body perturbation theory. However, Benedict argued that in practical calculations restricted to a subspace of the full Hilbert space, the exchange interaction should be appropriately screened by states outside of the subspace, the so-called S approximation [L. X. Benedict, Phys. Rev. B 66, 193105 (2002)PRBMDO0163-182910.1103/PhysRevB.66.193105]. Here, we systematically explore the accuracy of the S approximation for different confined systems, including a molecule and heterostructures of semiconducting and metallic layered materials. We show that the S approximation is actually exact in the limit of small exciton binding energies (i.e., small direct term) and can be used to significantly accelerate convergence of the exciton energies with respect to the number of empty states, provided that a particular effective screening consistent with the conventional Tamm-Dancoff approximation is employed. We further find that the singlet-triplet splitting in the energy of the excitons is largely unaffected by the external dielectric environment for most quasi-two-dimensional materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Approximate two-body generating Hamiltonian for the particle-hole Pfaffian wave function

We present two two-body Hamiltonians that approximate the exact particle-hole Pfaffian wave function with their ground states for all the system sizes where this wave function has been numerically constructed to date. The approximate wave functions have high overlap with the original and reproduce well the low-lying entanglement spectrum and structure factor. The approximate generating Hamiltonians are obtained by an optimization procedure where three to four pseudopotentials are varied in the neighbourhood of second Landau level Coulomb interaction or of a noninteracting model. They belong to a finite region in the variational space of Hamiltonians where each point approximately generates the particle-hole Pfaffian. Here we diagonalize the identified Hamiltonians for up to 20 electrons and find that for them the particle-hole Pfaffian shift appears energetically more favorable. The possibility to interpret the data in terms of composite fermions is discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2021

State densities of heavy nuclei in the static-path plus random-phase approximation

We report that nuclear state densities are important inputs to statistical models of compound-nucleus reactions. State densities are often calculated with self-consistent mean-field approximations that do not include important correlations and must be augmented with empirical collective enhancement factors. Here, we benchmark the static-path plus random-phase approximation (SPA + RPA) to the state density in a chain of samarium isotopes 148–155 Sm against exact results (up to statistical errors) obtained with the shell-model Monte Carlo (SMMC) method. The SPA + RPA method incorporates all static fluctuations beyond the mean field together with small-amplitude quantal fluctuations around each static fluctuation. Using a pairing plus quadrupole interaction, we show that the SPA + RPA state densities agree well with the exact SMMC densities for both the even- and odd-mass isotopes. For the even-mass isotopes, we also compare our results with mean-field state densities calculated with the finite-temperature Hartree-Fock-Bogoliubov (HFB) approximation. We find that the SPA + RPA repairs the deficiencies of the mean-field approximation associated with broken rotational symmetry in deformed nuclei and with the violation of particle-number conservation in the pairing condensate. In particular, in deformed nuclei the SPA + RPA reproduces the rotational enhancement of the state density relative to the mean-field state density.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗
DOE OSTI2020

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An under-approximation of entropy for elemental multiconfigurational ground state electronic structures

A combinatorial approach has been applied to the allowable permutations of quantum electronic configurations under the constraints of Hund's rule for established ground state configurations toward an under-approximation of electronic structure entropy. Combined with a previously reported over-approximation, the approximations are used in conjunction in an attempt to bracket the upper and lower entropy limits for multiconfigurational ground state electronic structure entropy and compared to known standard molar entropies for the elements. This formality has been used for the application of a classical statistical mechanics methodology to be applied to the discrete sets of quantum mechanical states of Pu in order to calculate orbital occupancies in Pu's multiconfigurational ground state. Without consideration of the relative energies of various possible electronic configurations contributing to the multiconfigurational ground state, the calculations are performed under a general energy degeneracy assumption weighted to the number of permutations for specific configurations. The number of configurations assumed to significantly contribute is gradually constrained in order to approach a low-order approximation of orbital occupancies in Pu that are then compared to experimental and other calculated results from the literature.

Beaux, II, Miles F. (ORCID:000000032192626X)↗
DOE OSTI2022

Statistics of Green's functions on a disordered Cayley tree and the validity of forward scattering approximation

The accuracy of the forward scattering approximation for two-point Green's functions of the Anderson localization model on the Cayley tree is studied. A relationship between the moments of the Green's function and the largest eigenvalue of the linearized transfer-matrix equation is proved in the framework of the supersymmetric functional-integral method. The new large-disorder approximation for this eigenvalue is derived and its accuracy is established. Using this approximation the probability distribution of the two-point Green's function is found and compared with that in the forward scattering approximation (FSA). It is shown that FSA overestimates the role of resonances and thus the probability for the Green's function to be significantly larger than its typical value. The error of FSA increases with increasing the distance between points in a two-point Green's function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks

There has been much recent interest in designing symmetry-aware neural networks (NNs) exhibiting relaxed equivariance. Such NNs aim to interpolate between being exactly equivariant and being fully flexible, affording consistent performance benefits. In a separate line of work, certain structured parameter matrices -- those with displacement structure, characterized by low displacement rank (LDR) -- have been used to design small-footprint NNs. Displacement structure enables fast function and gradient evaluation, but permits accurate approximations via compression primarily to classical convolutional neural networks (CNNs). In this work, we propose a general framework -- based on a novel construction of symmetry-based structured matrices -- to build approximately equivariant NNs with significantly reduced parameter counts. Our framework integrates the two aforementioned lines of work via the use of so-called Group Matrices (GMs), a forgotten precursor to the modern notion of regular representations of finite groups. GMs allow the design of structured matrices -- resembling LDR matrices -- which generalize the linear operations of a classical CNN from cyclic groups to general finite groups and their homogeneous spaces. We show that GMs can be employed to extend all the elementary operations of CNNs to general discrete groups. Further, the theory of structured matrices based on GMs provides a generalization of LDR theory focussed on matrices with cyclic structure, providing a tool for implementing approximate equivariance for discrete groups. We test GM-based architectures on a variety of tasks in the presence of relaxed symmetry. We report that our framework consistently performs competitively compared to approximately equivariant NNs, and other structured matrix-based compression frameworks, sometimes with a one or two orders of magnitude lower parameter count.

Samudre, Ashwin↗
DOE OSTI2023

Introducing the embedded random phase approximation: H 2 dissociative adsorption on Cu(111) as an exemplar

The random phase approximation (RPA) as a means of treating electron correlation recently has been shown to outperform standard density functional theory (DFT) approximations in a variety of cases. However, the computational cost of the RPA is substantially more than DFT, especially when aiming to study extended surfaces. Properly accounting for sufficient surface ensemble size, Brillouin zone sampling, and vacuum separation of periodic images in standard periodic-planewave-based DFT code raises the cost to achieve converged results. Here, we show that sub-system embedding schemes enable use of the RPA for modeling heterogeneous reactions at reduced computational cost. Further, we explore two different embedded RPA (emb-RPA) approaches, periodic emb-RPA and cluster emb-RPA. We use the (experimentally and theoretically) well-studied H 2 dissociative adsorption on Cu(111) as our exemplar, and first perform full periodic RPA calculations as a benchmark. The full RPA results match well the semi-empirical barrier fit to experimental observables and others derived from high-level computations, e.g., from recent embedded n-electron valence second order perturbation theory [Zhao et al., J. Chem. Theory Comput. 16(11), 7078–7088 (2020)] and quantum Monte Carlo [Doblhoff-Dier et al., J. Chem. Theory Comput. 13(7), 3208–3219 (2017)] simulations. Among the two emb-RPA approaches tested, the cluster emb-RPA accurately reproduces the energy profile (maximum error of 50 meV along the reaction pathway) while reducing the computational cost by approximately two orders of magnitude. We therefore expect that the embedded cluster approach will enable wider RPA implementation in heterogeneous catalysis.

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

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗
DOE OSTI2025

Simplifying activations with linear approximations in neural networks

A key step in Neural Networks is activation. Among the different types of activation functions, sigmoid, tanh, and others involve the usage of exponents for calculation. From a hardware perspective, exponential implementation implies the usage of Taylor series or repeated methods involving many addition, multiplication, and division steps, and as a result are power-hungry and consume many clock cycles. We implement a piecewise linear approximation of the sigmoid function as a replacement for standard sigmoid activation libraries. This approach provides a practical alternative by leveraging piecewise segmentation, which simplifies hardware implementation and improves computational efficiency. In this paper, we detail piecewise functions that can be implemented using linear approximations and their implications for overall model accuracy and performance gain. Our results show that for the DenseNet, ResNet, and GoogLeNet architectures, the piecewise linear approximation of the sigmoid function provides faster execution times compared to the standard TensorFlow sigmoid implementation while maintaining comparable accuracy. Specifically, for MNIST with DenseNet, accuracy reaches 99.91% (Piecewise) vs. 99.97% (Base) with up to 1.31x speedup in execution time. For CIFAR-10 with DenseNet, accuracy improves to 98.97% (Piecewise) vs. 99.40% (Base) while achieving 1.24x faster execution. Similarly, for CIFAR-100 with DenseNet, the accuracy is 97.93% (Piecewise) vs. 98.39% (Base), with a 1.18x execution time reduction. These results confirm the proposed method’s capability to efficiently process large-scale datasets and computationally demanding tasks, offering a practical means to accelerate deep learning models, including LSTMs, without compromising accuracy.

Activation function↗
DOE OSTI2022

Approximation rates of DeepONets for learning operators arising from advection–diffusion equations

Here we present the analysis of approximation rates of operator learning in Chen and Chen (1995) and Lu et al. (2021), where continuous operators are approximated by a sum of products of branch and trunk networks. In this work, we consider the rates of learning solution operators from both linear and nonlinear advection–diffusion equations with or without reaction. We find that the approximation rates depend on the architecture of branch networks as well as the smoothness of inputs and outputs of solution operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Hole–hole Tamm–Dancoff-approximated density functional theory: A highly efficient electronic structure method incorporating dynamic and static correlation

The study of photochemical reaction dynamics requires accurate as well as computationally efficient electronic structure methods for the ground and excited states. While time-dependent density functional theory (TDDFT) is not able to capture static correlation, complete active space self-consistent field methods neglect much of the dynamic correlation. Hence, inexpensive methods that encompass both static and dynamic electron correlation effects are of high interest. Here, we revisit hole–hole Tamm–Dancoff approximated (hh-TDA) density functional theory for this purpose. The hh-TDA method is the hole–hole counterpart to the more established particle–particle TDA (pp-TDA) method, both of which are derived from the particle–particle random phase approximation (pp-RPA). In hh-TDA, the N-electron electronic states are obtained through double annihilations starting from a doubly anionic (N+2 electron) reference state. In this way, hh-TDA treats ground and excited states on equal footing, thus allowing for conical intersections to be correctly described. Furthermore, the treatment of dynamic correlation is introduced through the use of commonly employed density functional approximations to the exchange-correlation potential. Additionally, we show that hh-TDA is a promising candidate to efficiently treat the photochemistry of organic and biochemical systems that involve several low-lying excited states—particularly those with both low-lying ππ* and nπ* states where inclusion of dynamic correlation is essential to describe the relative energetics. In contrast to the existing literature on pp-TDA and pp-RPA, we employ a functional-dependent choice for the response kernel in pp- and hh-TDA, which closely resembles the response kernels occurring in linear response and collinear spin-flip TDDFT.

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

Electronic structure and optical properties of quantum crystals from first principles calculations in the Born–Oppenheimer approximation

In this work, we develop a formalism to accurately account for the renormalization of the electronic structure due to quantum and thermal nuclear motions within the Born–Oppenheimer approximation. We focus on the fundamental energy gap obtained from electronic addition and removal energies from quantum Monte Carlo calculations in either the canonical or grand-canonical ensembles. The formalism applies as well to effective single electron theories such as those based on density functional theory. We show that the electronic (Bloch) crystal momentum can be restored by marginalizing the total electron–ion wave function with respect to the nuclear equilibrium distribution, and we describe an explicit procedure to establish the band structure of electronic excitations for quantum crystals within the Born–Oppenheimer approximation. Based on the Kubo–Greenwood equation, we discuss the effects of nuclear motion on optical conductivity. Our methodology applies to the low temperature regime where nuclear motion is quantized and, in general, differs from the semi-classical approximation. We apply our method to study the electronic structure of C2/c-24 crystalline hydrogen at 200 K and 250 GPa and discuss the optical absorption profile of hydrogen crystals at 200 K and carbon diamond at 297 K.

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

Layer-dependent topological phase in a two-dimensional quasicrystal and approximant

The electronic and topological properties of materials are derived from the interplay between crystalline symmetry and dimensionality. Simultaneously introducing “forbidden” symmetries via quasiperiodic ordering with low dimensionality into a material system promises the emergence of new physical phenomena. Here, we isolate a two-dimensional (2D) chalcogenide quasicrystal and approximant, and investigate their electronic and topological properties. The 2D layers of the materials with a composition close to Ta 1.6 Te, derived from a layered transition metal dichalcogenide, are isolated with standard exfoliation techniques, and investigated with electron diffraction and atomic resolution scanning transmission electron microscopy. Density functional theory calculations and symmetry analysis of the large unit cell crystalline approximant of the quasicrystal, Ta 21 Te 13 , reveal the presence of symmetry-protected nodal crossings in the quasicrystalline and approximant phases, whose presence is tunable by layer number. Our study provides a platform for the exploration of physics in quasicrystalline, low-dimensional materials and the interconnected nature of topology, dimensionality, and symmetry in electronic systems.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Spatial non-locality of electronic correlations beyond GW approximation

The question of spatial locality of electronic correlations beyond GW approximation is one of the central issues of the famous combination of GW and dynamical mean field theory, GW+DMFT. In this study, the above question is addressed directly (for the first time) by performing calculations with and without assumption of locality of the corresponding diagrams. For this purpose we use sc(GW+G3W2) approach where the higher order part (G3W2) is evaluated with fully momentum dependent Green's function G and screened interaction W and with "local" variant, where the single site approximation is assumed for both G and W. For all three materials studied in this work (NiO, α-Ce, LiFeAs), we have found the spatial non-locality effects to be strong. For NiO and LiFeAs they, in fact, are decisive for the proper evaluation of vertex corrections. The results of this study have direct impact on our understanding of approximations made in practical implementations of GW+DMFT method, where all diagrams beyond GW (DMFT part) are assumed to be local. Taking into account the fact that the first diagrams beyond GW represent the most important contribution also in GW+DMFT calculations, we conclude that the basic assumption of GW+DMFT, namely the locality of diagrams evaluated in the DMFT part, is not as good as it is believed to be.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗