CG-type algorithms to solve symmetric matrix equations (Q2489397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: CG-type algorithms to solve symmetric matrix equations |
scientific article; zbMATH DE number 5020610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CG-type algorithms to solve symmetric matrix equations |
scientific article; zbMATH DE number 5020610 |
Statements
CG-type algorithms to solve symmetric matrix equations (English)
0 references
28 April 2006
0 references
The author studies two conjugate gradient (CG) type algorithms for the efficient numerical solution of symmetric linear algebraic systems with multiple right-hand sides. Numerical examples are given to illustrate the performance of the suggested methods in comparison with existing ones.
0 references
symmetric linear systems
0 references
multiple right-hand sides
0 references
Global FOM GMRES algorithms
0 references
matrix equations
0 references
Krylov subspace method
0 references
conjugate gradient type algorithms
0 references
numerical examples
0 references
0 references
0.88638675
0 references
0.88329923
0 references
0.8819022
0 references
0.88149023
0 references
0.88103557
0 references
0 references
0.8762952
0 references
