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 469 records · Page 26

Discrete discontinuous basis projection method for large-scale electronic structure calculations

We present an approach to accelerate real-space electronic structure methods several fold, without loss of accuracy, by reducing the dimension of the discrete eigenproblem that must be solved. To accomplish this, we construct an efficient, systematically improvable, discontinuous basis spanning the occupied subspace and project the real-space Hamiltonian onto the span. In calculations on a range of systems, we find that accurate energies and forces are obtained with 8–25 basis functions per atom, reducing the dimension of the associated real-space eigenproblems by 1–3 orders of magnitude.

74 ATOMIC AND MOLECULAR PHYSICS↗

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗

Dimension-independent likelihood-informed MCMC

Many Bayesian inference problems require exploring the posterior distribution of high-dimensional parameters that represent the discretization of an underlying function. This work introduces a family of Markov chain Monte Carlo (MCMC) samplers that can adapt to the particular structure of a posterior distribution over functions. Two distinct lines of research intersect in the methods developed here. First, we introduce a general class of operator-weighted proposal distributions that are well defined on function space, such that the performance of the resulting MCMC samplers is independent of the discretization of the function. Second, by exploiting local Hessian information and any associated low-dimensional structure in the change from prior to posterior distributions, we develop an inhomogeneous discretization scheme for the Langevin stochastic differential equation that yields operator-weighted proposals adapted to the non-Gaussian structure of the posterior. The resulting dimension-independent and likelihood-informed (DILI) MCMC samplers may be useful for a large class of high-dimensional problems where the target probability measure has a density with respect to a Gaussian reference measure. Two nonlinear inverse problems are used to demonstrate the efficiency of these DILI samplers: an elliptic PDE coefficient inverse problem and path reconstruction in a conditioned diffusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Charge transfer interaction using quasiatomic minimal-basis orbitals in the effective fragment potential method

The charge transfer (CT) interaction, the most time-consuming term in the general effective fragment potential method, is made much more computationally efficient. This is accomplished by the projection of the quasiatomic minimal-basis-set orbitals (QUAMBOs) as the atomic basis onto the self-consistent field virtual molecular orbital (MO) space to select a subspace of the full virtual space called the valence virtual space. The diagonalization of the Fock matrix in terms of QUAMBOs recovers the canonical occupied orbitals and, more importantly, gives rise to the valence virtual orbitals (VVOs). The CT energies obtained using VVOs are generally as accurate as those obtained with the full virtual space canonical MOs because the QUAMBOs span the valence part of the virtual space, which can generally be regarded as “chemically important.” The number of QUAMBOs is the same as the number of minimal-basis MOs of a molecule. Therefore, the number of VVOs is significantly smaller than the number of canonical virtual MOs, especially for large atomic basis sets. This leads to a dramatic decrease in the computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Extended Lagrangian Excited State Molecular Dynamics

In this work, an extended Lagrangian framework for excited state molecular dynamics (XL-ESMD) using time-dependent self-consistent field theory is proposed. The formulation is a generalization of the extended Lagrangian formulations for ground state Born–Oppenheimer molecular dynamics [Phys. Rev. Lett. 2008 100, 123004]. The theory is implemented, demonstrated, and evaluated using a time-dependent semiempirical model, though it should be generally applicable to ab initio theory. The simulations show enhanced energy stability and a significantly reduced computational cost associated with the iterative solutions of both the ground state and the electronically excited states. Relaxed convergence criteria can therefore be used both for the self-consistent ground state optimization and for the iterative subspace diagonalization of the random phase approximation matrix used to calculate the excited state transitions. In conclusion, the XL-ESMD approach is expected to enable numerically efficient excited state molecular dynamics for such methods as time-dependent Hartree–Fock (TD-HF), Configuration Interactions Singles (CIS), and time-dependent density functional theory (TD-DFT).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sparsity and Nullity: Paradigms for Analysis Dictionary Learning

Sparse models in dictionary learning have been successfully applied in a wide variety of machine learning and computer vision problems, and as a result have recently attracted increased research interest. Another interesting related problem based on linear equality constraints, namely the sparse null space (SNS) problem, first appeared in 1986 and has since inspired results on sparse basis pursuit. In this work, we investigate the relation between the SNS problem and the analysis dictionary learning (ADL) problem, and show that the SNS problem plays a central role, and may be utilized to solve dictionary learning problems. Moreover, we propose an efficient algorithm of sparse null space basis pursuit (SNS-BP) and extend it to a solution of ADL. Lastly, experimental results on numerical synthetic data and real-world data are further presented to validate the performance of our method.

97 MATHEMATICS AND COMPUTING↗

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗

Uniformly decaying subspaces for error-mitigated quantum computation

Here, we present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

Compositional phase stability of strongly correlated electron materials within DFT+ U

Predicting the compositional phase stability of strongly correlated electron materials is an outstanding challenge in condensed matter physics. In this work, we employ the density functional theory plus U ( DFT + U ) formalism to address the effects of local correlations due to transition metal d electrons on compositional phase stability in the prototype phase stable and separating materials Li x CoO 2 and olivine Li x FePO 4 , respectively. We introduce a spectral decomposition of the DFT + U total energy, revealing the distinct roles of the filling and ordering of the d orbital correlated subspace. The on-site interaction U drives both of these very different materials systems towards phase separation, stemming from enhanced ordering of the d orbital occupancies in the x = 0 and x = 1 species, whereas changes in the overall filling of the d shell contribute negligibly. We show that DFT + U formation energies are qualitatively consistent with experiments for phase stable Li x CoO 2 , phase separating Li x FePO 4 , and phase stable Li x CoPO 4 . However, we find that charge ordering plays a critical role in the energetics at intermediate x , strongly dampening the tendency for the Hubbard U to drive phase separation. Most relevantly, the phase stability of Li 1 / 2 CoO 2 within DFT + U is qualitatively incorrect without allowing charge ordering, which is problematic given that neither charge ordering nor the band gap that it induces are observed in experiment. We demonstrate that charge ordering arises from the correlated subspace interaction energy as opposed to the double counting. Additionally, we predict the Li order-disorder transition temperature for Li 1 / 2 CoO 2 , demonstrating that the unphysical charge ordering within DFT + U renders the method problematic, often producing unrealistically large results. Overall, our findings motivate the need for other advanced techniques, such as DFT plus dynamical mean-field theory, for total energies in strongly correlated materials.

36 MATERIALS SCIENCE↗

Reduced-dimension Bayesian optimization for model calibration of transient vapor compression cycles

Development and calibration of first-principles dynamic models of vapor compression cycles (VCCs) is of critical importance for applications that include control design and fault detection and diagnostics. Nevertheless, the inherent complexity of models that are represented by large systems of differential–algebraic equations leads to significant challenges for model calibration processes that utilize classical gradient-based methods. Bayesian optimization (BO) is a sample-efficient and gradient-free approach using a probabilistic surrogate model and optimal search over a feasible parameter space. Despite the benefits of BO in reducing computational costs, challenges remain in dealing with a high-dimensional calibration task resulting from a large set of parameters that have significant impacts on system behavior and need to be calibrated simultaneously. This paper presents a reduced-dimension BO framework for calibrating transient VCCs models where the calibration space is projected to a low-dimensional subspace for accelerating convergence of the solution algorithm and consequently reducing the number of transient simulations. The proposed approach was demonstrated via two case studies associated with different VCC applications where 10 parameters were calibrated in each case using laboratory measurements. The reduced-dimension BO framework only required 1 / 8 th of the iterations associated with a standard BO method that deals with high-dimensional calibration parameters for converged solutions and yielded comparable accuracy. Furthermore, both calibrated models revealed significant accuracy improvements compared to uncalibrated models.

Ma, Jiacheng↗

Multiple-charge transfer and trapping in DNA dimers

We investigate the charge transfer characteristics of one and two excess charges in a DNA base-pair dimer using a model Hamiltonian approach. The electron part comprises diagonal and off-diagonal Coulomb matrix elements such a correlated hopping and the bond-bond interaction, which were recently calculated by Starikov [E. B. Starikov, Philos. Mag. Lett. 83, 699 (2003)] for different DNA dimers. The electronic degrees of freedom are coupled to an ohmic or a superohmic bath serving as dissipative environment. We employ the numerical renormalization group method in the nuclear tunneling regime and compare the results to Marcus theory for the thermal activation regime. For realistic parameters, the rate that at least one charge is transferred from the donor to the acceptor in the subspace of two excess electrons significantly exceeds the rate in the single charge sector. Moreover, the dynamics is strongly influenced by the Coulomb matrix elements. We find sequential and pair transfer as well as a regime where both charges remain self-trapped. The transfer rate reaches its maximum when the difference of the on-site and intersite Coulomb matrix element is equal to the reorganization energy which is the case in a guanine/cytosine (GC)-dimer. Charge transfer is completely suppressed for two excess electrons in adenine/thymine (AT)-dimer in an ohmic bath and replaced by damped coherent electron-pair oscillations in a superohmic bath. A finite bond-bond interaction W alters the transfer rate: it increases as function of W when the effective Coulomb repulsion exceeds the reorganization energy (inverted regime) and decreases for smaller Coulomb repulsion.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Super-resolution demodulation for fiber sensor arrays based on the MUSIC algorithm

This paper studies the use of MUltiple SIgnal Classification (MUSIC) as a super-resolution algorithm to improve demodulation results for intrinsic Fabry–Perot interferometer (IFPI) sensor arrays. Through distinction between noise and signal subspaces in an observation matrix, this paper shows that a 38-fold improvement in the full width at half maximum (FWHM) estimation of IFPI optical path differences (OPD) can be achieved using this algorithm. Based on this improved method, this paper demonstrates that a tunable laser with a 1.3-nm tuning range can achieve the same sensor demodulation performance as a tunable laser with a 50-nm tuning range if a conventional Fourier transform-based algorithm is used. This paper presents a new approach to analyzing optical signals produced by multiple multiplexed interferometers with similar OPDs with potential applications for both single-mode and multiple-mode devices.

Li, Yuqi (ORCID:0000000291643663)↗

Extraction of Tumor Site from Cancer Pathology Reports using Deep Filters

Purpose: Pathology reports are the primary source of information concerning the millions of cancer cases across the United States. Cancer registries manually process the pathology reports to extract the pertinent information including primary tumor site, behavior, histology, laterality, and grade. Processing a large volume of the pathology reports in a timely manner is a continuing challenge for cancer registries. The purpose of this study is to develop an information extraction pipeline to reliably and efficiently extract reportable information. Method: We have developed a novel inverse-regression (IR) based information extraction pipeline. The inverse-regression based supervised filter has been successfully applied to many application domains. However, its application to the information extraction from unstructured text is hindered primarily by the extreme high-dimensionality of n-gram representations of text. In this study, we attempt to overcome the obstacles by a novel bootstrapping strategy. First, we use an information-theoretic mutual information based filter to discard the excessive and redundant n-gram features. This step reduces the size and improves the condition number of the sample covariance matrix, thus reducing the computational cost and improving the numerical stability of the subsequent inverse-regression step. Then we use localized sliced inverse-regression (LSIR) to learn a low-dimensional discriminatory subspace for information inference. In particular, we use the k-nearest neighbors of an unlabeled pathology report in the learned representation to infer the desired information from the labeled data in a supervised manner. Results: The experiments were conducted on a set of de-identified pathology reports with human expert labels as the ground truth. Our pipeline consistently performed better than or comparable to the best performing state-of-the-art methods while reducing the training and inference times substantially. Conclusion: Our results demonstrate the potential of inverse-regression based information extraction pipeline for reliable and efficient information extraction from unstructured text. The information extracted from the pathology reports can be used along with clinical information, medical imaging, and genomic information to instigate discoveries in cancer research.

Dubey, Abhishek↗

NORSAR Final Scientific Report Adaptive Waveform Correlation Detectors for Arrays: Algorithms for Autonomous Calibration

Correlation detection is a relatively new approach in seismology that offers significant advantages in increased sensitivity and event screening over standard energy detection algorithms. The basic concept is that a representative event waveform is used as a template (i.e. matched filter) that is correlated against a continuous, possibly multichannel, data stream to detect new occurrences of that same signal. These algorithms are therefore effective at detecting repeating events, such as explosions and aftershocks at a specific location. This final report summarizes the results of a three-year cooperative project undertaken by NORSAR and Lawrence Livermore National Laboratory. The overall objective has been to develop and test a new advanced, automatic approach to seismic detection using waveform correlation. The principal goal is to develop an adaptive processing algorithm. By this we mean that the detector is initiated using a basic set of reference ('master') events to be used in the correlation process, and then an automatic algorithm is applied successively to provide improved performance by extending the set of master events selectively and strategically. These additional master events are generated by an independent, conventional detection system. A periodic analyst review will then be applied to verify the performance and, if necessary, adjust and consolidate the master event set. A primary focus of this project has been the application of waveform correlation techniques to seismic arrays. The basic procedure is to perform correlation on the individual channels, and then stack the correlation traces using zero-delay beam forming. Array methods such as frequency-wavenumber analysis can be applied to this set of correlation traces to help guarantee the validity of detections and lower the detection threshold. In principle, the deployment of correlation detectors against seismically active regions could involve very large numbers of very specific detectors. To meet this challenge, we have examined two strategies: (1) use of subspace detectors, a multi-dimensional extension of correlators, which allow representation and detection of signals exhibiting some degree of variation; and (2) autonomous calibration of many subspace and correlation detectors in an adaptive detection framework, subject to analyst review. Because correlation detectors are relatively new to seismology, a significant amount of research on how to tune these detectors has been needed to address later calibration efforts that will arise as they are adopted for operational use. We have approached these challenges by carrying out a number of case studies, encompassing various monitoring scenarios such as earthquake aftershock sequences and swarms, recurring mining explosions, other types of explosions, and rockbursts. We have studied several different geographical regions (the European Arctic, Central Asia, and the western United States). We have drawn on available Ground Truth data in assessing the results of the various processing schemes. In all cases, we have benefited from the high-quality seismic arrays or networks available in these regions, and we have thus been able to evaluate the performance of array-based correlation processing under a variety of conditions. The main results of the project are summarized as follows: (1) Array-based waveform correlation has been demonstrated to lower significantly detection thresholds in comparison with standard single-channel waveform correlation. (2) Frequency-wavenumber analysis of the correlation traces on a small-aperture array provides an effective method for screening out a certain category of false alarms, and can therefore be used to improve detector sensitivity by lowering the threshold for automatic array detection. (3) We have developed and tested a framework for autonomous correlation detection. The framework comprises a set of conventional (STA/LTA) detectors on a collection of array beams, augmented by correlation and subspace detectors. The detectors are applied in parallel. (4) We have experimentally tested the processing of a large aftershock sequence using various transformations of the signals from the main event to construct what we denote an incoherent correlation detector or characteristic function correlation detector. (5) An important application of multi-channel waveform correlation is to identify instances of erroneous instrumental timing. We provide examples of detected timing errors on single channels of an array, as well as on a remote three-component station.

58 GEOSCIENCES↗

Using Wannier functions to improve solid band gap predictions in density functional theory

Enforcing a straight-line condition of the total energy upon removal/addition of fractional electrons on eigen states has been successfully applied to atoms and molecules for calculating ionization potentials and electron affinities, but fails for solids due to the extended nature of the eigen orbitals. Here we have extended the straight-line condition to the removal/addition of fractional electrons on Wannier functions constructed within the occupied/unoccupied subspaces. It removes the self-interaction energies of those Wannier functions, and yields accurate band gaps for solids compared to experiments. It does not have any adjustable parameters and the computational cost is at the DFT level. This method can also work for molecules, providing eigen energies in good agreement with experimental ionization potentials and electron affinities. Our approach can be viewed as an alternative approach of the standard LDA+U procedure.

36 MATERIALS SCIENCE↗

Static subspace approximation for the evaluation of G 0 W 0 quasiparticle energies within a sum-over-bands approach

Many-body perturbation theory within the GW approach has been established as a quantitatively accurate approach for predicting the quasiparticle and excited-state properties of a wide variety of materials. However, the successful application of the method is often complicated by the computational complexity associated with the evaluation and inversion of the frequency-dependent dielectric matrix ε(ω). Here, we describe an approach to speed up the evaluation of the frequency-dependent part of ε(ω) in the traditional sum-over-states GW framework based on the low-rank approximation of the static dielectric matrix, a technique often used in GW implementations that are based on a starting mean field within density-functional perturbation theory. We show that the overall accuracy of the approach, independently from other calculation parameters, is solely determined by the threshold on the eigenvalues of the static dielectric matrix, ε(ω = 0) , and that it can yield orders-of-magnitude speed-ups in full-frequency G W calculations. In this work, we validate our implementation with several benchmark calculations ranging from bulk materials to systems with reduced dimensionality, and show that this technique allows one not only to study larger systems, but also to carefully consider the convergence of computationally demanding systems, such as ZnO, without relying on plasmon-pole models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fast Hyperspectral Neutron Tomography

Hyperspectral neutron computed tomography is a tomographic imaging technique in which thousands of wavelength-specific neutron radiographs are measured for each tomographic view. In conventional hyperspectral reconstruction, data from each neutron wavelength bin are reconstructed separately, which is extremely time-consuming. These reconstructions often suffer from poor quality due to low signal-to-noise ratios. Consequently, material decomposition based on these reconstructions tends to produce inaccurate estimates of the material spectra and erroneous volumetric material separation. In this paper, we present two novel algorithms for processing hyperspectral neutron data: fast hyperspectral reconstruction and fast material decomposition. Both algorithms rely on a subspace decomposition procedure that transforms hyperspectral views into low-dimensional projection views within an intermediate subspace, where tomographic reconstruction is performed. The use of subspace decomposition dramatically reduces reconstruction time while reducing both noise and reconstruction artifacts. We apply our algorithms to both simulated and measured neutron data and demonstrate that they reduce computation and improve the quality of the results relative to conventional methods.

Chowdhury, Mohammad Samin Nur [Purdue University]↗