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 253 records · Page 14

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

Hydrogen-like atom in a superstrong magnetic field: Photon emission and relativistic energy level shift

Following our previous work, additional arguments are presented that in superstrong magnetic fields B ≫ (Zα){sup 2}B{sub 0}, B{sub 0} = m{sup 2}c{sup 3}/eħ ≈ 4.41 × 10{sup 13} G, the Dirac equation and the Schrödinger equation for an electron in the nucleus field following from it become spatially one-dimensional with the only z coordinate along the magnetic field, “Dirac” spinors become two-component, while the 2 × 2 matrices operate in the {0; 3} subspace. Based on the obtained solution of the Dirac equation and the known solution of the “onedimensional” Schrödinger equation by ordinary QED methods extrapolated to the {0; 3} subspace, the probability of photon emission by a “one-dimensional” hydrogen-like atom is calculated, which, for example, for the Lyman-alpha line differs almost twice from the probability in the “three-dimensional” case. Similarly, despite the coincidence of nonrelativistic energy levels, the calculated relativistic corrections of the order of (Zα){sup 4} substantially differ from corrections in the absence of a magnetic field. A conclusion is made that, by analyzing the hydrogen emission spectrum and emission spectra at all, we can judge in principle about the presence or absence of superstrong magnetic fields in the vicinity of magnetars (neutron stars and probably brown dwarfs). Possible prospects of applying the proposed method for calculations of multielectron atoms are pointed out and the possibility of a more reliable determination of the presence of superstrong magnetic fields in magnetars by this method is considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digital quantum computation of fermion-boson interacting systems

We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Accelerating Markov chain Monte Carlo simulation by differential evolution with self-adaptive randomized subspace sampling

Markov chain Monte Carlo (MCMC) methods have found widespread use in many fields of study to estimate the average properties of complex systems, and for posterior inference in a Bayesian framework. Existing theory and experiments prove convergence of well constructed MCMC schemes to the appropriate limiting distribution under a variety of different conditions. In practice, however this convergence is often observed to be disturbingly slow. This is frequently caused by an inappropriate selection of the proposal distribution used to generate trial moves in the Markov Chain. Here we show that significant improvements to the efficiency of MCMC simulation can be made by using a self-adaptive Differential Evolution learning strategy within a population-based evolutionary framework. This scheme, entitled DiffeRential Evolution Adaptive Metropolis or DREAM, runs multiple different chains simultaneously for global exploration, and automatically tunes the scale and orientation of the proposal distribution in randomized subspaces during the search. Ergodicity of the algorithm is proved, and various examples involving nonlinearity, high-dimensionality, and multimodality show that DREAM is generally superior to other adaptive MCMC sampling approaches. The DREAM scheme significantly enhances the applicability of MCMC simulation to complex, multi-modal search problems.

97 MATHEMATICS AND COMPUTING↗

Electrostatics of proteins in dielectric solvent continua. II. Hamiltonian reaction field dynamics

In Paper I of this work [S. Bauer, G. Mathias, and P. Tavan, J. Chem. Phys. 140, 104102 (2014)] we have presented a reaction field (RF) method, which accurately solves the Poisson equation for proteins embedded in dielectric solvent continua at a computational effort comparable to that of polarizable molecular mechanics (MM) force fields. Building upon these results, here we suggest a method for linearly scaling Hamiltonian RF/MM molecular dynamics (MD) simulations, which we call “Hamiltonian dielectric solvent” (HADES). First, we derive analytical expressions for the RF forces acting on the solute atoms. These forces properly account for all those conditions, which have to be self-consistently fulfilled by RF quantities introduced in Paper I. Next we provide details on the implementation, i.e., we show how our RF approach is combined with a fast multipole method and how the self-consistency iterations are accelerated by the use of the so-called direct inversion in the iterative subspace. Finally we demonstrate that the method and its implementation enable Hamiltonian, i.e., energy and momentum conserving HADES-MD, and compare in a sample application on Ac-Ala-NHMe the HADES-MD free energy landscape at 300 K with that obtained in Paper I by scanning of configurations and with one obtained from an explicit solvent simulation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nuclear-norm-based Subspace Identification of Multi-Zone Building HVAC System

There have been many attempts to reduce the uncertainty associated with renewable energy. This paper aims to contribute to the field by considering the building heating, ventilation and air conditioning (HVAC) system, which is treated as flexible load. The control of the indoor temperature in the building employing the locally generated renewable energy has been carried out with both model-based and data-driven approaches. Although numerous efforts have been made in the area of construction of a model for the building HVAC system, almost all models have shortcomings. A building model that is locally accurate is required to be able to predict the load consumption in the future. This will benefit both the utility companies and building managers to estimate the upcoming load shape, especially the peak amount and duration. We consider the case of a multi-zone building HVAC system, i.e., each zone has its own thermostat and can be set to a different temperature. Based on our need for a multi-zone model that is locally accurate, we resort to the method of system identification. In particular, we will employ the nuclear norm based subspace identification method.

Telsang, Bhagyashri↗

A new classification scheme of plastic wastes based upon recycling labels

Highlights: • PET, HPDE or PP types of plastics are considered. • An automated classification of plastic bottles based on the feature extraction and classification methods is performed. • The decision mechanism consists of PCA, Kernel PCA, FLDA, SVD and Laplacian Eigenmaps methods. • SVM is selected to achieve the classification task and majority voting technique is used. - Abstract: Since recycling of materials is widely assumed to be environmentally and economically beneficial, reliable sorting and processing of waste packaging materials such as plastics is very important for recycling with high efficiency. An automated system that can quickly categorize these materials is certainly needed for obtaining maximum classification while maintaining high throughput. In this paper, first of all, the photographs of the plastic bottles have been taken and several preprocessing steps were carried out. The first preprocessing step is to extract the plastic area of a bottle from the background. Then, the morphological image operations are implemented. These operations are edge detection, noise removal, hole removing, image enhancement, and image segmentation. These morphological operations can be generally defined in terms of the combinations of erosion and dilation. The effect of bottle color as well as label are eliminated using these operations. Secondly, the pixel-wise intensity values of the plastic bottle images have been used together with the most popular subspace and statistical feature extraction methods to construct the feature vectors in this study. Only three types of plastics are considered due to higher existence ratio of them than the other plastic types in the world. The decision mechanism consists of five different feature extraction methods including as Principal Component Analysis (PCA), Kernel PCA (KPCA), Fisher’s Linear Discriminant Analysis (FLDA), Singular Value Decomposition (SVD) and Laplacian Eigenmaps (LEMAP) and uses a simple experimental setup with a camera and homogenous backlighting. Due to the giving global solution for a classification problem, Support Vector Machine (SVM) is selected to achieve the classification task and majority voting technique is used as the decision mechanism. This technique equally weights each classification result and assigns the given plastic object to the class that the most classification results agree on. The proposed classification scheme provides high accuracy rate, and also it is able to run in real-time applications. It can automatically classify the plastic bottle types with approximately 90% recognition accuracy. Besides this, the proposed methodology yields approximately 96% classification rate for the separation of PET or non-PET plastic types. It also gives 92% accuracy for the categorization of non-PET plastic types into HPDE or PP.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Dynamical eightfold way mesons in strongly coupled lattice QCD

We consider a 3+1 lattice QCD model with three quark flavors, local SU(3){sub c} gauge symmetry, global SU(3){sub f} flavor symmetry, in an imaginary-time formulation and with strong coupling (a small hopping parameter {kappa}>0 and a plaquette coupling {beta}>0, 0<{beta}<<{kappa}<<1). Associated with the model there is an underlying physical quantum mechanical Hilbert space H which, via a Feynman-Kac formula, enables us to derive spectral representations for correlations and obtain the low-lying energy-momentum spectrum exactly. Using the decoupling of hyperplane method and concentrating on the subspace H{sub e} subset of H of vectors with an even number of quarks, we obtain the one-particle spectrum showing the existence of 36 meson states from dynamical first principles, i.e. directly from the quark-gluon dynamics. The particles are detected by isolated dispersion curves w(p-vector) in the energy-momentum spectrum. Besides the SU(3){sub f} quantum numbers (total hypercharge, quadratic Casimir C{sub 2}, total isospin and its 3rd component), the basic excitations also carry spin labels. The total spin operator J and its z-component J{sub z} are defined using {pi}/2 rotations about the spatial coordinate axes and agree with the infinitesimal generators of the continuum for improper zero-momentum meson states. The eightfold way meson particles are given by linear combinations of these 36 states and can be grouped into three SU(3){sub f} nonets associated with the vector mesons (J=1, J{sub z}=0, {+-}1) and one nonet associated with the pseudoscalar mesons (J=0). Each nonet admits a further decomposition into a SU(3){sub f} singlet (C{sub 2}=0) and an octet (C{sub 2}=3). For {beta}=0, the particle dispersion curves are all of the form w(p-vector)=-2ln{kappa}-3{kappa}{sup 2}/2+(1/4){kappa}{sup 2}{sub j=1}{sup 3}2(1-cosp{sup j})+{kappa}{sup 4}r({kappa},p-vector), with p-vector(set-membership sign)(-{pi},{pi}]{sup 3} and |r({kappa},p-vector)|{<=}const. For the pseudoscalar mesons, r({kappa},p-vector) is jointly analytic in {kappa} and p{sup j}, for |{kappa}| and |Imp{sup j}| small. At {beta}=0 the meson masses are given by m({kappa})=-2ln{kappa}-3{kappa}{sup 2}/2+{kappa}{sup 4}r({kappa}), with r(0){ne}0 and r({kappa}) real analytic; for {beta}{ne}0 the nonsingular part of the mass, m({kappa},{beta})+2ln{kappa}, is jointly analytic in {kappa} and {beta}. For a fixed nonet, the mass of the vector mesons are independent of J{sub z} and are all equal within each octet. All singlet masses are also equal for the vector mesons. For {beta}=0, up to and including O({kappa}{sup 4}), for each nonet, the masses of the octet and the singlet are found to be equal. All members of each octet have identical dispersions. Other dispersion curves may differ. Indeed, there is a pseudoscalar, vector meson mass splitting (between J=0 and J=1) given by 2{kappa}{sup 4}+O({kappa}{sup 6}) at {beta}=0, analytic in {beta} and the splitting persists for {beta}<<{kappa}. Using a correlation subtraction method, we show the 36 meson states give the only spectrum in H{sub e} up to near the two-meson threshold of {approx_equal}-4ln{kappa}. Combining our present result with a similar one for baryons (of asymptotic mass -3ln{kappa}) shows that the model does exhibit confinement up to near the two-meson threshold.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning physics-based reduced-order models from data using nonlinear manifolds

Here we present a novel method for learning reduced-order models of dynamical systems using nonlinear manifolds. First, we learn the manifold by identifying nonlinear structure in the data through a general representation learning problem. The proposed approach is driven by embeddings of low-order polynomial form. A projection onto the nonlinear manifold reveals the algebraic structure of the reduced-space system that governs the problem of interest. The matrix operators of the reduced-order model are then inferred from the data using operator inference. Numerical experiments on a number of nonlinear problems demonstrate the generalizability of the methodology and the increase in accuracy that can be obtained over reduced-order modeling methods that employ a linear subspace approximation.

97 MATHEMATICS AND COMPUTING↗

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #BQP-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

97 MATHEMATICS AND COMPUTING↗

Decoherence-free neutron interferometry

Perfect single-crystal neutron interferometers are adversely sensitive to environmental disturbances, particularly mechanical vibrations. The sensitivity to vibrations results from the slow velocity of thermal neutrons and the long measurement time that are encountered in a typical experiment. Consequently, to achieve a good interference solutions for reducing vibration other than those normally used in optical experiments must be explored. Here we introduce a geometry for a neutron interferometer that is less sensitive to low-frequency vibrations. This design may be compared with both dynamical decoupling methods and decoherence-free subspaces that are described in quantum information processing. By removing the need for bulky vibration isolation setups, this design will make it easier to adopt neutron interferometry to a wide range of applications and increase its sensitivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emulating ab initio computations of infinite nucleonic matter

We construct efficient emulators for the computation of the infinite nuclear matter equation of state. These emulators are based on the subspace-projected coupled-cluster method for which we here develop a new algorithm called small-batch voting to eliminate spurious states that might appear when emulating quantum many-body methods based on a non-Hermitian Hamiltonian. The efficiency and accuracy of these emulators facilitate a rigorous statistical analysis within which we explore nuclear matter predictions for > 10 6 different parametrizations of a chiral interaction model with explicit Δ -isobars at next-to-next-to leading order. Constrained by nucleon-nucleon scattering phase shifts and bound-state observables of light nuclei up to He 4 , we use history matching to identify nonimplausible domains for the low-energy coupling constants of the chiral interaction. Within these domains we perform a Bayesian analysis using sampling and importance resampling with different likelihood calibrations and study correlations between interaction parameters, calibration observables in light nuclei, and nuclear matter saturation properties. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An efficient design sensitivity analysis of eigenvectors

Subspace iteration has been a major advance in solving large eigen problems when only a subset of eigen-pairs is required. The essence of this method is a transformation from displacement coordinates of an n-th order eigensystem to generalized coordinates of a smaller q-th order. The eigenvalue problem is then solved in the reduced space. The method was first developed by Clint and Jennings for real symmetric systems and was then called 'simultaneous iteration'. The success of the method prompted further research along this line and there have been many improved algorithms developed. This approach has been widely used by structural engineers for extracting the most useful natural frequencies and mode shapes of large-scale dynamic systems. This paper exploits into a new direction which is in the form of iterative process for simultaneously calculating eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from preceding eigenvalue solution and, thus, effectively economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in subspace iteration method. There is no expensive large matrix decomposition required and the process converges to acceptable solution in a finite number of iterations. Therefore, the procedure increases its efficiency superiority over the others as the system size or the number of interested eigenvectors become larger and larger.

Ting, T.↗

Space&ndash;Time Least-Squares Petrov&ndash;Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗

A new method to real-normalize measured complex modes

A time domain subspace iteration technique is presented to compute a set of normal modes from the measured complex modes. By using the proposed method, a large number of physical coordinates are reduced to a smaller number of model or principal coordinates. Subspace free decay time responses are computed using properly scaled complex modal vectors. Companion matrix for the general case of nonproportional damping is then derived in the selected vector subspace. Subspace normal modes are obtained through eigenvalue solution of the (M sub N) sup -1 (K sub N) matrix and transformed back to the physical coordinates to get a set of normal modes. A numerical example is presented to demonstrate the outlined theory.

Wei, Max L.↗

Stochastic Least-Squares Petrov--Galerkin Method for Parameterized Linear Systems

We consider the numerical solution of parameterized linear systems where the system matrix, the solution, and the right-hand side are parameterized by a set of uncertain input parameters. We explore spectral methods in which the solutions are approximated in a chosen finite-dimensional subspace. It has been shown that the stochastic Galerkin projection technique fails to minimize any measure of the solution error [A. Mugler and H.-J. Starkloff, ESAIM Math. Model. Numer. Anal., 47 (2013), pp. 1237--1263]. As a remedy for this, we propose a novel stochatic least-squares Petrov--Galerkin (LSPG) method. The proposed method is optimal in the sense that it produces the solution that minimizes a weighted $\ell^2$-norm of the residual over all solutions in a given finite-dimensional subspace. Moreover, the method can be adapted to minimize the solution error in different weighted $\ell^2$-norms by simply applying a weighting function within the least-squares formulation. In addition, a goal-oriented seminorm induced by an output quantity of interest can be minimized by defining a weighting function as a linear functional of the solution. We establish optimality and error bounds for the proposed method, and extensive numerical experiments show that the weighted LSPG method outperforms other spectral methods in minimizing corresponding target weighted norms.

97 MATHEMATICS AND COMPUTING↗

Cross-Domain Recognition by Identifying Joint Subspaces of Source Domain and Target Domain

This paper introduces here a new method to solve the cross-domain recognition problem. Different from the traditional domain adaption methods which rely on a global domain shift for all classes between the source and target domains, the proposed method is more flexible to capture individual class variations across domains. By adopting a natural and widely used assumption that the data samples from the same class should lay on an intrinsic low-dimensional subspace, even if they come from different domains, the proposed method circumvents the limitation of the global domain shift, and solves the cross-domain recognition by finding the joint subspaces of the source and target domains. Specifically, given labeled samples in the source domain, we construct a subspace for each of the classes. Then we construct subspaces in the target domain, called anchor subspaces, by collecting unlabeled samples that are close to each other and are highly likely to belong to the same class. The corresponding class label is then assigned by minimizing a cost function which reflects the overlap and topological structure consistency between subspaces across the source and target domains, and within the anchor subspaces, respectively. We further combine the anchor subspaces to the corresponding source subspaces to construct the joint subspaces. Subsequently, one-versus-rest support vector machine classifiers are trained using the data samples belonging to the same joint subspaces and applied to unlabeled data in the target domain. We evaluate the proposed method on two widely used datasets: 1) object recognition dataset for computer vision tasks and 2) sentiment classification dataset for natural language processing tasks. Comparison results demonstrate that the proposed method outperforms the comparison methods on both datasets.

97 MATHEMATICS AND COMPUTING↗

Application of an efficient generator-coordinate subspace-selection algorithm to neutrinoless double- β decay

The generator coordinate method begins with the variational construction of a set of nonorthogonal mean-field states that span a subspace of the full many-body Hilbert space. These states are then often projected onto states with good quantum numbers to restore symmetries, leading to a set with members that can be similar to one another, and it is sometimes possible to reduce this set without greatly affecting results. Here, we propose a greedy algorithm that we call the energy-transition-orthogonality procedure (ENTROP) to select subsets of important states. As applied here, the approach selects on the basis of diagonal energy, orthogonality, and contribution to the matrix element that governs neutrinoless double-β decay. We present both shell-model and preliminary ab initio calculations of this matrix element for the decay of 76Ge, with quadrupole deformation parameters and the isoscalar pairing strength as generator coordinates. ENTROP converges quickly, reducing significantly the number of basis states needed for an accurate calculation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗