Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
zbMATH Open1103.65311MaRDI QIDQ5493477FDOQ5493477
Authors: Bernhard Beckermann 
Publication date: 23 October 2006
Recommendations
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Superlinear convergence of conjugate gradients
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Geometric aspects of the theory of Krylov subspace methods
Krylov subspace methodsnumerical exampleserror boundconjugate gradient methodsuperlinear convergencediscrete orthogonal polynomialsRitz valueslogarithmic potential theoryasymptotic eigenvalue distributionlarge symmetric systems
Iterative numerical methods for linear systems (65F10) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15)
Cited In (7)
- A convergence analysis of the MINRES method for some Hermitian indefinite systems
- Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
- Extremal rational functions on symmetric discrete sets and superlinear convergence of the ADI method
- Superlinear CG convergence for special right-hand sides
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- On an economic Arnoldi method for \(BML\)-matrices
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
This page was built for publication: Discrete orthogonal polynomials and superlinear convergence of Krylov subspace methods in numerical linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493477)
