An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A (Q1090063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 4007566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A |
scientific article; zbMATH DE number 4007566 |
Statements
An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A (English)
0 references
1987
0 references
For certain f an efficient iterative method for finding an approximate solution of \(f(A)x=b\) is developed, using intermediate information obtained by the conjugate gradient algorithm. The proposed algorithm requires the solution of an eigenvalue problem of low dimension as compared with the dimension of A.The particular case \(f(A)=A^ 2\) is also discussed. Numerical examples which provide evidence, supporting the proposed ideas, are presented.
0 references
conjugate gradient method
0 references
Lanczos method
0 references
matrix equations
0 references
sparse matrices
0 references
Krylov subspace
0 references
0.7919325828552246
0 references
0.7746859788894653
0 references
0.7697999477386475
0 references
0.7693474888801575
0 references
