Abstract perturbed Krylov methods
From MaRDI portal
Publication:886144
DOI10.1016/j.laa.2007.02.011zbMath1125.65029OpenAlexW2079301384MaRDI QIDQ886144
Publication date: 26 June 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://tubdok.tub.tuhh.de/handle/11420/102
Hessenberg matrixfinite precisionresidual polynomialRitz vectorsabstract perturbed Krylov methodadjugate polynomialbasis polynomialinexact Krylov methodquasi-kernel polynomial
Related Items
Abstract perturbed Krylov methods, Krylov solvability under perturbations of abstract inverse linear problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- Computing interior eigenvalues of large matrices
- Abstract perturbed Krylov methods
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- A new taxonomy of conjugate gradient methods
- A review of formal orthogonality in Lanczos-based methods
- Hessenberg eigenvalue--eigenmatrix relations
- The factorization of the adjugate of a finite matrix
- Eigenvectors obtained from the adjoint matrix
- Krylov solvers for linear algebraic systems.
- On the Convergence of Restarted Krylov Subspace Methods
- Least Squares Residuals and Minimal Residual Methods
- A Taxonomy for Conjugate Gradient Methods
- Geometric aspects of the theory of Krylov subspace methods
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- On the Matrix Adjoint (Adjugate)
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- Inexact Krylov Subspace Methods for Linear Systems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- The Lanczos and Conjugate Gradient Algorithms
- Computational Variants of the Lanczos Method for the Eigenproblem
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Methods of conjugate gradients for solving linear systems
