Complexity theory of numerical linear algebra (Q1103328)
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: Publication:1103328 |
scientific article; zbMATH DE number 4052888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity theory of numerical linear algebra |
scientific article; zbMATH DE number 4052888 |
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
0 references
0.7917975187301636
0 references
0.7787118554115295
0 references
0.7740752100944519
0 references
0.7706030011177063
0 references
