Numerical linear algebra algorithms and software (Q1591199): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q233672 |
||
Property / reviewed by | |||
Property / reviewed by: Ferenc Szidarovszky / rank | |||
Revision as of 16:31, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical linear algebra algorithms and software |
scientific article |
Statements
Numerical linear algebra algorithms and software (English)
0 references
19 December 2000
0 references
This paper gives an excellent survey of the modern methodology for solving linear equations. Dense algorithms are first discussed including LU factorization and block methods. The influence of computer architecture on performance is next examined, and software libraries are analyzed. Sparse methods are then discussed including the reduction of bandwidth by graph theory, and nested dissections. Among the iteration methods special attention is given to stationary processes, to the Krylov subspace methods, to preconditioners including incomplete factorization. Libraries and standards in sparse methods are described at the end of the paper.
0 references
dense algorithms
0 references
sparse algorithms
0 references
software libraries
0 references
survey paper
0 references
bandwidth reduction
0 references
LU factorization
0 references
block methods
0 references
performance
0 references
nested dissections
0 references
iteration methods
0 references
Krylov subspace methods
0 references
preconditioners
0 references
incomplete factorization
0 references