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 181 records · Page 10

A discussion on the origin of quantum probabilities

We study the origin of quantum probabilities as arising from non-Boolean propositional-operational structures. We apply the method developed by Cox to non distributive lattices and develop an alternative formulation of non-Kolmogorovian probability measures for quantum mechanics. By generalizing the method presented in previous works, we outline a general framework for the deduction of probabilities in general propositional structures represented by lattices (including the non-distributive case). -- Highlights: •Several recent works use a derivation similar to that of R.T. Cox to obtain quantum probabilities. •We apply Cox’s method to the lattice of subspaces of the Hilbert space. •We obtain a derivation of quantum probabilities which includes mixed states. •The method presented in this work is susceptible to generalization. •It includes quantum mechanics and classical mechanics as particular cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

Reduced-basis method for few-body bound-state emulation

Recent advances in both theoretical and computational methods have enabled large-scale, precision calculations of the properties of atomic nuclei. With the growing complexity of modern nuclear theory, however, also comes the need for novel methods to perform systematic studies and quantify the uncertainties of models when confronted with experimental data. Here, this study presents an application of such an approach, the reduced basis method, to substantially lower computational costs by constructing a significantly smaller Hamiltonian subspace informed by previous solutions. Our method shows comparable efficiency and accuracy to other dimensionality reduction techniques on an artificial three-body bound system while providing a richer representation of physical information in its projection and training subspace. This methodological advancement can be applied in other contexts and has the potential to greatly improve our ability to systematically explore theoretical models and thus enhance our understanding of the fundamental properties of nuclear systems.

cluster models↗

Semivariational approach to QCD at finite temperature and baryon density

Recently a new bosonization method has been used to derive, at zero fermion density, an effective action for relativistic field theories whose partition function is dominated by fermionic composites, chiral mesons in the case of QCD. This approach shares two important features with variational methods: the restriction to the subspace of the composites, and the determination of their structure functions by a variational calculation. But unlike standard variational methods it treats excited states on the same footing as the ground state. I show that this bosonization method is an approximation of an exact procedure in which composites are introduced in the presence of fermionic states with the quantum numbers of the constituents (quasiparticles). This procedure consists of an independent Bogoliubov transformation at each time slice. The time-dependent parameters of the transformation are then associated with composite fields. In this way states of nonvanishing fermion (baryon) number (neglected in the bosonization approach) are retained. By the exact procedure I derive an effective action for QCD at finite temperature and baryon density. I test the result on a four-fermion interaction model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

Basis adaptation in homogeneous chaos spaces

We present a new method for the characterization of subspaces associated with low-dimensional quantities of interest (QoI). The probability density function of these QoI is found to be concentrated around one-dimensional subspaces for which we develop projection operators. Our approach builds on the properties of Gaussian Hilbert spaces and associated tensor product spaces.

97 MATHEMATICS AND COMPUTING↗

Projected Commutator DIIS Method for Accelerating Hybrid Functional Electronic Structure Calculations

The commutator direct inversion of the iterative subspace (commutator DIIS or C-DIIS) method developed by Pulay is an efficient and the most widely used scheme in quantum chemistry to accelerate the convergence of self-consistent field (SCF) iterations in Hartree–Fock theory and Kohn–Sham density functional theory. The C-DIIS method requires the explicit storage of the density matrix, the Fock matrix, and the commutator matrix. Hence, the method can only be used for systems with a relatively small basis set, such as the Gaussian basis set. We develop a new method that enables the C-DIIS method to be efficiently employed in electronic structure calculations with a large basis set such as planewaves for the first time. The key ingredient is the projection of both the density matrix and the commutator matrix to an auxiliary matrix called the gauge-fixing matrix. The resulting projected commutator-DIIS method (PC-DIIS) only operates on matrices of the same dimension as that consists of Kohn–Sham orbitals. The cost of the method is comparable to that of standard charge mixing schemes used in large basis set calculations. The PC-DIIS method is gauge-invariant, which guarantees that its performance is invariant with respect to any unitary transformation of the Kohn–Sham orbitals. We demonstrate that the PC-DIIS method can be viewed as an extension of an iterative eigensolver for nonlinear problems. We use the PC-DIIS method for accelerating Kohn–Sham density functional theory calculations with hybrid exchange–correlation functionals, and demonstrate its superior performance compared to the commonly used nested two-level SCF iteration procedure. Furthermore, we demonstrate that in the context of ab initio molecular dynamics (MD) simulation with hybrid functionals one can extrapolate the gauge-fixing matrix to achieve the goal of extrapolating the entire density matrix implicitly along the MD trajectory. Here, numerical results indicate that the new method significantly reduces the number of SCF iterations per MD step, compared to the commonly used strategy of extrapolating the electron density.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Further Investigation of Employing Binomial Small-Sample Estimator in M-LROM

Reduced Order Modeling (ROM) is essential to enable the identification of the so-called active parameter subspace for high-fidelity models that are employed in computationally intensive analyses such as uncertainty characterization and data assimilation. Given the complexity of models for real-world application, brute force methods to identify the active subspace may not be computationally efficient to realize the value of reduction, since in realistic problems, the full scale model must be executed few hundred times, which may be computationally taxing. Earlier work has introduced a new approach, which represents a further development of our previous work on ROM, referred to as multi-level ROM (M-LROM). In M-LROM, approximate models are employed to identify the active subspace instead of the full scale model. In this summary, we present our recent results on M-LROM, specifically in regard to the construction of reliable error metrics that can bound the errors resulting from the reduction. The idea is to employ a lower fidelity model, i.e., an approximation of the full scale or high fidelity model, to build the active subspace, and via the proposed error bound, the quality of the active subspace can be determined by calculating an upper bound on the errors resulting from the reduction. For this approach to be practical, the error bound must be realistic, implying that it should be close to the actual errors expected, and not much higher. Therefore, an important goal of this summary is to compare different error bounds in terms of the relation between their estimated bounds to the actual errors. In particular, we compare the proposed error bound which numerically construct an estimator using binomial distribution to the widely used small-sample norm estimators. Unlike most probabilistic error estimation methods, the proposed bound employs a binomial distribution to construct the estimator whereas in other conventional methods, the distribution employed is typically the standard Gaussian, normalized over a unit hypersphere as initially proposed by the seminal paper of J. Dixon on random matrix theory. Previous publications provided evidence that the binomial distribution calculates more realistic bounds as compared to the Gaussian distribution, which tends to be conservative, implying that the bound is much bigger than the actual errors, which diminishes the value of the reduction, as now must increase the size of the active subspace to reach the desired upper bound on the reduction errors. This work has provided a rigorous approach by which error bounds on the reduction errors can be established without having to execute the high fidelity model during the construction of the active subspace. The high fidelity model is only need to test the error bound using small number of executions. This methodology paves the way for a more efficient application of ROM to complex engineering models, where standard ROM techniques may be too taxing to optimally realize their value in practical situations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

Global Sensitivity Analysis of Bulk Properties of an Atomic Nucleus

We perform a global sensitivity analysis of the binding energy and the charge radius of the nucleus 16 O to identify the most influential low-energy constants in the next-to-next-to-leading order chiral Hamiltonian with two- and three-nucleon forces. For this purpose, we develop a subspace-projected coupled-cluster method using eigenvector continuation [Frame D. et al., Phys. Rev. Lett. 121, 032501 (2018)]. With this method, we compute the binding energy and charge radius of 16 O at more than 106 different values of the 16 low-energy constants in one hour on a standard laptop computer. For relatively small subspace projections, the root-mean-square error is about 1% compared to full-space coupled-cluster results. We find that 58(1)% of the variance in energy can be apportioned to a single contact term in the 3 S 1 wave, whereas the radius depends sensitively on several low-energy constants and their higher-order correlations. The results identify the most important parameters for describing nuclear saturation and help prioritize efforts for uncertainty reduction of theoretical predictions. The achieved acceleration opens up an array of computational statistics analyses of the underlying description of the strong nuclear interaction in nuclei across the Segrè chart.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Adaptive h -refinement for reduced-order models: ADAPTIVE h -refinement for reduced-order models

Our work presents a method to adaptively refine reduced-order models a posteriori without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive h-refinement: it enriches the reduced-basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive k-means clustering of the state variables using snapshot data. This method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an output quantity of interest. The resulting method generates a hierarchy of subspaces online without requiring large-scale operations or full-order-model solves. Furthermore, it enables the reduced-order model to satisfy any prescribed error tolerance regardless of its original fidelity, as a completely refined reduced-order model is mathematically equivalent to the original full-order model. Experiments on a parameterized inviscid Burgers equation highlight the ability of the method to capture phenomena (e.g., moving shocks) not contained in the span of the original reduced basis.

42 ENGINEERING↗

SCONCE : a cosmic web finder for spherical and conic geometries

The latticework structure known as the cosmic web provides a valuable insight into the assembly history of large-scale structures. Despite the variety of methods to identify the cosmic web structures, they mostly rely on the assumption that galaxies are embedded in a Euclidean geometric space. Here, we present a novel cosmic web identifier called SCONCE (Spherical and CONic Cosmic wEb finder) that inherently considers the 2D (RA, DEC) spherical or the 3D (RA, DEC, z) conic geometry. The proposed algorithms in sconce generalize the well-known subspace constrained mean shift (SCMS) method and primarily address the predominant filament detection problem. They are intrinsic to the spherical/conic geometry and invariant to data rotations. We further test the efficacy of our method with an artificial cross-shaped filament example and apply it to the SDSS galaxy catalogue, revealing that the 2D spherical version of our algorithms is robust even in regions of high declination. Finally, using N-body simulations from Illustris, we show that the 3D conic version of our algorithms is more robust in detecting filaments than the standard SCMS method under the redshift distortions caused by the peculiar velocities of haloes. Our cosmic web finder is packaged in python as SCONCE-SCMS and has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗