The Lanczos Algorithm With Partial Reorthogonalization
From MaRDI portal
Publication:3336581
DOI10.2307/2007563zbMath0546.65017OpenAlexW4250888917MaRDI QIDQ3336581
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2007563
instabilitynumerical examplessymmetric matrixLanczos algorithmsemi-orthogonalreorthogonalizationcg methodslevel of orthogonality
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Related Items
Numerical method for unitary systems ⋮ The joint bidiagonalization process with partial reorthogonalization ⋮ Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization ⋮ Applications of the Lanczos method ⋮ Towards a black box Lanczos program ⋮ The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ Estimates in quadratic formulas ⋮ Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering ⋮ The use of a refined error bound when updating eigenvalues of tridiagonals ⋮ Krylov subspace methods for the Dirac equation ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ Twofold deflation preconditioning of linear algebraic systems. I: Theory ⋮ An adaptive block Lanczos algorithm ⋮ A Lanczos method for approximating composite functions ⋮ Automated adaptive multilevel solver ⋮ Parallel solution techniques in computational structural mechanics ⋮ Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners ⋮ vibro -Lanczos, a symmetric Lanczos solver for vibro-acoustic simulations ⋮ Schur complement-based domain decomposition preconditioners with low-rank corrections ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ Operator growth and Krylov complexity in Bose-Hubbard model ⋮ Rational approximation to the Fermi-Dirac function with applications in density functional theory ⋮ The infinite Lanczos method for symmetric nonlinear eigenvalue problems ⋮ Projection techniques for iterative solution of \(A\underline x=\underline b\) with successive right-hand sides ⋮ Numerical determination of partial spectrum of Hermitian matrices using a Lánczos method with selective reorthogonalization ⋮ Computational Materials Science and Engineering ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems ⋮ The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures ⋮ An efficient matrix tridiagonalization method for 3D finite element analysis of free vibration ⋮ Fast generalized cross validation using Krylov subspace methods ⋮ Deflated block Krylov subspace methods for large scale eigenvalue problems ⋮ Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices ⋮ Use of indefinite pencils for computing damped natural modes ⋮ A Lanczos bidiagonalization algorithm for Hankel matrices ⋮ Matrix-free Krylov iteration for implicit convolution of numerically low-rank data ⋮ Operator complexity: a journey to the edge of Krylov space ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics ⋮ A new projected variant of the deflated block conjugate gradient method ⋮ Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization ⋮ Mixture augmented Lagrange multiplier method for tensor recovery and its applications ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ Algorithm 937 ⋮ Projected Newton method for noise constrained Tikhonov regularization ⋮ Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides ⋮ The trace minimization method for the symmetric generalized eigenvalue problem ⋮ A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation ⋮ Modified Lanczos method for solving large sparse linear systems ⋮ An improved Lanczos algorithm for solving ill-conditioned linear equations ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision ⋮ Analysis of the symmetric Lanczos algorithm with reorthogonalization methods ⋮ On the real convergence rate of the conjugate gradient method
