Complexity of Solving Linear Systems in Different Models of Computation (Q3677053)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of Solving Linear Systems in Different Models of Computation |
scientific article; zbMATH DE number 3898110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Solving Linear Systems in Different Models of Computation |
scientific article; zbMATH DE number 3898110 |
Statements
Complexity of Solving Linear Systems in Different Models of Computation (English)
0 references
1984
0 references
parallel numerical methods
0 references
complexity
0 references
variable precision model
0 references
Newton's method
0 references
comparison
0 references
Gaussian elimination
0 references
Givens transforms
0 references
systolic arrays
0 references
0.9084188
0 references
0.9037918
0 references
0.90196604
0 references
0.9013869
0 references
0.9012673
0 references
0.8965186
0 references
0.8920792
0 references
