Search NASA⌕ Search

SEARCH · Search NASA

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 271 records · Page 15

A Stochastic Covariance Shrinkage Approach in Ensemble Transform Kalman Filtering

The Ensemble Kalman Filters (EnKF) employ a Monte-Carlo approach to represent covariance information, and are affected by sampling errors in operational settings where the number of model realizations is much smaller than the model state dimension. To alleviate the effects of these errors EnKF relies on model-specific heuristics such as covariance localization, which takes advantage of the spatial locality of correlations among the model variables. This work proposes an approach to alleviate sampling errors that utilizes a locally averaged-in-time dynamics of the model, described in terms of a climatological covariance of the dynamical system. We use this covariance as the target matrix in covariance shrinkage methods, and develop a stochastic covariance shrinkage approach where synthetic ensemble members are drawn to enrich both the ensemble subspace and the ensemble transformation. We additionally provide for a way in which this methodology can be localized similar to the state-of-the-art LETKF method, and that for a certain model setup, our methodology significantly outperforms it.

54 ENVIRONMENTAL SCIENCES↗

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A bidirectional coupling procedure applied to multiscale respiratory modeling

In this study, we present a novel multiscale computational framework for efficiently linking multiple lower-dimensional models describing the distal lung mechanics to imaging-based 3D computational fluid dynamics (CFDs) models of the upper pulmonary airways in order to incorporate physiologically appropriate outlet boundary conditions. The framework is an extension of the modified Newton’s method with nonlinear Krylov accelerator developed by Carlson and Miller [1], Miller [2] and Scott and Fenves [3]. Our extensions include the retention of subspace information over multiple timesteps, and a special correction at the end of a timestep that allows for corrections to be accepted with verified low residual with as little as a single residual evaluation per timestep on average. In the case of a single residual evaluation per timestep, the method has zero additional computational cost compared to uncoupled or unidirectionally coupled simulations. We expect these enhancements to be generally applicable to other multiscale coupling applications where timestepping occurs. In addition we have developed a “pressure-drop” residual which allows for stable coupling of flows between a 3D incompressible CFD application and another (lower-dimensional) fluid system. We expect this residual to also be useful for coupling non-respiratory incompressible fluid applications, such as multiscale simulations involving blood flow. The lower-dimensional models that are considered in this study are sets of simple ordinary differential equations (ODEs) representing the compliant mechanics of symmetric human pulmonary airway trees. To validate the method, we compare the predictions of hybrid CFD–ODE models against an ODE-only model of pulmonary airflow in an idealized geometry. Subsequently, we couple multiple sets of ODEs describing the distal lung to an imaging-based human lung geometry. Boundary conditions in these models consist of atmospheric pressure at the mouth and intrapleural pressure applied to the multiple sets of ODEs. In both the simplified geometry and in the imaging-based geometry, the performance of the method was comparable to that of monolithic schemes, in most cases requiring only a single CFD evaluation per time step. Thus, this new accelerator allows us to begin combining pulmonary CFD models with lower-dimensional models of pulmonary mechanics with little computational overhead. Moreover, because the CFD and lower-dimensional models are totally separate, this framework affords great flexibility in terms of the type and breadth of the adopted lower-dimensional model, allowing the biomedical researcher to appropriately focus on model design. Research funded by the National Heart and Blood Institute Award 1RO1HL073598.

60 APPLIED LIFE SCIENCES↗

Variational Quantum Circuits to Prepare Low Energy Symmetry States

We explore how to build quantum circuits that compute the lowest energy state corresponding to a given Hamiltonian within a symmetry subspace by explicitly encoding it into the circuit. We create an explicit unitary and a variationally trained unitary that maps any vector output by ansatz A(α → ) from a defined subspace to a vector in the symmetry space. The parameters are trained varitionally to minimize the energy, thus keeping the output within the labelled symmetry value. The method was tested for a spin XXZ Hamiltonian using rotation and reflection symmetry and H 2 Hamiltonian within S z = 0 subspace using S 2 symmetry. We have found the variationally trained unitary gives good results with very low depth circuits and can thus be used to prepare symmetry states within near term quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Training and projecting: A reduced basis method emulator for many-body physics

Here, we present the reduced basis method as a tool for developing emulators for equations with tun able parameters within the context of the nuclear many-body problem. The method uses a basis expansion informed by a set of solutions for a few values of the model parameters and then projects the equations over a well-chosen low-dimensional subspace. We connect some of the results in the eigenvector continuation literature to the formalism of reduced basis methods and show how these methods can be applied to a broad set of problems. As we illustrate, the possible success of the formalism on such problems can be diagnosed beforehand by a principal component analysis. We apply the reduced basis method to the one-dimensional Gross-Pitaevskii equation with a harmonic trap ping potential and to nuclear density functional theory for 48 Ca, achieving speed-ups of more than x150 and x250, respectively, when compared to traditional solvers. The outstanding performance of the approach, together with its straightforward implementation, show promise for its application to the emulation of computationally demanding calculations, including uncertainty quantification.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Non-Intrusive Inference Reduced Order Model for Fluids Using Deep Multistep Neural Network

In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams–Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches.

97 MATHEMATICS AND COMPUTING↗

High-dimensional methods for quantum homodyne tomography

We provide optimized recursion relations for homodyne tomography. We improve previous methods by mitigating the divergences intrinsic in the calculation of the pattern functions used previously, and detail how to implement the data analysis through Monte Carlo simulations. Our refinements are necessary for the reconstruction of excited quantum states which populate a high-dimensional subspace of the electromagnetic field Hilbert space. •Stabilization of numerics for quantum homodyne tomography reconstructions.•High dimensional quantum homodyne tomography reconstruction.•Monte Carlo simulations of quantum homodyne tomography.•Quantum Homodyne tomography simulations.

Mosco, Nicola↗

Efficient implementation of the Lanczos method for magnetic systems

Numerically exact investigations of interacting spin systems provide a major tool for an understanding of their magnetic properties. For medium size systems the approximate Lanczos diagonalization is the most common method. In this article we suggest two improvements: efficient basis coding in subspaces and simple restructuring for openMP parallelization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesonic eightfold way from dynamics and confinement in strongly coupled lattice quantum chromodynamics

We show the existence of all the 36 eightfold way mesons and determine their masses and dispersion curves exactly, from dynamical first principles such as directly from the quark-fluon dynamics. We also give a proof of confinement below the two-meson energy threshold. For this purpose, we consider an imaginary time functional integral representation of a 3+1 dimensional lattice QCD model with Wilson action, SU(3){sub f} global and SU(3){sub c} local symmetries. We work in the strong coupling regime, such that the hopping parameter {kappa}>0 is small and much larger than the plaquette coupling {beta}>1/g{sub 0}{sup 2}{>=}0 ({beta}<<{kappa}<<1). In the quantum mechanical physical Hilbert space H, a Feynman-Kac type representation for the two-meson correlation and its spectral representation are used to establish an exact rigorous connection between the complex momentum singularities of the two-meson truncated correlation and the energy-momentum spectrum of the model. The total spin operator J and its z-component J{sub z} are defined by using {pi}/2 rotations about the spatial coordinate axes, and agree with the infinitesimal generators of the continuum for improper zero-momentum meson states. The mesons admit a labelling in terms of the quantum numbers of total isospin I, the third component I{sub 3} of total isospin, the z-component J{sub z} of total spin and quadratic Casimir C{sub 2} for SU(3){sub f}. With this labelling, the mesons can be organized into two sets of states, distinguished by the total spin J. These two sets are identified with the SU(3){sub f} nonet of pseudo-scalar mesons (J=0) and the three nonets of vector mesons (J=1,J{sub z}={+-}1,0). Within each nonet a further decomposition can be made using C{sub 2} to obtain the singlet state (C{sub 2}=0) and the eight members of the octet (C{sub 2}=3). By casting the problem of determination of the meson masses and dispersion curves into the framework of the the anaytic implicit function theorem, all the masses m({kappa},{beta}) are found exactly and are given by convergent expansions in the parameters {kappa} and {beta}. The masses are all of the form m({kappa},{beta}=0){identical_to}m({kappa})=-2ln {kappa}-3{kappa}{sup 2}/2+{kappa}{sup 4}r({kappa}) with r(0){ne}0 and r({kappa}) real analytic; for {beta}>0,m({kappa},{beta})+2ln {kappa} is jointly analytic in {kappa} and {beta}. The masses of the vector mesons are independent of J{sub z} and are all equal within each octet. All isospin singlet masses are also equal for the vector mesons. For each nonet and {beta}=0, up to and including O({kappa}{sup 4}), the masses of the octet and the singlet are found to be equal. But there is a pseudoscalar-vector meson mass splitting given by 2{kappa}{sup 4}+O({kappa}{sup 6}) and the splitting persists for {beta}>0. For {beta}=0, the dispersion curves are all of the form w(p-vector)=-2 ln {kappa}-3{kappa}{sup 2}/2+((1/4)){kappa}{sup 2}{sigma}{sub j=1}{sup 3}2(1-cos p{sup j})+{kappa}{sup 4}r({kappa},p-vector), with |r({kappa},p-vector)|{<=}const. For the pseudoscalar mesons, r({kappa},p-vector) is jointly analytic in {kappa} and p{sup j}, for |{kappa}| and |Im p{sup j}| small. We use some machinery from constructive field theory, such as the decoupling of hyperplane method, in order to reveal the gauge-invariant eightfold way meson states and a correlation subtraction method to extend our spectral results to all H{sub e}, the subspace of H generated by vectors with an even number of Grassmann variables, up to near the two-meson energy threshold of {approx_equal}-4 ln {kappa}. Combining this result with a previously similar result for the baryon sector of the eightfold way, we show that the only spectrum in all H{sub {identical_to}}H{sub e}+H{sub o} (H{sub o} being the odd subspace) below {approx_equal}-4 ln {kappa} is given by the eightfold way mesons and baryons. Hence, we prove confinement up to near this energy threshold.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

Physics↗

Callan-Symanzik-Lifshitz approach to generic competing systems

We present the massive method to approaching the critical behaviors of systems with arbitrary competing interactions. Every distinct competition subspace in the anisotropic cases define an independent set of renormalized vertex parts via normalization conditions with nonvanishing distinct masses at zero external momenta. Otherwise, only one mass scale is required in the isotropic behaviors. At the critical dimension, we prove: (i) the existence of the Callan-Symanzik-Lifshitz equations and (ii) the multiplicative renormalizability of the vertex functions using the inductive method. Away from the critical dimension, we utilize the orthogonal approximation to compute higher loop Feynman integrals, anisotropic as well as isotropic, necessary to get the exponents {eta}{sub n} and {nu}{sub n} at least up to two-loop level. Moreover, we calculate the latter exactly for isotropic behaviors at the same perturbative order. Similarly to the computation in the massless formalism, the orthogonal approximation is found to be exact at one-loop order. The outcome for all critical exponents matches exactly with those computed using the zero mass field-theoretic description renormalized at nonvanishing external momenta.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quasi-exactly solvable models based on special functions

We suggest a systematic method of extension of quasiexactly solvable (QES) systems. We construct finite-dimensional subspaces on the basis of special functions (hypergeometric, Airy, Bessel ones) invariant with respect to the action of differential operators of the second order with polynomial coefficients. As an example of physical applications, we show that the known two-photon Rabi Hamiltonian becomes quasiexactly solvable at certain values of parameters when it can be expressed in terms of corresponding QES operators related to the hypergeometric function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Prediction of correlation energies using variational subspace valence bond

In the variational subspace valence bond (VSVB) [G. D. Fletcher, J. Chem. Phys. 142, 134112 (2015)] method, the electronic orbitals comprising the wave function correspond to chemically meaningful objects, such as bonds, lone pairs, atomic cores, and so on. Selected regions of a molecule (for example, a single chemical bond, as opposed to all the bonds) can be modeled with different levels of basis set and possible methods for modeling correlation from the other regions. The interactions between the components of a molecule (say, a bond and a neighboring orbital) can then be studied in detail for their impact on a chemical phenomenon while avoiding the expense of necessarily applying the higher levels and methods to the entire molecule. Here, this work presents the theoretical basis for modeling correlation effects between specific electron pairs by incorporating terms in the inter-electronic coordinates (“r 12 ”) into VSVB. The approach is validated with calculations on small systems using single-reference wave functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

BI-sparsity pursuit for robust subspace recovery

Here, the success of sparse models in computer vision and machine learning in many real-world applications, may be attributed in large part, to the fact that many high dimensional data are distributed in a union of low dimensional subspaces. The underlying structure may, however, be adversely affected by sparse errors, thus inducing additional complexity in recovering it. In this paper, we propose a bi-sparse model as a framework to investigate and analyze this problem, and provide as a result , a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We additionally demonstrate the effectiveness of our method by experiments on real-world vision data.

47 OTHER INSTRUMENTATION↗

Data-Driven Operator Theoretic Methods for Phase Space Learning and Analysis

This paper uses data-driven operator theoretic approaches to explore the global phase space of a dynamical system. In this work, we defined conditions for discovering new invariant subspaces in the state space of a dynamical system starting from an invariant subspace based on the spectral properties of the Koopman operator. When the system evolution is known locally in several invariant subspaces in the state space of a dynamical system, a phase space stitching result is derived that yields the global Koopman operator. Additionally, in the case of equivariant systems, a phase space stitching result is developed to identify the global Koopman operator using the symmetry properties between the invariant subspaces of the dynamical system and time-series data from any one of the invariant subspaces. Finally, these results are extended to topologically conjugate dynamical systems; in particular, the relation between the Koopman tuple of topologically conjugate systems is established. The proposed results are demonstrated on several second-order nonlinear dynamical systems including a bistable toggle switch. Our method elucidates a strategy for designing discovery experiments: experiment execution can be done in many steps, and models from different invariant subspaces can be combined to approximate the global Koopman operator.

42 ENGINEERING↗

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Implementation and Performance

Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and substrates. Methods based on many-body perturbation theory, such as the random phase approximation (RPA), have previously been limited due to their computational complexity. However, this is now a surmountable barrier due to the advances in computational power available, in particular through modern GPU-based supercomputers. In this work, we describe the implementation of RPA calculations within BerkeleyGW and show its favorable computational performance on large complex systems relevant for catalysis and electrochemistry applications. Our implementation builds off of the static subspace approximation which, by employing a compressed representation of the frequency dependent polarizability, enables the evaluation of the RPA correlation energy with significant acceleration and systematically controllable accuracy. We find that the computational cost of calculating the RPA correlation energy scales only linearly with system size for systems containing up to 50 thousand bands, and is expected to scale quadratically thereafter. We also show excellent strong scaling results across several supercomputers, demonstrating the performance and portability of this implementation.

algorithmic development↗

A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems

Constructing surrogate models for uncertainty quantification (UQ) on complex partial differential equations (PDEs) having inherently high-dimensional O(10 n ), n ≥ 2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions) poses tremendous challenges. The “curse of dimensionality” can be addressed with suitable unsupervised learning techniques used as a pre-processing tool to encode inputs onto lower-dimensional subspaces while retaining its structural information and meaningful properties. In this work, we review and investigate thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods and utilize the resulting embeddings to construct a mapping to quantities of interest via polynomial chaos expansions (PCE). Here, we refer to the general proposed approach as manifold PCE (m-PCE), where manifold corresponds to the latent space resulting from any of the studied dimension reduction methods. To investigate the capabilities and limitations of these methods we conduct numerical tests for three physics-based systems (treated as black-boxes) having high-dimensional stochastic inputs of varying complexity modeled as both Gaussian and non-Gaussian random fields to investigate the effect of the intrinsic dimensionality of input data. We demonstrate both the advantages and limitations of the unsupervised learning methods and we conclude that a suitable m-PCE model provides a cost-effective approach compared to alternative algorithms proposed in the literature, including recently proposed expensive deep neural network-based surrogates and can be readily applied for high-dimensional UQ in stochastic PDEs.

42 ENGINEERING↗