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 343 records · Page 19

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

Vortices as quantum objects in the lowest Landau level

We provide a quantum description of the vortex degrees of freedom for Bose gases in the lowest Landau level. The results can be used to interpret correlated many-particle wave functions in terms of superpositions of vortex configurations. These effects may be visible in the next generation of mesoscopic trap experiments. We expose the important role of nonorthogonality in using simple vortex descriptions, and formulate a basis set which does not experience these difficulties. We show that in general any correlated ground state (even completely fragmented) can be represented as a superposition of completely condensed states. We provide simple illustrations of these methods: a vortex interpretation of the exact, many-body, eigenstates for L{<=}N, the determination of the energy levels of the single-vortex subspace and finally mention a more speculative description of the Laughlin state in vortex variables.

74 ATOMIC AND MOLECULAR PHYSICS↗

State protection under collective damping and diffusion

In this paper we provide a recipe for state protection in a network of oscillators under collective damping and diffusion. Our strategy is to manipulate the network topology, i.e., the way the oscillators are coupled together, the strength of their couplings, and their natural frequencies, in order to create a relaxation-diffusion-free channel. This protected channel defines a decoherence-free subspace (DFS) for nonzero-temperature reservoirs. Our development also furnishes an alternative approach to build up DFSs that offers two advantages over the conventional method: it enables the derivation of all the network-protected states at once, and also reveals, through the network normal modes, the mechanism behind the emergence of these protected domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards the Robust Small-Signal Stability Region of Power Systems Under Perturbations Such as Uncertain and Volatile Wind Generation

This paper addresses how to extend the concept of small-signal stability region (SSSR) to that of robust small-signal stability region (RSSSR), within which the system can remain stable even under perturbations caused by uncertain and volatile nodal injections, such as renewable generation. We first employ the structured perturbation theory to formulate the perturbations of nodal injections in state space. Both the intensity and the locations of perturbations can be taken into account. Then, we leverage the stability radius theory and structured singular value theory to define the RSSSR in parameter subspace, enabling a systematic analysis of small-signal stability of power systems under perturbations in a region-wise manner. The hyperplane-approximation method can be employed to construct a linear closed-form approximation of RSSSR boundaries. Case studies on the modified two-area system and New England 39-node system illustrate the new concept of RSSSR and its potential applications.

power system stability analysis↗

Filtering states with total spin on a quantum computer

Starting from a general wave-function described on a set of spins or qubits, we propose several quantum algorithms to extract the components of this state on eigenstates of total spin S 2 and its z component S z . The method plays the role of total spin projection and gives access to the amplitudes of the initial state on a total spin basis. Here, the different algorithms have various degrees of sophistication depending on the requested tasks. They can either solely project onto the subspace with good total spin or completely uplift the degeneracy in this subspace. In the former case, when the projection on the total spin j is made, we show that the number of operations for the projection can be reduced from a quadratic to a linear dependence in j. After each measurement, the state collapses to one of the spin eigenstates that could be used for postprocessing. For this reason, we call the method total quantum spin filtering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Natural Charge-Transfer Analysis: Eliminating Spurious Charge-Transfer States in Time-Dependent Density Functional Theory via Diabatization, with Application to Projection-Based Embedding

For many types of vertical excitation energies, linear-response time-dependent density functional theory (LR-TDDFT) offers a useful degree of accuracy combined with unrivaled computational efficiency, although charge-transfer excitation energies are often systematically and dramatically underestimated, especially for large systems and those that contain explicit solvent. As a result, low energy electronic spectra of solution-phase chromophores often contain tens to hundreds of spurious charge-transfer states, making LR-TDDFT needlessly expensive in bulk solution. More nefariously, intensity borrowing by the low-energy charge-transfer states can affect intensities of the valence excitations even if those excitation energies are accurate. At higher excitation energies, it is difficult to distinguish spurious CT states from genuine charge-transfer-to-solvent (CTTS) excitations. In this work, we introduce an automated diabatization scheme that enables fast and effective screening of the CTTS acceptor space in bulk solution. Our procedure introduces the concept of “natural charge-transfer orbitals”, which provide a means to isolate characteristic pairs of orbitals that are most likely to participate in a CTTS excitation. The projection of these orbitals onto solvent-centered virtual orbitals provides a criterion for defining the most important solvent molecules in a given excitation. We apply this method to analyze an ab initio molecular dynamics (MD) trajectory of I-(aq) and report the lowest-energy CTTS band in the absorption spectrum. Our results are in excellent agreement with experimental measurements for bulk I-(aq), and only one-third of the water molecules in the I-(H2O)96 simulation cell need to be described with LR-TDDFT in order to obtain excitation energies that are converged to < 0.1 eV. The tools introduced herein will improve the accuracy, efficiency, and usability of LR-TDDFT in solution-phase environments

Carter-Fenk, Kevin D.↗

Eigenvector Continuation with Subspace Learning

A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous efficient methods developed for this task, but they generally fail when some control parameter in the Hamiltonian matrix exceeds some threshold value. In this Letter we present a new technique called eigenvector continuation that can extend the reach of these methods. The key insight is that while an eigenvector resides in a linear space with enormous dimensions, the eigenvector trajectory generated by smooth changes of the Hamiltonian matrix is well approximated by a very low-dimensional manifold. We prove this statement using analytic function theory and propose an algorithm to solve for the extremal eigenvectors. We benchmark the method using several examples from quantum many-body theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of a novel quality assurance system based on rolled-up and rolled-out radiochromic films in volumetric modulated arc therapy

Purpose: To develop a cylindrical phantom with rolled-up radiochromic films and dose analysis software in the rolled-out plane for quality assurance (QA) in volumetric modulated arc therapy (VMAT). Methods: The phantom consists of an acrylic cylindrical body wrapped with radiochromic film inserted into an outer cylindrical shell of 5 cm thickness. The rolled-up films with high spatial resolution enable detection of specific dose errors along the arc trajectory of continuously irradiated and modulated beams in VMAT. The developed dose analysis software facilitates dosimetric evaluation in the rolled-up and rolled-out planes of the film; the calculated doses on the corresponding points where the rolled-up film was placed were reconstructed into a rectangular dose matrix equivalent to that of the rolled-out plane of the film. The VMAT QA system was implemented in 3 clinical cases of prostate, nasopharynx, and pelvic metastasis. Each calculated dose on the rolled-out plane was compared with measurement values by modified gamma evaluation. Detected positions of dose disagreement on the rolled-out plane were also distinguished in cylindrical coordinates. The frequency of error occurrence and error distribution were summarized in a histogram and in an axial view of rolled-up plane to intuitively identify the corresponding positions of detected errors according to the gantry angle. Results: The dose matrix reconstructed from the developed VMAT QA system was used to verify the measured dose distribution along the arc trajectory. Dose discrepancies were detected on the rolled-out plane and visualized on the calculated dose matrix in cylindrical coordinates. The error histogram obtained by gamma evaluation enabled identification of the specific error frequency at each gantry angular position. The total dose error occurring on the cylindrical surface was in the range of 5%-8% for the 3 cases. Conclusions: The developed system provides a practical and reliable QA method to detect dosimetric errors according to the gantry angle. Film dosimetry based on rolled-up and rolled-out techniques leads to dose verification in the subspaces of the 3D dose volume. The system can be employed as an alternative tool to detect the pitfalls of planar dose verification.

61 RADIATION PROTECTION AND DOSIMETRY↗

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novel DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nucleon-pair coupling scheme in Elliott's SU(3) model

Elliott's SU(3) model is at the basis of the shell-model description of rotational motion in atomic nuclei. Here we demonstrate that SU(3) symmetry can be realized in a truncated shell-model space if constructed in terms of a sufficient number of collective S, D, G,...pairs (i.e., with angular momentum zero, two, four,...) and if the structure of the pairs is optimally determined either by a conjugate-gradient minimization method or from a Hartree-Fock intrinsic state. We illustrate the procedure for six protons and six neutrons in the pf (sdg) shell and exactly reproduce the level energies and electric quadrupole properties of the ground-state rotational band with SDG (SDGI) pairs. The SD-pair approximation without significant renormalization, on the other hand, cannot describe the full SU(3) collectivity. A mapping from Elliott's fermionic SU(3) model to systems with s, d, g,... bosons provides insight into the existence of a decoupled collective subspace in terms of S, D, G,... pairs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Force-Free Identification of Minimum-Energy Pathways and Transition States for Stochastic Electronic Structure Theories

Here, the accurate mapping of potential energy surfaces (PESs) is crucial to our understanding of the numerous physical and chemical processes mediated by atomic rearrangements, such as conformational changes and chemical reactions, and the thermodynamic and kinetic feasibility of these processes. Stochastic electronic structure theories, e.g., Quantum Monte Carlo (QMC) methods, enable highly accurate total energy calculations that in principle can be used to construct the PES. However, their stochastic nature poses a challenge to the computation and use of forces and Hessians, which are typically required in algorithms for minimum-energy pathway (MEP) and transition state (TS) identification, such as the nudged elastic band (NEB) algorithm and its climbing image formulation. Here, we present strategies that utilize the surrogate Hessian line-search method, previously developed for QMC structural optimization, to efficiently identify MEP and TS structures without requiring force calculations at the level of the stochastic electronic structure theory. By modifying the surrogate Hessian algorithm to operate in path-orthogonal subspaces and at saddle points, we show that it is possible to identify MEPs and TSs by using a force-free QMC approach. We demonstrate these strategies via two examples, the inversion of the ammonia (NH 3 ) molecule and the nucleophilic substitution (S N 2) reaction F – + CH 3 F → FCH 3 + F – . We validate our results using Density Functional Theory (DFT)- and Coupled Cluster (CCSD, CCSD(T))-based NEB calculations. We then introduce a hybrid DFT-QMC approach to compute thermodynamic and kinetic quantities, free energy differences, rate constants, and equilibrium constants that incorporates stochastically optimized structures and their energies, and show that this scheme improves upon DFT accuracy. Our methods generalize straightforwardly to other systems and other high-accuracy theories that similarly face challenges computing energy gradients, paving the way for highly accurate PES mapping, transition state determination, and thermodynamic and kinetic calculations at significantly reduced computational expense.

Iyer, Gopal R.↗

Nonadiabatic Quantum Molecular Dynamics in Dense Manifolds of Electronic States

Most nonadiabatic molecular dynamics methods require the determination of a basis of adiabatic or diabatic electronic states at every time step, but in dense manifolds of electronic states, such approaches become intractable. A notable exception is Ehrenfest molecular dynamics, which can be implemented without explicit determination of such a basis but suffers from unphysical behavior when propagation on a mean-field potential energy surface (PES) does not accurately reflect the true dynamics on multiple electronic states. Here we introduce the multiple cloning for dense manifolds of states (MCDMS) method, a systematically improvable approximation to the multiple cloning method. MCDMS avoids both the mean-field PES problem and the need to compute the full electronic spectrum. This is achieved by reformulating multiple cloning to use a subspace of approximate eigenstates constructed from the time-dependent Ehrenfest electronic wave function. Finally, by application to model systems, we show that this approach allows a substantial reduction in the size of the required electronic basis without significant loss in accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unraveling multi-spin effects in rotational resonance nuclear magnetic resonance using effective reduced density matrix theory

A quantum-mechanical model integrating the concepts of reduced density matrix and effective Hamiltonians is proposed to explain the multi-spin effects observed in rotational resonance (R{sup 2}) nuclear magnetic resonance (NMR) experiments. Employing this approach, the spin system of interest is described in a reduced subspace inclusive of its coupling to the surroundings. Through suitable model systems, the utility of our theory is demonstrated and verified with simulations emerging from both analytic and numerical methods. The analytic results presented in this article provide an accurate description/interpretation of R{sup 2} experimental results and could serve as a test-bed for distinguishing coherent/incoherent effects in solid-state NMR.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

Structure properties of {sup 226}Th and {sup 256,258,260}Fm fission fragments: Mean-field analysis with the Gogny force

The constrained Hartree-Fock-Bogoliubov method is used with the Gogny interaction D1S to calculate potential energy surfaces of fissioning nuclei {sup 226}Th and {sup 256,258,260}Fm up to very large deformations. The constraints employed are the mass quadrupole and octupole moments. In this subspace of collective coordinates, many scission configurations are identified ranging from symmetric to highly asymmetric fragmentations. Corresponding fragment properties at scission are derived yielding fragment deformations, deformation energies, energy partitioning, neutron binding energies at scission, neutron multiplicities, charge polarization, and total fragment kinetic energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Model Reduction for Compressible Cavity Simulations Towards Uncertainty Quantification of Structural Loading

This report summarizes FY16 progress towards enabling uncertainty quantification for compressible cavity simulations using model order reduction (MOR). The targeted application is the quantification of the captive-carry environment for the design and qualification of nuclear weapons systems. To accurately simulate this scenario, Large Eddy Simulations (LES) require very fine meshes and long run times, which lead to week-long runs even on parallel state-of-the-art super- computers. MOR can reduce substantially the CPU-time requirement for these simulations. We describe two approaches for model order reduction for nonlinear systems, which can yield significant speed-ups when combined with hyper-reduction: the Proper Orthogonal Decomposition (POD)/Galerkin approach and the POD/Least-Squares Petrov Galerkin (LSPG) approach. The implementation of these methods within the in-house compressible flow solver SPARC is discussed. Next, a method for stabilizing and enhancing low-dimensional reduced bases that was developed as a part of this project is detailed. This approach is based on a premise termed "minimal subspace rotation", and has the advantage of yielding ROMs that are more stable and accurate for long-time compressible cavity simulations. Numerical results for some laminar cavity problems aimed at gauging the viability of the proposed model reduction methodologies are presented and discussed.

42 ENGINEERING↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗