Lanczos Algorithms for Large Symmetric Eigenvalue Computations
From MaRDI portal
Recommendations
Cited in
(43)- The density-matrix renormalization group
- Uncertainty quantification under dependent random variables by a generalized polynomial dimensional decomposition
- Uncertainty quantification by optimal spline dimensional decomposition
- Dynamic relaxation method based on Lanczos algorithm
- The H^2-wavelet method
- Uncertainty quantification of high-dimensional complex systems by multiplicative polynomial dimensional decompositions
- Semi-supervised generalized eigenvalues classification
- Krylov space approximate Kalman filtering
- scientific article; zbMATH DE number 1217632 (Why is no real title available?)
- Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing
- Direct extension of the density-matrix renormalization group method toward two-dimensional large quantum lattices and related high-performance computing
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Efficient diagonalization of kicked quantum systems.
- Bogoliubov many-body perturbation theory under constraint
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Wiener-Hermite polynomial expansion for multivariate Gaussian probability measures
- Learning from patches by efficient spectral decomposition of a structured kernel
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- The SEL macroscopic modeling code
- A sparse nonsymmetric eigensolver for distributed memory architectures
- scientific article; zbMATH DE number 2206822 (Why is no real title available?)
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- Studies on Jacobi–Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Approximating the leading singular triplets of a large matrix function
- Thought leaders during crises in massive social networks
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Near-optimal perfectly matched layers for indefinite Helmholtz problems
- Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
- Subspace Iteration Randomization and Singular Value Problems
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Towards a SDLCQ test of the Maldacena conjecture
- Numerical linear algebra in data assimilation
- A multilevel approach for computing the limited-memory Hessian and its inverse in variational data assimilation
- Mesh segmentation by combining mesh saliency with spectral clustering
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- Approximating ground and excited state energies on a quantum computer
- Does the SYK model have a spin glass phase?
- On the sensitivity of Lanczos recursions to the spectrum
- Structured Eigenvalue Problems
- Lanczos Algorithm
- Bootstrapped block Lanczos for large-dimension eigenvalue problems
- Spectral clustering based on local linear approximations
This page was built for publication: Lanczos Algorithms for Large Symmetric Eigenvalue Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786440)
