Numerical analysis Iterative methods for linear systems Concept
Krylov subspace
Summary
The Krylov subspace of order generated by a square matrix and a vector is the linear span of . Its elements are the vectors for polynomials of degree less than . Many iterative methods for large linear systems and eigenvalue problems search for approximations in Krylov subspaces. These subspaces can be built with matrix-vector products alone.
Where this leads
11 pages build on this one.
Further reading
About this page
| Tag | QB45PCGQPV |
|---|---|
| URI | m2://QB45PCGQPV |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65F10, 65F15, 15A03 |
| Specializes | Linear subspace |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Derivation of the conjugate gradient method
- Conjugate residual method
- Minimal residual method
- Lanczos algorithm
- Generalized minimal residual method
- Conjugate gradient method
- Arnoldi iteration
- Biconjugate gradient method
- Biconjugate gradient stabilized method
- Chebyshev iteration
Results about this
- Minimal residual method
- Lanczos algorithm
- Generalized minimal residual method
- Conjugate gradient method
- Arnoldi iteration