Error Analysis of Krylov Methods In a Nutshell
From MaRDI portal
Publication:4389266
DOI10.1137/S1064827595290450zbMath0914.65024OpenAlexW2043613796MaRDI QIDQ4389266
Marlis Hochbruck, Christian Lubich
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827595290450
Lanczos methoderror boundsiterative methodsKrylov subspace methodsArnoldi methodresidual boundconjugate-gradient-type methods
Related Items
A class of explicit multistep exponential integrators for semilinear problems, Analysis of multilevel methods for eddy current problems, A preconditioned Krylov subspace iterative methods for inverse source problem by virtue of a regularizing LM-DRBEM, Quotient-space boundary element methods for scattering at complex screens, GMRES algorithms over 35 years, A quadrature based method for evaluating exponential-type functions for exponential methods, Convergence analysis of Krylov subspace methods, The effect of non-optimal bases on the convergence of Krylov subspace methods, GMRES-type methods for inconsistent systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On semiiterative methods generated by Faber polynomials
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- An analysis of the composite step biconjugate gradient method
- Minimization properties and short recurrences for Krylov subspace methods
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- Convergence of Krylov methods for sums of two operators
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
