Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory

DOI10.1137/S0036144504445376zbMath1092.65031OpenAlexW2043348215MaRDI QIDQ5470832

Publication date: 1 June 2006

Published in: SIAM Review (Search for Journal in Brave)

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

zbMATH Keywords

convergence eigenvalues potential theory Lanczos method spectrum conjugate gradients equilibrium measure symmetric matrices Krylov subspace iterations constrained equilibrium

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15)

Related Items

A numerical solution of the constrained energy problem, An extended Hessenberg form for Hamiltonian matrices, Polynomials and lemniscates of indefiniteness, An implicit filter for rational Krylov using core transformations, Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems, Universality in the two‐matrix model: a Riemann‐Hilbert steepest‐descent analysis, A numerical solution of the constrained weighted energy problem, Extremal rational functions on symmetric discrete sets and superlinear convergence of the ADI method, Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners, Universality for the Conjugate Gradient and MINRES Algorithms on Sample Covariance Matrices, Approximating classes of sequences: The Hermitian case, Prior-Preconditioned Conjugate Gradient Method for Accelerated Gibbs Sampling in “Large n , Large p ” Bayesian Sparse Regression, Asymptotics of Chebyshev polynomials. V: Residual polynomials, Distribution results for a special class of matrix sequences: joining approximation theory and asymptotic linear algebra, Extremal polynomials on the \(n\)-grid, On generating Sobolev orthogonal polynomials, Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions, Estimates for the asymptotic convergence factor of two intervals, A unification of unitary similarity transforms to compressed representations, A lower bound for the norm of the minimal residual polynomial, Stability of the notion of approximating class of sequences and applications, The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deterministic, The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output, Convergence of the block Lanczos method for eigenvalue clusters, Spectral analysis of matrices in Galerkin methods based on generalized B-splines with high smoothness, Deflated block Krylov subspace methods for large scale eigenvalue problems, Sharpness in rates of convergence for the symmetric Lanczos method, Isogeometric discretizations with generalized B-splines: symbol-based spectral analysis, Spectral analysis and spectral symbol of matrices in isogeometric collocation methods, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, The role eigenvalues play in forming GMRES residual norms with non-normal matrices, Robust and optimal multi-iterative techniques for Iga collocation linear systems, The Fourier extension method and discrete orthogonal polynomials on an arc of the circle, Superlinear Convergence of Krylov Subspace Methods for Self-Adjoint Problems in Hilbert Space, Development and Analysis of a Block-Preconditioner for the Phase-Field Crystal Equation

Uses Software