A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435)
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: A class of optimized row projection methods for solving large nonsymmetric linear systems |
scientific article; zbMATH DE number 1787716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of optimized row projection methods for solving large nonsymmetric linear systems |
scientific article; zbMATH DE number 1787716 |
Statements
A class of optimized row projection methods for solving large nonsymmetric linear systems (English)
0 references
22 August 2002
0 references
Purely theoretical paper on a projected aggregation method. A new search direction is determined to minimize the distance to the solution by the use of quadratic programming. An optimal row partitioning is defined. Numerical results will be published in another paper. So it is not possible to evaluate the merits of the new method.
0 references
row projection methods
0 references
large nonsymmetric linear systems
0 references
parallel computing
0 references
projected aggregation method
0 references
quadratic programming
0 references
0 references
0 references
0 references
0.9672068
0 references
0.9037801
0 references
0.89297557
0 references
0.8920944
0 references
0.89149964
0 references
0.89065915
0 references
0 references
0.88662714
0 references
0.8857051
0 references
