Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start (Q4940818)
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:4940818 |
scientific article; zbMATH DE number 1406965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start |
scientific article; zbMATH DE number 1406965 |
Statements
27 February 2000
0 references
Krylov subspace method
0 references
eigenvector
0 references
Lanczos method
0 references
power method
0 references
largest eigenvalue
0 references
error analysis
0 references
convergence
0 references
Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start (English)
0 references
0.9082799553871156
0 references
0.9077268242836
0 references
0.8876552581787109
0 references
0.8547952175140381
0 references
