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 505 records · Page 28

QAARM: Quasi-anharmonic auto-regressive model reveals molecular recognition pathways in ubiquitin

Molecular dynamics (MD) simulations have dramatically improved the atomistic understanding of protein motions, energetics and function. These growing datasets have necessitated a corresponding emphasis on trajectory analysis methods for characterizing simulation data, particularly since functional protein motions and transitions are often rare and/or intricate events. Observing that such events give rise to long-tailed spatial distributions, we recently developed a higher-order statistics based dimensionality reduction method, called quasi-anharmonic analysis (QAA), for identifying biophysically-relevant reaction coordinates and substates within MD simulations. Further characterization of conformation space should consider the temporal dynamics specific to each identified substate. Our model uses hierarchical clustering to learn energetically coherent substates and dynamic modes of motion from a 0.5 {mu}s ubiqutin simulation. Autoregressive (AR) modeling within and between states enables a compact and generative description of the conformational landscape as it relates to functional transitions between binding poses. Lacking a predictive component, QAA is extended here within a general AR model appreciative of the trajectory's temporal dependencies and the specific, local dynamics accessible to a protein within identified energy wells. These metastable states and their transition rates are extracted within a QAA-derived subspace using hierarchical Markov clustering to provide parameter sets for the second-order AR model. We show the learned model can be extrapolated to synthesize trajectories of arbitrary length.

59 BASIC BIOLOGICAL SCIENCES↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Space-Split Algorithm for Sensitivity Analysis of Discrete Chaotic Systems With Multidimensional Unstable Manifolds

Accurate approximations of the change of a system's output and its statistics with respect to the input are highly desired in computational dynamics. Ruelle's linear response theory provides breakthrough mathematical machinery for computing the linear response of chaotic dynamical systems. In this paper, we propose an algorithm for sensitivity analysis of discrete chaos with an arbitrary number of positive Lyapunov exponents. We combine the concept of perturbation space-splitting, which regularizes Ruelle's original expression, together with measure-based parameterization of the expanding subspace. We use these tools to rigorously derive trajectory-following recursive relations that converge exponentially fast, and construct a memory-efficient Monte Carlo scheme for derivatives of the output statistics. Thanks to the regularization and lack of simplifying assumptions on the system's behavior, our method is immune to the common problems of other popular methods such as the exploding tangent solutions and unphysical shadowing directions. Here, we provide a ready-to-use algorithm, analyze its complexity, and demonstrate several numerical examples of sensitivity computation using physically-inspired low-dimensional systems.

97 MATHEMATICS AND COMPUTING↗

Structure and Singly Occupied Molecular Orbital Analysis of Anionic Tautomers of Guanine

In the current study, we analyze the adiabatically bound anions of guanine in two aspects: (1) the geometries and excess electron distributions are analyzed and compared with anions of the most stable neutrals to identify the sources of stability; (2) the chemical space of guanine tautomers is explored to verify if these new tautomers are contained in a particular subspace of the tautomeric space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Renormalized Singles Green’s Function for Quasi-Particle Calculations beyond the G 0 W 0 Approximation

Quasi-particle energies and band gaps in particular are critical for investigating novel materials. Commonly used density functional approximations (DFAs) systematically underestimate band gaps, and GW approximation is the established method of choice for good accuracy and reliability. However, G 0 W 0 has some undesired dependence on the DFA, while self-consistent GW (scGW) is expensive and not consistent in accuracy improvement. Here a simple and efficient G RS W 0 approach has been developed: a subspace diagonalization of the Hartree-Fock (HF) Hamiltonian with the DFA density matrix provides the new reference Green's function GRS that incorporates the effect of all single excitation contributions to the self-energy, thereby essentially eliminating the starting-point dependence. Calculations for molecules and large band gap solids demonstrate the significant improvement over G 0 W 0 and greatly reduced dependence on the initial DFA. GRS W0 approach also improve results for other bulks over G 0 W 0 but to a lesser extent, which could be due to the limitations in current implementation for bulks. The results demonstrate that to achieve good accuracy, it is not necessary to use hybrid DFA, which is expensive for bulks. Lastly, this work should be greatly significant in making GW a more robust approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Minimization of environment-induced decoherence in quantum subsystems and application to solid-state-based quantum gates

A general formulation of optimal control theory for open quantum systems (quantum subsystems) based on a superoperator method is presented. This approach is applied to a computation of optimized time-dependent fields for solid-state-based realizations of quantum gates. Decoherence is incorporated within the spin-boson model and treated within, essentially, the Bloch-Redfield formalism. Generating a 'decoherence-free subspace' for the superoperator dynamically, we identify optimal trajectories in the phase space of the dynamical system for one- and two-qubit subsystems. Numerical analysis shows that, for the ideal case where one has full control over the subsystem's Hamiltonian, any gate operation can be realized with arbitrary small loss of coherence due to dephasing and optimal solutions exist which are independent of both spectral density and the temperature of the environment. At the example of a Josephson charge quantum gate we study the more realistic situation where one has a restricted number of control fields which, while providing a universal gate, cannot completely eliminate dephasing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of the isovector nucleon-nucleus interaction potential in nonmesonic hypernuclear decay

We develop a theoretical finite nucleus framework for the evaluation of the coincidence number of pairs N{sub nN} and the asymmetry parameter a{sub {Lambda}} in nonmesonic hypernuclear decay {Lambda}N{yields}nN, and introduce the effect of final-state interactions. The primary nonmesonic weak hyperon-nucleon decay process is described through the independent-particle shell model. We work within the 2p1h subspace of final states, assuming a simple approach for finite nuclei based on the eikonal approximation. An optical potential including the nucleon-nucleus isoscalar and isovector interactions is introduced to take into account the minimum nuclear-medium effects. The calculated values for {sub {Lambda}}{sup 5}He and {sub {Lambda}}{sup 12}C show that our treatment of final-state interactions, even those considered as restricted to a subspace of states, brings the independent-particle model results closer to the experimental data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Switching LPV Control of an F-16 Aircraft via Controller State Reset

In flight control, the design objective and the aircraft dynamics may be different in low and high angle of attack regions. This paper presents a systematic switching Linear Parameter-varying LPV method to determine if it is practical to use for flight control designs over a wide angle of attack region. The approach is based on multiple parameter-dependent Lyapunov functions a family of LPV controllers are designed, and each of them is suitable for a specific parameter subspace. The state of the controller is reset to guarantee the stability requirement of the Lyapunov function when the switching event occurs. Two parameter-dependent switching logics, hysteresis switching and switching with average dwell times are examined. The proposed switching LPV control scheme is applied to an F-16 aircraft model with different design objectives and aircraft dynamics in low and high angle of attack regions. The nonlinear simulating results using both switching logics are compared.

Lu, Bei↗

On the analysis and comparison of conformer-specific essential dynamics upon ligand binding to a protein

The native state of a protein consists of an equilibrium of conformational states on an energy landscape rather than existing as a single static state. The co-existence of conformers with different ligand-affinities in a dynamical equilibrium is the basis for the conformational selection model for ligand binding. In this context, the development of theoretical methods that allow us to analyze not only the structural changes but also changes in the fluctuation patterns between conformers will contribute to elucidate the differential properties acquired upon ligand binding. Molecular dynamics simulations can provide the required information to explore these features. Its use in combination with subsequent essential dynamics analysis allows separating large concerted conformational rearrangements from irrelevant fluctuations. We present a novel procedure to define the size and composition of essential dynamics subspaces associated with ligand-bound and ligand-free conformations. These definitions allow us to compare essential dynamics subspaces between different conformers. Our procedure attempts to emphasize the main similarities and differences between the different essential dynamics in an unbiased way. Essential dynamics subspaces associated to conformational transitions can also be analyzed. As a test case, we study the glutaminase interacting protein (GIP), composed of a single PDZ domain. Both GIP ligand-free state and glutaminase L peptide-bound states are analyzed. Our findings concerning the relative changes in the flexibility pattern upon binding are in good agreement with experimental Nuclear Magnetic Resonance data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Correlated Topics in a Scalable Multidimensional Text Cube: Algorithms and Aviation Safety Case Study

As world-wide air traffic continues to grow even at a modest pace, the overall complexity of the system will increase significantly. This increased complexity can lead to a larger number of fatalities per year even if the extremely low fatality rate that we currently enjoy is maintained. One important source of information about the safety of the aviation system is in Aviation Safety Text Reports which are written by members of the flight crew, air traffic controllers, and other parties involved with the aviation system. These anonymized narrative reports contain fixed-field contextual information about the flight but also contain free-form narratives that describe, in the author s own words, the nature of the safety incident and, in many cases, the contributing factors that led to the safety incident. Several thousand such reports are filed each month, each of which is read and analyzed by highly trained experts. However, it is possible that there are emerging safety issues due to the fact that they may be reported very infrequently and in different contexts with different descriptions. The goal of this research paper is to develop correlated topic models which uncover correlations in the subspaces defined by the intersection of numerous fixed fields and discovered correlated topics. This task requires the discovery of latent topics in the text reports and the creation of a topic cube. Furthermore, because the number of potential cells in the topic cube is very large, we discuss novel methods of pruning the search space in the topic cells, thereby making the analysis feasible. We demonstrate the new algorithms on an analysis of pilot fatigue and its contributing factors, as well as the safety incidents that are correlated with this phenomenon.

Zhao, Bo↗

Extension of frozen natural orbital approximation to open-shell references: Theory, implementation, and application to single-molecule magnets

Natural orbitals are often used to achieve a more compact representation of correlated wave-functions. Using natural orbitals computed as eigenstates of the virtual–virtual block of the state density matrix instead of the canonical Hartree–Fock orbitals results in smaller errors when the same fraction of virtual space is frozen. This strategy, termed frozen natural orbital (FNO) approach, is effective in reducing the cost of regular coupled-cluster (CC) calculations and some multistate methods, such as EOM-IP-CC (equation-of-motion CC for ionization potentials). This contribution extends the FNO approach to the EOM-SF-CC ansatz (EOM-CC with spin-flip). In contrast to EOM-IP-CCSD, EOM-SF-CCSD relies on high-spin open-shell references. Using FNOs computed for an open-shell reference leads to an erratic behavior of the EOM-SF-CC energies and properties due to an inconsistent truncation of the α and β orbital spaces. A general solution to problems arising in the EOM-CC calculations utilizing open-shell references, termed OSFNO (open-shell FNO), is proposed. Furthermore, by means of singular value decomposition (SVD) of the overlap matrix of the α and β orbitals, the OSFNO algorithm identifies the corresponding orbitals and determines virtual orbitals corresponding to the singly occupied space. This is followed by SVD of the singlet part of the state density matrix in the remaining virtual orbital subspace. The so-computed FNOs preserve the spin purity of the open-shell orbital subspace to the extent allowed by the original reference, thus facilitating a safe truncation of the virtual space. The performance of OSFNO is benchmarked for selected diradicals and triradicals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Logical Shadow Tomography: Efficient Estimation of Error-mitigated Observables

In near-term quantum applications, reducing errors and improving device reliability is an essential task. Towards these ends, various techniques have been introduced in recent literature, collectively referred to as quantum error mitigation techniques, for reducing errors in pre-fault-tolerant devices. Here, we introduce logical shadow tomography as a versatile error mitigation method. Our technique uses a stabilizer code to encode information in a logical state. Instead of doing active error correction, quantum states will be measured at the end of computation via shadow tomography and non-logical errors are projected out in the classical post-processing. Relative to quantum subspace expansion which requires O(2(M-1)L) experiments to estimate an logical Pauli observable encoded by an [[M, L, d]] code, our technique only requires 2L experiments, an important practical reduction in resources.

Hong-Ye Hu↗

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles of graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.

cybersecurity↗

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↗

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↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

Navagation↗