Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix

DOI10.1137/S1064827597330169zbMath0959.65058OpenAlexW2129743302MaRDI QIDQ4509813

Michael Kwok-Po Ng

Publication date: 19 October 2000

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827597330169

zbMATH Keywords

performancealgorithmconvergencenumerical examplesLanczos methodpreconditioningToeplitz matrixfast sine transform

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)

Related Items

An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems, A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix, Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems, Fast Computation of the Matrix Exponential for a Toeplitz Matrix, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems