Approximating the inverse of a matrix for use in iterative algorithms on vector processors (Q1142011): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5342712 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5639278 / rank | |||
Normal rank | |||
Latest revision as of 04:34, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the inverse of a matrix for use in iterative algorithms on vector processors |
scientific article |
Statements
Approximating the inverse of a matrix for use in iterative algorithms on vector processors (English)
0 references
1979
0 references
linear symmetric positive definite system
0 references
truncated Neumann series
0 references
Chebyshev method
0 references
conjugate gradient method
0 references
comparison with the incomplete Cholesky decomposition
0 references
conjugate Cholesky decomposition
0 references
0 references
