Statistical complexity of dominant eigenvector calculation

DOI10.1016/0885-064X(91)90025-SzbMath0778.68043MaRDI QIDQ1186505

Eric Kostlan

Publication date: 28 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

power methoddominant eigenvector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

Average-case complexity without the black swans ⋮ Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to multiply matrices faster
• Complexity theory of numerical linear algebra
• Statistical complexity of the power method for Markov chains
• On the efficiency of algorithms of analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Statistical complexity of dominant eigenvector calculation