Complexity theory of numerical linear algebra (Q1103328): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:49, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity theory of numerical linear algebra |
scientific article |
Statements
Complexity theory of numerical linear algebra (English)
0 references
1988
0 references
Statistical properties of random matrices and random systems of linear equations are investigated. Bounds are given for the average performance of the power method for calculating the eigenvectors of symmetric and Hermitian matrices and for the loss of precision when a system of linear equations is solved.
0 references
computational complexity
0 references
random matrices
0 references
random systems
0 references
power method
0 references
