Krylov subspace iterations for sparse linear systems (Q4356927)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1070443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Krylov subspace iterations for sparse linear systems |
scientific article; zbMATH DE number 1070443 |
Statements
4 June 1998
0 references
sparse linear systems
0 references
Krylov subspace iterations
0 references
conjugate gradient methods
0 references
eigenvalue
0 references
preconditioning
0 references
multigrid
0 references
domain decomposition
0 references
0.8642778396606445
0 references
0.8252164125442505
0 references
Krylov subspace iterations for sparse linear systems (English)
0 references
The author presents a brief review of iterative methods dealing with Krylov subspaces (the given list includes 41 references). The case of \(A= A^*>0\) is considered in more details; eigenvalue computations for \(A\) are also discussed. The preconditioning technique is a special topic but it is connected with ``good approximation to the inverse'' instead of standard operator inequalities. Factorized preconditioners are considered in more details; fast solvers, two-stage iterative methods with inner iterations, multigrid and domain decomposition methods are mentioned. For the entire collection see [Zbl 0863.00021].
0 references
