CG-type algorithms to solve symmetric matrix equations (Q2489397): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 432 / rank | |||
Normal rank | |||
Revision as of 02:13, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CG-type algorithms to solve symmetric matrix equations |
scientific article |
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
