Computational Variants of the Lanczos Method for the Eigenproblem
From MaRDI portal
Publication:5667414
DOI10.1093/IMAMAT/10.3.373zbMath0253.65020OpenAlexW2009737642MaRDI QIDQ5667414
Publication date: 1972
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/10.3.373
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Orthogonalization in numerical linear algebra (65F25)
Related Items (68)
Lanczos algorithm and energy-weighted sum rules for linear response ⋮ The joint bidiagonalization process with partial reorthogonalization ⋮ Recursive tridiagonalization of infinite dimensional Hamiltonians ⋮ The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING ⋮ An Incomplete Factorization Technique for Positive Definite Linear Systems ⋮ An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A ⋮ Transient probabilistic systems ⋮ Exact diagonalization of quantum-spin models ⋮ Estimates in quadratic formulas ⋮ Optimal Low-rank Approximations of Bayesian Linear Inverse Problems ⋮ A two-step iterative block Lanczos algorithm for a dominant eigenspan ⋮ Krylov subspace methods for the Dirac equation ⋮ A stable Stieltjes technique for computing orthogonal polynomials and Jacobi matrices associated with a class of singular measures ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Numerical stability of GMRES ⋮ Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices ⋮ A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ⋮ Fitting large-scale structured additive regression models using Krylov subspace methods ⋮ A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method ⋮ Accelerated simultaneous iterations for large finite element eigenproblems ⋮ Determination of eigenstates via Lanczos-based forward substitution and filter- diagonalization ⋮ The Lanczos Algorithm with Selective Orthogonalization ⋮ Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer: ⋮ Iterative methods for the computation of a few eigenvalues of a large symmetric matrix ⋮ Abstract perturbed Krylov methods ⋮ The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization ⋮ The block conjugate gradient algorithm and related methods ⋮ A new look at the Lanczos algorithm for solving symmetric systems of linear equations ⋮ An accelerated subspace iteration method ⋮ Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices ⋮ Computational methods of linear algebra ⋮ The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations ⋮ A projection method for generalized eigenvalue problems using numerical integration. ⋮ Lanczos method of tridiagonalization, Jacobi matrices and physics ⋮ Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem ⋮ Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems ⋮ 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices ⋮ \textit{TimeEvolver}: a program for time evolution with improved error bound ⋮ Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ On computing Jacobi matrices associated with recurrent and Möbius iterated function systems ⋮ Theoretical error bounds on the convergence of the Lanczos and block-Lanczos methods ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ Quadratically constrained least squares and quadratic problems ⋮ Fractal measures and polynomial sampling: I.F.S.-Gaussian integration ⋮ Eigenpairs of Wilkinson Matrices ⋮ Sparse matrices ⋮ A new approach for determining the time step when propagating with the Lanczos algorithm ⋮ Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems ⋮ Iterative eigenvalue algorithms based on convergent splittings ⋮ Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects ⋮ On the numerical solution of the eigenvalue problem of the Laplace operator by a capacitance matrix method ⋮ On orthogonal polynomials with perturbed recurrence relations ⋮ Newton sum rules of zeros of semiclassical orthogonal polynomials ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ A high-precision study of anharmonic-oscillator spectra ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ Frequency domain resilient consensus of multi-agent systems under IMP-based and non IMP-based attacks ⋮ A survey of Lanczos procedures for very large real 'symmetric' eigenvalue problems ⋮ 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 ⋮ Zero and negative masses in finite element vibration and transient analysis ⋮ On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods ⋮ Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
This page was built for publication: Computational Variants of the Lanczos Method for the Eigenproblem
