Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “subspace method”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Nonlinear manifold-based reduced order model

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations, in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a low-dimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physicsinformed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LSROMs. Our method takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers’ equations. A speedup of up to 2.6 for 1D Burgers’ and a speedup of 11.7 for 2D Burgers’ equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique. Finally, a posteriori error bounds for the NM-ROMs are derived that take account of the hyper-reduced operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a low-dimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our method takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique. Lastly, a posteriori error bounds for the NM-ROMs are derived that take account of the hyper-reduced operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Real-space solution to the electronic structure problem for nearly a million electrons

We report a Kohn–Sham density functional theory calculation of a system with more than 200 000 atoms and 800 000 electrons using a real-space high-order finite-difference method to investigate the electronic structure of large spherical silicon nanoclusters. Our system of choice was a 20 nm large spherical nanocluster with 202 617 silicon atoms and 13 836 hydrogen atoms used to passivate the dangling surface bonds. To speed up the convergence of the eigenspace, we utilized Chebyshev-filtered subspace iteration, and for sparse matrix–vector multiplications, we used blockwise Hilbert space-filling curves, implemented in the PARSEC code. For this calculation, we also replaced our orthonormalization + Rayleigh–Ritz step with a generalized eigenvalue problem step. We utilized all of the 8192 nodes (458 752 processors) on the Frontera machine at the Texas Advanced Computing Center. We achieved two Chebyshev-filtered subspace iterations, yielding a good approximation of the electronic density of states. Our work pushes the limits on the capabilities of the current electronic structure solvers to nearly 106 electrons and demonstrates the potential of the real-space approach to efficiently parallelize large calculations on modern high-performance computing platforms.

Chemistry↗
DOE OSTI2020

Data-Driven Operator Theoretic Methods for Global Phase Space Learning

In this work, we propose to apply the recently developed Koopman operator techniques to explore the global phase space of a nonlinear system from time-series data. In particular, we address the problem of identifying various invariant subsets of a phase space from the spectral properties of the associated Koopman operator constructed from time-series data. Moreover, in the case when the system evolution is known locally in various invariant subspaces, then a phase space stitching result is proposed that can be applied to identify a global Koopman operator. A biological system, bistable toggle switch and a second-order nonlinear system example are considered to illustrate the proposed results. The construction of this global Koopman operator is very helpful in experimental works as multiple experiments can't be run at the same time starting from several initial conditions.

Nandanoori, Sai Pushpak↗
DOE OSTI2022

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Nonlinear manifold reduced order model

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a lowdimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our software takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique.

Choi, Youngsoo↗
DOE OSTI2023

Dynamical downfolding for localized quantum states

We introduce an approach to treat localized correlated electronic states in the otherwise weakly correlated host medium. Here, the environment is dynamically downfolded on the correlated subspace. It is captured via renormalization of one and two quasiparticle interaction terms which are evaluated using many-body perturbation theory. We outline the strategy on how to take the dynamical effects into account by going beyond the static limit approximation. Further, we introduce an efficient stochastic implementation that enables treating the host environment with a large number of electrons at a minimal computational cost. For a small explicitly correlated subspace, the dynamical effects are critical. We demonstrate the methodology by reproducing optical excitations in the negatively charged NV center defect in diamond, that agree with experimental results.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

N 5 -Scaling Excited-State-Specific Perturbation Theory

In this paper, we show that by working in a basis similar to that of the natural transition orbitals and using a modified zeroth-order Hamiltonian, the cost of a recently introduced perturbative correction to excited-state mean field theory can be reduced from seventh to fifth order in the system size. The (occupied) 2 (virtual) 3 asymptotic scaling matches that of ground-state second-order Møller-Plesset theory but with a significantly higher prefactor because the bottleneck is iterative: it appears in the Krylov-subspace-based solution of the linear equation that yields the first-order wave function. Here, we discuss the details of the modified zeroth-order Hamiltonian we use to reduce the cost and the automatic code generation process we used to derive and verify the cost scaling of the different terms. Overall, we find that our modifications have little impact on the method's accuracy, which remains competitive with singles and doubles equation-of-motion coupled cluster.

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

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗
DOE OSTI2022

Anderson acceleration stability in NDA-accelerated k-eigenvalue problems

Anderson acceleration (AA) has been used to improve the stability and convergence rate of multiphysics iterative methods for reactor analysis. Most applications studied assume a tightly converged solution for the different physics problems, and AA is usually applied to state variables like temperature, density, and heat generation rate. In this paper, we study the theoretical performance of AA in NDA-accelerated k-eigenvalue problems. The problems and algorithms studied are simplified from the coupled iteration scheme adopted by MPACT and many other high-fidelity whole-core reactor codes. Compared to previous analyses of AA for these iteration schemes, we study the case with a partially converged neutronics solution and possibly partially converged nonlinear diffusion acceleration (NDA)/coarse mesh finite difference (CMFD) solutions. We observe that the performance of the iteration scheme with AA is very sensitive to the initial guess and is affected by the partially converged CMFD solutions. When the NDA solution is fully converged, using AA cannot achieve the optimal convergence rate in large-sized problems. Conversely, if the NDA solution is partially converged, the iteration scheme with AA can diverge or converge extremely slowly. It is found that the loss of robustness for AA is due to the fact that it is applied to the iterative subspace of state variables rather than the fundamental unknowns of the governing equations. To improve the robustness, the scalar flux should also be considered in the implementation of AA. After considering the residuals of flux, we observe that the stability is regardless of the partial convergence of NDA solutions. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Theory of quantum circuits with Abelian symmetries

Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed-matter theory and quantum thermodynamics. However, despite their widespread use, fundamental properties of such circuits are not well understood. Recently, it was found that generic unitaries respecting a global symmetry cannot be realized, even approximately, using gates that respect the same symmetry. This observation raises important open questions: What unitary transformations can be realized with k -local gates that respect a global symmetry? In other words, in the presence of a global symmetry, how does the locality of interactions constrain the possible time evolution of a composite system? In this work, we address these questions for the case of Abelian (commutative) symmetries and develop constructive methods for synthesizing circuits with such symmetries. Remarkably, as a corollary, we find that, while the locality of interactions still imposes additional constraints on realizable unitaries, certain restrictions observed in the case of non-Abelian symmetries do not apply to circuits with Abelian symmetries. For instance, in circuits with a general non-Abelian symmetry such as SU ( d ) , the unitary realized in a subspace with one irreducible representation (charge) of the symmetry dictates the realized unitaries in multiple other sectors with inequivalent representations of the symmetry. Furthermore, in certain sectors, rather than all unitaries respecting the symmetry, the realizable unitaries are the symplectic or orthogonal subgroups of this group. We prove that none of these restrictions appears in the case of Abelian symmetries. This result suggests that global non-Abelian symmetries may affect the thermalization of quantum systems in ways not possible under Abelian symmetries. Published by the American Physical Society 2024

Marvian, Iman↗
DOE OSTI2020

Physical, numerical, and computational challenges of modeling neutrino transport in core-collapse supernovae

The proposal that core collapse supernovae are neutrino driven is still the subject of active investigation more than 50 years after the seminal paper by Colgate and White. The modern version of this paradigm, which we owe to Wilson, proposes that the supernova shock wave is powered by neutrino heating, mediated by the absorption of electron-flavor neutrinos and antineutrinos emanating from the proto-neutron star surface, or neutrinosphere. Neutrino weak interactions with the stellar core fluid, the theory of which is still evolving, are flavor and energy dependent. The associated neutrino mean free paths extend over many orders of magnitude and are never always small relative to the stellar core radius. Thus, neutrinos are never always fluid like. Instead, a kinetic description of them in terms of distribution functions that determine the number density of neutrinos in the six-dimensional phase space of position, direction, and energy, for both neutrinos and antineutrinos of each flavor, or in terms of angular moments of these neutrino distributions that instead provide neutrino number densities in the four-dimensional phase-space subspace of position and energy, is needed. In turn, the computational challenge is twofold: (i) to map the kinetic equations governing the evolution of these distributions or moments onto discrete representations that are stable, accurate, and, perhaps most important, respect physical laws such as conservation of lepton number and energy and the Fermi–Dirac nature of neutrinos and (ii) to develop efficient, supercomputer-architecture-aware solution methods for the resultant nonlinear algebraic equations. In this review, we present the current state of the art in attempts to meet this challenge.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An adaptive adversarial domain adaptation approach for corn yield prediction

Recently, statistical machine learning and deep learning methods have been widely explored for corn yield prediction. Though successful, machine learning models generated within a specific spatial domain often lose their validity when directly applied to new regions. To address this issue, we designed an unsupervised adaptive domain adversarial neural network (ADANN). Specifically, through domain adversarial training, the ADANN model reduced the impact of domain shift by projecting data from different domains into the same subspace. Also, the ADANN model was designed to be trained in an adaptive way, which guaranteed the model can learn the domain-invariant features and perform accurate yield prediction simultaneously. Informative variables including time-series vegetation indices and sequential weather observations were first collected from multiple data sources and aggregated to the county level. Then, we trained the ADANN model with the extracted features and corresponding reported county-level corn yield from the U.S. Department of Agriculture (USDA). Finally, the trained model was evaluated in four testing years 2016–2019. The U.S. corn belt was used as the study area and counties under study were grouped into two diverse ecological regions. Overall, the experimental results showed that the developed ADANN model had better performance than three other state-of-the-art machine learning models in both local experiments (train and test in the same region) and transfer experiments (train and test in different regions). As the first study using adversarial learning for crop yield prediction, this research demonstrates a novel solution for improving model transferability on crop yield prediction.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Parametric model-order reduction for radiation transport using multi-resolution proper orthogonal decomposition

For parametric high-fidelity simulations, it is often desirable to utilize a reduced-order model (ROM) to emulate, at a reduced computational cost, parametric solutions of the governing partial differential equations (PDEs) for unseen parameter values. One commonly employed option is to utilize a data-driven, projection-based ROM supplemented with subspace identification via proper orthogonal decomposition (POD). POD discovers the ROM subspace by computing the singular value decomposition (SVD) of a set of training data from the full-order model (FOM). In streaming-dominated radiation transport simulations with localized sources, solutions often greatly vary over the spatial domain by many orders of magnitude. In such cases, machine-precision arithmetic can be insufficient to obtain an accurate SVD, resulting in a poorly performing ROM. We present a method called multiresolution POD (mrPOD) that mitigates these inaccuracies. The mrPOD method works by decomposing the spatial domain into regions and performing proper orthogonal decomposition on the training dataset separately in each region. In conclusion, mrPOD is tested on single energy group and multigroup atmospheric shielding transport problems and is shown to outperform classic POD.

42 ENGINEERING↗
DOE OSTI2022

Learning infinite-horizon average-reward restless multi-action bandits via index awareness

We consider the online restless bandits with average-reward and multiple actions, where the state of each arm evolves according to a Markov decision process (MDP), and the reward of pulling an arm depends on both the current state of the corresponding MDP and the action taken. Since finding the optimal control is typically intractable for restless bandits, existing learning algorithms are often computationally expensive or with a regret bound that is exponential in the number of arms and states. In this paper, we advocate \textit{index-aware reinforcement learning} (RL) solutions to design RL algorithms operating on a much smaller dimensional subspace by exploiting the inherent structure in restless bandits. Specifically, we first propose novel index policies to address dimensionality concerns, which are provably optimal. We then leverage the indices to develop two low-complexity index-aware RL algorithms, namely, (i) GM-R2MAB, which has access to a generative model; and (ii) UC-R2MAB, which learns the model using an upper confidence style online exploitation method. We prove that both algorithms achieve a sub-linear regret that is only polynomial in the number of arms and states. A key differentiator between our algorithms and existing ones stems from the fact that our RL algorithms contain a novel exploitation that leverages our proposed provably optimal index policies for decision-makings.

Xiong, Guojun↗
DOE OSTI2020

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗