LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING (Q4532715): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/10637190208941433 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963985842 / rank | |||
Normal rank | |||
Revision as of 19:12, 19 March 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
