Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EIGENVECTOR”

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 487 records · Page 27

Plant phylogenetic history explains in-stream decomposition at a global scale

1. Evolutionary history and adaptation to climate shape plant traits. Some include leaf traits that influence litter quality. As a result, evolutionary history should affect litter decomposition, a crucial ecosystem process. In addition, litter decomposition is directly influenced by climate. Similarly, we expect plant phylogeny, adaptation and climate to jointly influence litter decomposition. These effects and their interactions have yet to be untangled at a global scale. 2. Here we introduce an analysis of variation in litter decomposition rates in rivers and streams across 285 published studies for 239 species (from ferns to angiosperms) distributed at 494 locations world-wide. We estimated the relative contributions of climatic conditions and phylogenetic heritage on litter decomposition rates, partitioning phylogenetic from climatic effects at the site and species levels using phylogenetic eigenvector analysis and phylogenetic linear mixed models. In addition, we modelled transitions in decomposition rates under a suite of multiple adaptive-regime Ornstein–Uhlenbeck models to test the hypothesis that natural selection has shaped clade-level litter decomposition rates. 3. Leaf litter decomposition rate exhibited a significant phylogenetic signal. Modelling decomposition rate as a function of location, climatic niche and phylogeny consistently recovered phylogeny alone as one of the top models in species-level analyses. Since many previous studies have focused on the same species across many locations, we also conducted analyses at the species × site level. Both phylogenetic and climatic factors were favoured in models of this analysis, but the single most important predictor for angiosperms and for all taxa analysed together was phylogeny alone. 4. Synthesis. For plant species distributed globally at nearly 500 locations we found that plant phylogenetic history is a critically important predictor of litter decomposition rate in rivers and streams, explaining more of the variance in decomposition than site or climatic regime. Thus, our study demonstrates the influence of evolutionary history on suites of plant traits that shape a key ecosystem process.

54 ENVIRONMENTAL SCIENCES↗

A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems

Polynomial filtering can provide a highly effective means of computing all eigenvalues of a real symmetric (or complex Hermitian) matrix that are located in a given interval, anywhere in the spectrum. This paper describes a technique for tackling this problem by combining a thick-restart version of the Lanczos algorithm with deflation ("locking'') and a new type of polynomial filter obtained from a least-squares technique. Furthermore, the resulting algorithm can be utilized in a “spectrum-slicing” approach whereby a very large number of eigenvalues and associated eigenvectors of the matrix are computed by extracting eigenpairs located in different subintervals independently from one another.

97 MATHEMATICS AND COMPUTING↗

Two-Level Convergence Theory for Multigrid Reduction in Time (MGRIT)

Here we develop a two-grid convergence theory for the parallel-in-time scheme known as multigrid reduction in time (MGRIT), as it is implemented in the open-source package [XBraid: Parallel Multigrid in Time, http://llnl.gov/casc/xbraid]. MGRIT is a scalable and multilevel approach to parallel-in-time simulations that nonintrusively uses existing time-stepping schemes, and in a specific two-level setting it is equivalent to the widely known parareal algorithm. The goal of this paper is twofold. First, we present a two-level MGRIT convergence analysis for linear problems where the spatial discretization matrix can be diagonalized, and then apply this analysis to our two basic model problems, the heat equation and the advection equation. One important assumption is that the coarse and fine time-grid propagators can be diagaonalized by the same set of eigenvectors, which is often the case when the same spatial discretization operator is used on the coarse and fine time grids. In many cases, the MGRIT algorithm is guaranteed to converge, and we demonstrate numerically that the theoretically predicted convergence rates are sharp in practice for our model problems. Second, we explore how the convergence of MGRIT compares to the stability of the chosen time-stepping scheme. In particular, we demonstrate that a stable time-stepping scheme does not necessarily imply convergence of MGRIT, although MGRIT with FCF-relaxation always converges for the diffusion dominated problems considered here.

97 MATHEMATICS AND COMPUTING↗

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on the interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.

58 GEOSCIENCES↗

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗

Fourier Analyses of High-Order Continuous and Discontinuous Galerkin Methods

In this paper, we present a Fourier analysis of wave propagation problems subject to a class of continuous and discontinuous discretizations using high-degree Lagrange polynomials. This allows us to obtain explicit analytical formulas for the dispersion relation and group velocity and, for the first time to our knowledge, characterize analytically the emergence of gaps in the dispersion relation at specific wavenumbers, when they exist, and compute their specific locations. Wave packets with energy at these wavenumbers will fail to propagate correctly, leading to significant numerical dispersion. We also show that the Fourier analysis generates mathematical artifacts, and we explain how to remove them through a branch selection procedure conducted by analysis of eigenvectors and associated reconstructed solutions. The higher frequency eigenmodes, named erratic in this study, are also investigated analytically and numerically.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗

Improved unconstrained energy functional method for eigensolvers in electronic structure calculations

This paper reports on the performance of a preconditioned conjugate gradient based iterative eigensolver using an unconstrained energy functional minimization scheme. In contrast to standard implementations, this scheme avoids an explicit reorthogonalization of the trial eigenvectors and becomes an attractive alternative for the solution of very large problems. The unconstrained formulation is implemented in the first-principles materials and chemistry CP2K code, which performs electronic structure calculations based on a density functional theory approximation to the solution of the many-body Schrödinger equation. We study the convergence of the unconstrained formulation, as well as its parallel scaling, on a Cray XC40 at the National Energy Research Scientific Computing Center (NERSC). The systems we use in our studies are bulk liquid water, a supramolecular catalyst gold(III)-complex, a bilayer of MoS2-WSe2 and a divacancy point defect in silicon, with the number of atoms ranging from 2,247 to 12,288. We show that the unconstrained formulation with an appropriate preconditioner has good convergence properties and scales well to 230k cores, roughly 38% of the full machine.

Del Ben, M↗

Bethe-Salpeter Eigenvalue Solver Package (BSEPACK) v0.1

The BSEPACK contains a set of subroutines for solving the Bethe-Salpeter Eigenvalue (BSE) problem. This type of problem arises in this study of optical excitation of nanoscale materials. The BSE problem is a structured non-Hermitian eigenvalue problem. The BSEPACK software can be used to compute all or subset of eigenpairs of a BSE Hamiltonian. It can also be used to compute the optical absorption spectrum without computing BSE eigenvalues and eigenvectors explicitly. The package makes use of the ScaLAPACK, LAPACK and BLAS.

SHAO, MEIYUE↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

Coupled Cluster Downfolding Theory: towards universal many-body algorithms for dimensionality reduction of composite quantum systems in chemistry and materials science

Abstract The recently introduced coupled cluster (CC) downfolding techniques for reducing the dimensionality of quantum many-body problems recast the CC formalism in the form of the renormalization procedure allowing, for the construction of effective (or downfolded) Hamiltonians in small-dimensionality sub-space, usually identified with the so-called active space, of the entire Hilbert space. The resulting downfolded Hamiltonians integrate out the external (out-of-active-space) Fermionic degrees of freedom from the internal (in-the-active-space) parameters of the wave function, which can be determined as components of the eigenvectors of the downfolded Hamiltonians in the active space. This paper will discuss the extension of non-Hermitian (associated with standard CC formulations) and Hermitian (associated with the unitary CC approaches) downfolding formulations to composite quantum systems commonly encountered in materials science and chemistry. The non-Hermitian formulation can provide a platform for developing local CC approaches, while the Hermitian one can serve as an ideal foundation for developing various quantum computing applications based on the limited quantum resources. We also discuss the algorithm for extracting the semi-analytical form of the inter-electron interactions in the active spaces.

Bauman, Nicholas P.↗

Optimal damping profile ratios for stabilization of perfectly matched layers in general anisotropic media

Conventional perfectly matched layers (PML) can be unstable for certain kinds of anisotropic media. Multi-axial PML removes such instability using nonzero damping coe cients in the directions tangential with the PML interface. While using non-zero damping pro le ratios can stabilize PML, it is important to obtain the smallest possible damping pro le ratios to minimize arti cial re ections caused by these non-zero ratios, particularly for 3D general anisotropic media. Using the eigenvectors of the PML system matrix, we develop a straightforward and e cient numerical algorithm to determine the optimal damping pro le ratios to stabilize PML in 2D and 3D general anisotropic media. Numerical examples show that our algorithm provides optimal damping pro le ratios to ensure the stability of PML and complex-frequency-shifted PML for elastic-wave modeling in 2D and 3D general anisotropic media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

An experimental and computational investigation of the structure and spectroscopic signatures of α -UO 3

α-UO 3 is a common intermediate compound found in the nuclear fuel cycle, yet the exact crystal structure of this material has long been debated. Inconsistent computational and experimental data in previous works has led to varying conclusions between authors. Furthermore, to ensure the validity of our results in this work, the structural and spectroscopic signatures of pure phase α-UO 3 are investigated using powder X-ray diffraction and optical vibrational spectroscopy (infrared and Raman). Rietveld refinement of powder X-ray diffraction data on pure phase α-UO 3 collected in this work allows us to propose an alteration to the currently accepted C2mm structure (a = 3.9705 Å, b = 6.8553 Å, c = 4.15955 Å, α = β = γ = 90°) for α-UO 3 with no uranyl [UO 2 2+ ] bonds. Raman spectra collected using two excitation wavelengths (two instruments using 532 nm and one 785 nm) are presented, and differences with recently published results are discussed. Infrared spectra from two instruments used here agree well with recently published results, but the spectral range encompassed in our data extends past what has been reported with modern techniques. Additionally, we provide tentative vibrational mode assignments based on density functional perturbation theory calculations and resulting phonon eigenvector visualizations. Unexpected features in the optical vibrational spectra of α-UO 3 are explained by unique features in the structure we present.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

FOKKER-PLANCK ANALYSIS OF TRANSVERSE COLLECTIVE INSTABILITIES IN ELECTRON STORAGE RINGS

We analyze single bunch transverse instabilities due to wakefields using a Fokker-Planck model. We expand on the work of Suzuki [1], writing out the linear matrix equation including chromaticity, both dipolar and quadrupolar transverse wakefields, and the effects of damping and diffusion due to the synchrotron radiation. The eigenvalues and eigenvectors determine the collective stability of the beam, and we show that the predicted threshold current for transverse instability and the profile of the unstable agree well with tracking simulations. In particular, we find that predicting collective stability for high energy electron beams at moderate to large values of chromaticity requires the full Fokker-Planck analysis to properly account for the effects of damping and diffusion due to synchrotron radiation.

FOKKER-PLANCK ANALYSIS↗

Hamiltonian Truncation Effective Theory

Hamiltonian truncation is a non-perturbative numerical method for calculating observables of a quantum field theory. The starting point for this method is to truncate the interacting Hamiltonian to a finite-dimensional space of states spanned by the eigenvectors of the free Hamiltonian H_0 H 0 with eigenvalues below some energy cutoff E_\text{max} E max . In this work, we show how to treat Hamiltonian truncation systematically using effective field theory methodology. We define the finite-dimensional effective Hamiltonian by integrating out the states above E_\text{max} E max . The effective Hamiltonian can be computed by matching a transition amplitude to the full theory, and gives corrections order by order as an expansion in powers of 1/E_\text{max} 1 / E max . The effective Hamiltonian is non-local, with the non-locality controlled in an expansion in powers of H_0/E_\text{max} H 0 / E max . The effective Hamiltonian is also non-Hermitian, and we discuss whether this is a necessary feature or an artifact of our definition. We apply our formalism to 2D \lambda\phi^4 λ ϕ 4 theory, and compute the the leading 1/E_\text{max}^2 1 / E max 2 corrections to the effective Hamiltonian. We show that these corrections nontrivially satisfy the crucial property of separation of scales. Numerical diagonalization of the effective Hamiltonian gives residual errors of order 1/E_\text{max}^3 1 / E max 3 , as expected by our power counting. We also present the power counting for 3D \lambda \phi^4 λ ϕ 4 theory and perform calculations that demonstrate the separation of scales in this theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MODAL CLASSIFICATION: Processing and Anomaly Detection in a Noisy Vibrational Environment

n this report we summarize the development of a model-based detection scheme capable of the on-line detection of structural anomalies applying both system identification methods to extract a modal model and state estimation/detection methods to both detect an anomaly and locate all affected sensor positions specified by measurement location. Background information evolving from a simple single input/single output (SISO) mechanical system introducing the state-space formulation which leads directly to a multiple input/multiple output (MIMO) state-space formulation is discussed.From that representation the modal state-space model is introduced through an eigenvalue-eigenvector formulation leading to a similarity transformation and complex modes. Next the sampled-data state-space system is introduced leading to discrete state-space systems which provide the basis for the system identification methods to follow.

42 ENGINEERING↗