An adaptive block Lanczos algorithm
From MaRDI portal
Publication:1921322
DOI10.1007/BF02141743zbMath0859.65032OpenAlexW2015768950MaRDI QIDQ1921322
Publication date: 7 April 1997
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02141743
numerical examplesadaptive algorithmRitz valuessymmetric matrixblock Lanczos algorithmclustered eigenvalues
Related Items (13)
Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods ⋮ Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation ⋮ A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems ⋮ Block Krylov-Schur method for large symmetric eigenvalue problems ⋮ Convergence of the block Lanczos method for eigenvalue clusters ⋮ An Effective and Easy-to-Implement Boundary Condition for Molecular Dynamics Simulations ⋮ Matrix-free Krylov iteration for implicit convolution of numerically low-rank data ⋮ A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems ⋮ Filtered Krylov-like sequence method for symmetric eigenvalue problems ⋮ The matrix and polynomial approaches to Lanczos-type algorithms ⋮ A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation ⋮ A review of formal orthogonality in Lanczos-based methods ⋮ A priori error bounds on invariant subspace approximations by block Krylov subspaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The use of a refined error bound when updating eigenvalues of tridiagonals
- The convergence behavior of Ritz values in the presence of close eigenvalues
- Avoiding breakdown and near-breakdown in Lanczos type algorithms
- The Lanczos Algorithm With Partial Reorthogonalization
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- On Estimating the Largest Eigenvalue with the Lanczos Algorithm
- A Convergence Analysis for Nonsymmetric Lanczos Algorithms
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The Lanczos Algorithm with Selective Orthogonalization
- A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Fourier Analysis of Iterative Methods for Elliptic pr
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
This page was built for publication: An adaptive block Lanczos algorithm