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 307 records · Page 17

Optimization of the generator coordinate method with machine-learning techniques for nuclear spectra and neutrinoless double- β decay: Ridge regression for nuclei with axial deformation

The generator coordinate method (GCM) is an important tool of choice for modeling large-amplitude collective motion in atomic nuclei. The computational complexity of the GCM increases rapidly with the number of collective coordinates. It imposes a strong restriction on the applicability of the method. In this work, we propose a subspace-reduction algorithm that employs optimal statistical ML models as surrogates for exact quantum-number projection calculations for norm and Hamiltonian kernels. The model space of the original GCM is reduced to a subspace relevant for nuclear low energy spectra and the NME of ground state to ground state 0νββ decay based on the orthogonality condition (OC) and the energy-transition-orthogonality procedure (ENTROP), respectively. For simplicity, the polynomial ridge regression (RR) algorithm is used to learn the norm and Hamiltonian kernels of axially deformed configurations. The efficiency and accuracy of this algorithm are illustrated for 76 Ge and 76 Se by comparing results obtained using the optimal RR models to direct GCM calculations. The low-lying energy spectra of 76 Ge and 76 Se, as well as the 0νββ-decay NME between their ground states, are computed. Furthermore, the results show that the performance of the GCM+OC/ENTROP+RR is more robust than that of the GCM+RR alone, and the former can reproduce the results of the original GCM calculation accurately with a significantly reduced computational cost.

59 ≤ A ≤ 89↗

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level.

Taasan, Shlomo↗

A method for optimal actuator and sensor placement for large flexible structures

A method of finding the optimal sensor and actuator locations for the control of flexible structures has been developed. The method is based on the orthogonal projection of structural modes into the intersection subspace of the controllable and observable subspaces. The controllability and observability grammians are then used to weight the projections to reflect the degrees of controllability and observability. This method produces a three-dimensional design space wherein sets of optimal actuator and sensors may be selected.

Lim, K. B.↗

Reduced scaling extended multi-state CASPT2 (XMS-CASPT2) using supporting subspaces and tensor hyper-contraction

We present a reduced scaling formulation of the extended multi-state CASPT2 (XMS-CASPT2) method, which is based on our recently developed state-specific CASPT2 (SS-CASPT2) formulation using supporting subspaces and tensor hyper-contraction. By using these two techniques, the off-diagonal elements of the effective Hamiltonian can be computed with only O(N 3 ) operations and O(N 2 ) memory, where N is the number of basis functions. Furthermore, this limits the overall computational scaling to O(N 4 ) operations and O(N 2 ) memory. Thus, excited states can now be obtained at the same reduced (relative to previous algorithms) scaling we achieved for SS-CASPT2.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Gradient-Free Construction of Active Subspaces for Dimension Reduction in Complex Models with Applications to Neutronics

Recent developments in the field of reduced-order modeling---and, in particular, active subspace construction---have made it possible to efficiently approximate complex models by constructing low-order response surfaces based upon a small subspace of the original high-dimensional parameter space. These methods rely upon the fact that the response tends to vary more prominently in a few dominant directions defined by linear combinations of the original inputs, allowing for a rotation of the coordinate axis and a consequent transformation of the parameters. In this work, we discuss a gradient-free active subspace algorithm that is feasible for high-dimensional parameter spaces where finite-difference techniques are impractical. This analysis extends the gradient-free algorithm introduced in [A. Lewis, R. Smith, and B. Williams, Comput. Math. Appl., 72 (2016), pp. 1603--1615] in two significant ways: (i) we introduce an initialization algorithm to identify lower-dimensional subspaces of influential directions to seed the gradient-free algorithm for high-dimensional problems, and (ii) we analyze dimension selection criteria to verify the algorithms. Finally, we illustrate the initialized gradient-free active subspace algorithm for a neutronics example implemented with SCALE6.1 for input dimensions up to 7700.

97 MATHEMATICS AND COMPUTING↗

Convergence of Eigenvector Continuation

Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to selected training values of the control parameters. The method has proven to be very efficient and accurate for interpolating and extrapolating eigenvectors. However, almost nothing is known about how the method converges, and its rapid convergence properties have remained mysterious. In this Letter, we present the first study of the convergence of eigenvector continuation. In order to perform the mathematical analysis, we introduce a new variant of eigenvector continuation that we call vector continuation. We first prove that eigenvector continuation and vector continuation have identical convergence properties and then analyze the convergence of vector continuation. Our analysis shows that, in general, eigenvector continuation converges more rapidly than perturbation theory. The faster convergence is achieved by eliminating a phenomenon that we call differential folding, the interference between nonorthogonal vectors appearing at different orders in perturbation theory. From our analysis we can predict how eigenvector continuation converges both inside and outside the radius of convergence of perturbation theory. Further, while eigenvector continuation is a nonperturbative method, we show that its rate of convergence can be deduced from power series expansions of the eigenvectors. Our results also yield new insights into the nature of divergences in perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of seismicity at observed at station BCE using subspace detectors

A dynamic correlation processor (DCP) was used to process 90 days of 3-component seismic data recorded by station BCE. Two methods of detector creation were compared. The first attempted to span the signal space with a small number of subspace detectors having minimal projections on one another, and the second used a much larger number of detectors with substantial inter-template projections. After two passes over the data the results were compared, and the second approach was found to have produced more than 3 times the number of detections. For events in common, the average correlation statistic for the second approach was 0.77 compared to a statistic of 0.65 for the first approach. Also, analysis of the detection statistics as a function of SNR showed a strong functional relationship between SNR and correlation statistic for the second approach not found in the first approach. I interpret this to mean that the intra-group variability of signals produced by the second method is due primarily to noise rather than variations in source or path. These results show that (in an environment with large numbers of repeaters) if precise classification is a goal, it is better to operate a DCP with many correlators with substantial inter-template projections and that fully span the signal space. The performance of the DCP was also measured using a small set of “ground truth” picks for BCE from the Chip Brogan catalog. The catalog spanned less than three days out of the 90 days of the experiment and is also incomplete, but the comparison identified 12 signals missed by the DCP because of low SNR. Combining detections by the DCP and picks from the Brogan catalog, identifies 76 unique signals. Of these, the DCP detected 64 (84%) and the Catalog contained between 48/76 (63%) and 48/62 (77%). Analysis of time-of-day and day-of-week statistics was not useful in identifying the signal sources. However, magnitude recurrence statistics were consistent with mining induced seismicity (a preponderance of small sources). Failure of the temporal discriminants may indicate that the events being detected are not coupled in the same way to the mining activity, e.g. secondary failures. Correlation data from explosions at the Nevada test site (NTS) were used to bound the separation of events within groups. Nearly all the NTS correlations with the same passband and time bandwidth product as the detections and having a correlation statistic >= 0.8 are from sources separated by less than 1 km. Even at correlation values of 0.6 nearly all the source separations are less than about 3 km. Because the DCP detectors were formed to span the signal space at a correlation value of 0.9 and because the intra-group variability is most likely due to noise and not source variability, it is likely that the sources associated with each detector are separated by one km or less, and almost certain that the majority are separated by no more than 3 km.

47 OTHER INSTRUMENTATION↗

Multilevel acceleration of scattering-source iterations with application to electron transport

Acceleration/preconditioning strategies available in the SCEPTRE radiation transport code are described. A flexible transport synthetic acceleration (TSA) algorithm that uses a low-order discrete-ordinates (S N ) or spherical-harmonics (P N ) solve to accelerate convergence of a high-order S N source-iteration (SI) solve is described. Convergence of the low-order solves can be further accelerated by applying off-the-shelf incomplete-factorization or algebraic-multigrid methods. Also available is an algorithm that uses a generalized minimum residual (GMRES) iterative method rather than SI for convergence, using a parallel sweep-based solver to build up a Krylov subspace. TSA has been applied as a preconditioner to accelerate the convergence of the GMRES iterations. The methods are applied to several problems involving electron transport and problems with artificial cross sections with large scattering ratios. These methods were compared and evaluated by considering material discontinuities and scattering anisotropy. Observed accelerations obtained are highly problem dependent, but speedup factors around 10 have been observed in typical applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Structural optimization with dynamic behavior constraints

The minimum weight optimum design of damped linearly elastic structural systems subjected to periodic loading with behavior constraints on maximum deflections and side constraints on design variables is addressed. Attention is focused on the two major impediments to an optimal solution: (1) the time parametric nature of the behavior constraints; and (2) the severe nonconvexity of the design space. A solution method based on upper bound approximations for the behavior constraints and an innovative mathematical programming scheme for seeking the optimal frequency subspace is set forth. Numerical results for several test problems illustrate the effectiveness of the method reported.

Mills-Curran, W. C.↗

Bosonic field digitization for quantum computers

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size Φ 4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. Finally, we develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Stochastic embedding DFT: Theory and application to p -nitroaniline in water

Over this past decade, we combined the idea of stochastic resolution of identity with a variety of electronic structure methods. In our stochastic Kohn-Sham density functional theory (DFT) method, the density is an average over multiple stochastic samples, with stochastic errors that decrease as the inverse square root of the number of sampling orbitals. Here in this paper, we develop a stochastic embedding density functional theory method (se-DFT) that selectively reduces the stochastic error (specifically on the forces) for a selected subsystem(s). The motivation, similar to that of other quantum embedding methods, is that for many systems of practical interest, the properties are often determined by only a small subsystem. In stochastic embedding DFT, two sets of orbitals are used: a deterministic one associated with the embedded subspace and the rest, which is described by a stochastic set. The method agrees exactly with deterministic calculations in the limit of a large number of stochastic samples. We apply se-DFT to study a p-nitroaniline molecule in water, where the statistical errors in the forces on the system (the p-nitroaniline molecule) are reduced by an order of magnitude compared with nonembedding stochastic DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatial noise correlations in a Si/SiGe two-qubit device from Bell state coherences

Here, we study spatial noise correlations in a Si/SiGe two-qubit device with integrated micromagnets. Our method relies on the concept of decoherence-free subspaces, whereby we measure the coherence time for two different Bell states, designed to be sensitive only to either correlated or anticorrelated noise, respectively. From these measurements we find weak correlations in low-frequency noise acting on the two qubits, while no correlations could be detected in high-frequency noise. We expect nuclear spin noise to have an uncorrelated nature. A theoretical model and numerical simulations give further insight into the additive effect of multiple independent (anti)correlated noise sources with an asymmetric effect on the two qubits as can result from charge noise. Such a scenario in combination with nuclear spins is plausible given the data and the known decoherence mechanisms. This work is highly relevant for the design of optimized quantum error correction codes for spin qubits in quantum dot arrays, as well as for optimizing the design of future quantum dot arrays.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Coarse grained open system quantum dynamics

We show that the quantum dynamics of a system comprised of a subspace Q coupled to a larger subspace P can be recast as a reduced set of 'coarse grained' ordinary differential equations with constant coefficients. These equations can be solved by a single diagonalization of a general complex matrix. The method makes no assumptions about the strength of the couplings between the Q and the P subspaces, nor is there any limitation on the initial population in P. The utility of the method is demonstrated via computations in three following areas: molecular compounds, photonic materials, and condensed phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Signal Prediction With Input Identification

A novel coding technique is presented for signal prediction with applications including speech coding, system identification, and estimation of input excitation. The approach is based on the blind equalization method for speech signal processing in conjunction with the geometric subspace projection theory to formulate the basic prediction equation. The speech-coding problem is often divided into two parts, a linear prediction model and excitation input. The parameter coefficients of the linear predictor and the input excitation are solved simultaneously and recursively by a conventional recursive least-squares algorithm. The excitation input is computed by coding all possible outcomes into a binary codebook. The coefficients of the linear predictor and excitation, and the index of the codebook can then be used to represent the signal. In addition, a variable-frame concept is proposed to block the same excitation signal in sequence in order to reduce the storage size and increase the transmission rate. The results of this work can be easily extended to the problem of disturbance identification. The basic principles are outlined in this report and differences from other existing methods are discussed. Simulations are included to demonstrate the proposed method.

Juang, Jer-Nan↗

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Applications to Materials for Catalysis and Electrochemistry

Modeling complex materials using high-fidelity, ab initio methods at low cost is a fundamental goal for quantum chemical software packages. The GW approximation and random phase approximation (RPA) provide a unified description of both electronic structure and total energies using the same physics in a many-body perturbative approach that can be more accurate than generalized-gradient density functional theory (DFT) methods. However, GW/RPA implementations have historically been limited to either specific materials classes or application toward small chemical systems. Here, the static subspace approximation allows for reduced cost full-frequency GW/RPA calculations and has previously been benchmarked thoroughly for GW calculations. Here, we describe our approach to including partial occupations of electronic orbitals in full-frequency GW and RPA calculations for the study of electrocatalysts. We benchmarked RPA total energy calculations using the subspace approximation across a diverse test suite of materials for a variety of computational parameters. The benchmarking quantifies the impact of different extrapolation procedures for representing the static polarizability at infinite screened cutoff, and shows that using screened cutoffs above 20-25 Ryd result in diminishing accuracy returns for predicting RPA total energies. Additionally, for moderately sized electrocatalytic models, 2-3 times fewer computational resources are used to compute RPA total energies by representing the static polarizability with 20-30% of the static subspace basis, with an error of approximately 0.01 eV or better in RPA adsorption energy calculations. Finally, we show that for these electrochemical models RPA can shift DFT adsorption energy shifts by up to 0.5 eV and that GW can frequently shift DFT eigenvalues of surface and adsorbate states by approximately 0.5-1 eV.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Beyond union of subspaces: Subspace pursuit on Grassmann manifold for data representation

Discovering the underlying structure of a high-dimensional signal or big data has always been a challenging topic, and has become harder to tackle especially when the observations are exposed to arbitrary sparse perturbations. Here in this paper, built on the model of a union of subspaces (UoS) with sparse outliers and inspired by a basis pursuit strategy, we exploit the fundamental structure of a Grassmann manifold, and propose a new technique of pursuing the subspaces systematically by solving a non-convex optimization problem using the alternating direction method of multipliers. This problem as noted is further complicated by non-convex constraints on the Grassmann manifold, as well as the bilinearity in the penalty caused by the subspace bases and coefficients. Nevertheless, numerical experiments verify that the proposed algorithm, which provides elegant solutions to the sub-problems in each step, is able to de-couple the subspaces and pursue each of them under time-efficient parallel computation.

97 MATHEMATICS AND COMPUTING↗

Bi-sparsity pursuit: A paradigm for robust subspace recovery

The success of sparse models in computer vision and machine learning is due to the fact that, high dimensional data is distributed in a union of low dimensional subspaces in many real-world applications. The underlying structure may, however, be adversely affected by sparse errors. In this paper, we propose a bi-sparse model as a framework to analyze this problem, and provide a novel algorithm to recover the union of subspaces in the presence of sparse corruptions. We further show the effectiveness of our method by experiments on real-world vision data.

42 ENGINEERING↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗