Lanczos Algorithms for Large Symmetric Eigenvalue Computations
From MaRDI portal
Publication:4786440
DOI10.1137/1.9780898719192zbMath1013.65033OpenAlexW1980357388MaRDI QIDQ4786440
Ralph A. Willoughby, Jane K. Cullum
Publication date: 16 December 2002
Full work available at URL: https://doi.org/10.1137/1.9780898719192
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (38)
Learning from patches by efficient spectral decomposition of a structured kernel ⋮ Wiener-Hermite polynomial expansion for multivariate Gaussian probability measures ⋮ A practical introduction to tensor networks: Matrix product states and projected entangled pair states ⋮ Does the SYK model have a spin glass phase? ⋮ A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices ⋮ Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\) ⋮ Mesh segmentation by combining mesh saliency with spectral clustering ⋮ The \(\mathcal H^2\)-wavelet method ⋮ A sparse nonsymmetric eigensolver for distributed memory architectures ⋮ Uncertainty quantification of high-dimensional complex systems by multiplicative polynomial dimensional decompositions ⋮ Numerical linear algebra in data assimilation ⋮ Bootstrapped block Lanczos for large-dimension eigenvalue problems ⋮ Efficient diagonalization of kicked quantum systems. ⋮ Spectral clustering based on local linear approximations ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing ⋮ Bogoliubov many-body perturbation theory under constraint ⋮ Krylov space approximate Kalman filtering ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Uncertainty quantification under dependent random variables by a generalized polynomial dimensional decomposition ⋮ Direct extension of the density-matrix renormalization group method toward two-dimensional large quantum lattices and related high-performance computing ⋮ Towards a SDLCQ test of the Maldacena conjecture ⋮ On the sensitivity of Lanczos recursions to the spectrum ⋮ The SEL macroscopic modeling code ⋮ Structured Eigenvalue Problems ⋮ Diffusion representations ⋮ Approximating the leading singular triplets of a large matrix function ⋮ Studies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates ⋮ Matrix-free Krylov iteration for implicit convolution of numerically low-rank data ⋮ Near-Optimal Perfectly Matched Layers for Indefinite Helmholtz Problems ⋮ The density-matrix renormalization group ⋮ Thought leaders during crises in massive social networks ⋮ A Multilevel Approach for Computing the Limited-Memory Hessian and its Inverse in Variational Data Assimilation ⋮ Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization ⋮ A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems ⋮ Semi-supervised generalized eigenvalues classification ⋮ Subspace Iteration Randomization and Singular Value Problems ⋮ Approximating ground and excited state energies on a quantum computer
Uses Software
This page was built for publication: Lanczos Algorithms for Large Symmetric Eigenvalue Computations
