LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING (Q4532715)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1750070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88786644
0 references
0.88013613
0 references
0.8788597
0 references
0.8744179
0 references
0.8709845
0 references
