Analysis of the binary complexity of asymptotically fast algorithms for linear system solving (Q3806671)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the binary complexity of asymptotically fast algorithms for linear system solving |
scientific article |
Statements
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving (English)
0 references
1988
0 references
Gaussian elimination
0 references
matrix triangularization algorithm
0 references
binary complexity
0 references
asymptotically fast algorithms
0 references
linear systems
0 references
