SEARCH · Search NASA

Results for “Lanczos algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

NASA NTRS1992

Application of unsymmetric block Lanczos vectors in system identification

This paper demonstrates a new system identification approach of using Lanczos coordinates in place of modal coordinates. Identified experimental Lanczos vectors can be directly used in many structural dynamics analysis applications. A multi-input, multi-output frequency-domain technique was used to extract system matrices and an unsymmetric block Lanczos algorithm was used to reduce the order of the experimental model. A cantilever beam example showed promising results, indicating that a new system identification approach using Lanczos coordinates is worthy of further study.

Kim, H. M., Jr.↗

NASA NTRS1990

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

Freund, Roland W.↗

DOE OSTI2018

MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel

We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.

Elwasif, Wael↗

DOE OSTI2019

Active Thermochemical Tables: The Partition Function of Hydroxymethyl (CH 2 OH) Revisited

The best currently available set of temperature-dependent non-rigid rotor anharmonic oscillator (NRRAO) thermochemical and thermophysical properties of hydroxymethyl radical is presented. The underlying partition function relies on a critically evaluated complement of accurate experimental and theoretical data, and is constructed using a two-pronged strategy that combines contributions from large amplitude motions obtained from direct counts, with contributions from the other internal modes of motion obtained from analytic NRRAO expressions. The contributions from the two strongly coupled large-amplitude motions of CH 2 OH, OH torsion and CH 2 wag, are based on energy levels obtained by solving the appropriate two-dimensional projection of a fully-dimensional potential energy surface that was recently obtained at the CCSD(T)/cc-pVTZ level of theory. The contributions of the remaining seven, more rigid, vibrational modes and of the external rotations are captured by NRRAO corrections to the standard rigid rotor harmonic oscillator (RRHO) treatment, which include corrections for vibrational anharmonicities, rotation-vibration interaction, Coriolis effects, and low-temperature. Here, the basic spectroscopic constants needed for the construction of the initial RRHO partition function rely on experimental ground-state rotational constants and the best available experimental fundamentals, additionally complemented by fundamentals obtained from the variational solution of the full-dimensional potential energy surface using a recently developed two-component multi-layer Lanczos algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2017

A rigorous full-dimensional quantum dynamics study of tunneling splitting of rovibrational states of vinyl radical C 2 H 3

Here, we report a rigorous quantum mechanical study of the rovibrational energy levels of vinyl radical C 2 H 3 . The calculations are carried out using a real two-component multi-layer Lanczos algorithm in a set of orthogonal polyspherical coordinates based on a recently developed accurate ab initio potential energy surface of C 2 H 3 . All well converged 158 vibrational bands up to 3200 cm -1 are determined, together with a comparison to previous calculations and experimental results. Our results show a remarkable multi-dimensional tunneling effect on the vibrational spectra of the radical. The vibrational tunneling splitting is substantially different from that of previous reduced dimensional calculations. The rotational constants of the fundamental vibrational bands of C 2 H 3 are also given. It was found that the rovibrational states are strongly coupled, especially among those bending vibrational modes. Additionally, the perturbative iteration approach of Gruebele has been extended to assign the rovibrational energy levels of C 2 H 3 without the requirement of explicit wavefunctions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Theoretical study of the HCS + –H 2 van der Waals complex: potential energy surface, rovibrational bound states, and rotationally inelastic collisional cross sections

An accurate ground-state intermolecular potential energy surface (PES) was calculated for the HCS + –H 2 complex. The surface was constructed from 3023 ab initio energies, computed with explicitly correlated coupled-cluster theory, CCSD(T)-F12b, with extrapolation to the complete basis set limit (VTZ-F12/VQZ-F12). The new 4D PES was used to compute rovibrational energies, rota- tional constants, and close-coupling quantum scattering calculations at low collision energies. A symmetry-adapted Lanczos algorithm was used to variationally compute the low-lying rovibrational bound states. Rotational constants for states of two isomers were determined from the energy levels and reported in hopes of motivating experiments. The rotationally inelastic state-to-state cross sections of HCS + by collision with para- and ortho-H 2 were computed and compared, and trends and propensities are discussed.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2021

Dynamic properties of a polaron coupled to dispersive optical phonons

We study static and dynamic properties of an electron coupled to dispersive quantum optical phonons in the framework of the Holstein model defined on a one-dimensional lattice. Calculations are performed using the Lanczos algorithm based on a highly efficient construction of the variational Hilbert space. Even small phonon dispersion has a profound effect on the low-energy optical response. While the upward phonon dispersion broadens the optical spectra due to single-phonon excitations, the downward dispersion has the opposite effect. With increasing dispersion, a multiphonon excitation (MPE) state becomes the lowest excited state of the system at zero momentum and determines the low-frequency response of the optical conductivity where the threshold for optical absorption moves below the single-phonon frequency. Multiphonon states form a well-defined bandlike feature just above the polaron band as clearly seen in the electron spectral function. Low-energy MPEs should be observable in systems with strong optical phonon dispersion in optical as well as angle-resolved photoemission experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2022

Spectral function for 4 He using the Chebyshev expansion in coupled-cluster theory

Here, we compute spectral function for 4 He by combining coupled-cluster theory with an expansion of integral transforms into Chebyshev polynomials. Our method allows us to estimate the uncertainty of spectral reconstruction. The properties of the Chebyshev polynomials make the procedure numerically stable and considerably lower in memory usage than the typically employed Lanczos algorithm. We benchmark our predictions with other calculations in the literature and with electron-scattering data in the quasi-elastic peak. The spectral function formalism allows one to extend ab initio lepton-nucleus cross sections into the relativistic regime. This makes it a promising tool for modeling this process at higher-energy transfers. The results we present open the door for studies of heavier nuclei, important for the neutrino oscillation programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Toward ab-initio nuclear theory calculations of 𝛿 𝐶

We propose a theory framework to study the isospin-symmetry breaking correction 𝛿 C in superallowed nuclear 𝛽 decays, crucial for the precise determination of |𝑉 𝑢⁢𝑑 |. Based on a general assumptions of the isovector dominance in isospin-symmetry breaking interactions, we construct a set of functions 𝐹 𝑇 𝑧 which involve nuclear matrix elements of isovector monopole operators and the nuclear Green's function. Via the functions 𝐹 𝑇 𝑧 , a connection of 𝛿 C to measurable electroweak nuclear radii is established, providing an experimental gauge of the theory accuracy of 𝛿 C . Here, we outline a strategy to perform ab initio calculations of 𝐹 𝑇 𝑧 based on the Lanczos algorithm, and discuss its similarity with other nuclear-structure-dependent inputs in nuclear 𝛽 decays.

Ab initio calculations↗

DOE OSTI2017

Flexible configuration-interaction shell-model many-body solver

BIGSTICK Is a flexible configuration-Interaction open-source shell-model code for the many-fermion problem In a shell model (occupation representation) framework. BIGSTICK can generate energy spectra, static and transition one-body densities, and expectation values of scalar operators. Using the built-in Lanczos algorithm one can compute transition probabflity distributions and decompose wave functions into components defined by group theory.

Johnson, CalvinW.↗

DOE OSTI2022

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↗

DOE OSTI2021

Preliminary Theoretical Analysis of Mixed Precision Krylov Subspace Methods (Q3 Report)

The third quarter of the project was spent performing theoretical finite precision analysis of Krylov subspace method variants that use mixed precision. Our focus here is on the Conjugate Gradient (CG) method and the Lanczos method. We have performed an analysis of maximum attainable accuracy for the classical CG method in which 3 precisions are used: a working precision ε, a precision ε IP for the inner product computations, and a precision ε MV for the matrix-vector products. Our results show that performing inner product computations in lower precision does not affect the attainable accuracy. Further, we have performed a complete error analysis of the s-step Lanczos algorithm. In this case, we show that the numerical behavior of the algorithm can be significantly improved by using extra precision in a small part of the computation. We summarize the main theorems in the remainder of the document. Other activities include attending biweekly xSDK meetings. The subsequent quarter will be spent finalizing these results into technical reports and/or manuscripts for submission to journals, as well as identifying opportunities for future work.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1991

Lanczos eigensolution method for high-performance computers

The theory, computational analysis, and applications are presented of a Lanczos algorithm on high performance computers. The computationally intensive steps of the algorithm are identified as: the matrix factorization, the forward/backward equation solution, and the matrix vector multiples. These computational steps are optimized to exploit the vector and parallel capabilities of high performance computers. The savings in computational time from applying optimization techniques such as: variable band and sparse data storage and access, loop unrolling, use of local memory, and compiler directives are presented. Two large scale structural analysis applications are described: the buckling of a composite blade stiffened panel with a cutout, and the vibration analysis of a high speed civil transport. The sequential computational time for the panel problem executed on a CONVEX computer of 181.6 seconds was decreased to 14.1 seconds with the optimized vector algorithm. The best computational time of 23 seconds for the transport problem with 17,000 degs of freedom was on the the Cray-YMP using an average of 3.63 processors.

Bostic, Susan W.↗

NASA NTRS1989

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland↗

NASA NTRS1992

On development of a finite dynamic element and solution of associated eigenproblem by a block Lanczos procedure

The paper first presents the details of the development of a new six-noded plane triangular finite dynamic element. A block Lanczos algorithm is developed next for the accurate and efficient solution of the quadratic matrix eigenvalue problem associated with the finite dynamic element formulation. The resulting computer program fully exploits matrix sparsity inherent in such a discretization and proves to be most efficient for the extraction of the usually required first few roots and vectors, including repeated ones. Most importantly, the present eigenproblem solution is shown to be comparable to that of the corresponding finite element analysis, thereby rendering the associated dynamic element method rather attractive owing to superior convergence characteristics of such elements, presented herein.

Gupta, K. K.↗

NASA NTRS1991

Unsymmetric Lanczos model reduction and linear state function observer for flexible structures

This report summarizes part of the research work accomplished during the second year of a two-year grant. The research, entitled 'Application of Lanczos Vectors to Control Design of Flexible Structures' concerns various ways to use Lanczos vectors and Krylov vectors to obtain reduced-order mathematical models for use in the dynamic response analyses and in control design studies. This report presents a one-sided, unsymmetric block Lanczos algorithm for model reduction of structural dynamics systems with unsymmetric damping matrix, and a control design procedure based on the theory of linear state function observers to design low-order controllers for flexible structures.

Su, Tzu-Jeng↗

NASA NTRS2003

Eigensolver for a Sparse, Large Hermitian Matrix

A parallel-processing computer program finds a few eigenvalues in a sparse Hermitian matrix that contains as many as 100 million diagonal elements. This program finds the eigenvalues faster, using less memory, than do other, comparable eigensolver programs. This program implements a Lanczos algorithm in the American National Standards Institute/ International Organization for Standardization (ANSI/ISO) C computing language, using the Message Passing Interface (MPI) standard to complement an eigensolver in PARPACK. [PARPACK (Parallel Arnoldi Package) is an extension, to parallel-processing computer architectures, of ARPACK (Arnoldi Package), which is a collection of Fortran 77 subroutines that solve large-scale eigenvalue problems.] The eigensolver runs on Beowulf clusters of computers at the Jet Propulsion Laboratory (JPL).

Tisdale, E. Robert↗