Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations (Q1201030)
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: Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations |
scientific article; zbMATH DE number 97158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations |
scientific article; zbMATH DE number 97158 |
Statements
Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations (English)
0 references
17 January 1993
0 references
The author investigates the preconditioned conjugate gradient method for solving large sparse linear systems with positive semidefinite coefficient matrices. The preconditioning is based on an \(S/P\) consistently ordered approximate upper triangular factor, and a new upper eigenvalue bound. Numerical examples complete the paper.
0 references
iterative methods
0 references
Stieltjes matrices
0 references
acceleration of convergence
0 references
preconditioned conjugate gradient method
0 references
large sparse linear systems
0 references
consistently ordered
0 references
Numerical examples
0 references
0 references
0 references
0.8863978
0 references
0.8726643
0 references
0.8595867
0 references
0.8512687
0 references
0.85060203
0 references
0.8487364
0 references
0.84742934
0 references
0.84681344
0 references
