LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING (Q4532715): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q273238 |
Changed an Item |
||
| Property / author | |||
| Property / author: Giorgio Pini / rank | |||
Normal rank | |||
Revision as of 13:39, 12 February 2024
scientific article; zbMATH DE number 1750070
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING |
scientific article; zbMATH DE number 1750070 |
Statements
LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING (English)
0 references
29 October 2002
0 references
sparse approximate inverse
0 references
Bi-CGSTAB method
0 references
