New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form (Q1405657)
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: New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form |
scientific article; zbMATH DE number 1971360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form |
scientific article; zbMATH DE number 1971360 |
Statements
New \(\text{GMRES}(k)\)-type algorithms with excplicit restarts and the analysis of their convergence properties based on matrix relations in QR form (English)
0 references
1 September 2003
0 references
preconditioning
0 references
generalized minimal residual type algorithm
0 references
convergence
0 references
numerical results
0 references
restarting
0 references
QR form
0 references
iterations of Arnoldi type
0 references
GMRES algorithm
0 references
nonsingular, unsymmetric, and indefinite matrices
0 references
filtering
0 references
0.8178821802139282
0 references
0.8101774454116821
0 references
