On the optimality of Krylov information

DOI10.1016/0885-064X(87)90003-3zbMath0626.65027MaRDI QIDQ580896

Arthur W. Chou

Publication date: 1987

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

zbMATH Keywords

complexityeigenvaluesoptimalityKrylov sequenceminimal residual algorithmorthogonally invariant class

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (7)

Complexity of fixed points. I ⋮ Perspectives on information-based complexity ⋮ On optimality of Krylov's information when solving linear operator equations ⋮ Information-based complexity of linear operator equations ⋮ Information-based complexity: New questions for mathematicians ⋮ Minimal residual algorithm and matrix-vector information ⋮ Randomized block Krylov methods for approximating extreme eigenvalues

Cites Work

• On the optimal solution of large eigenpair problems
• On the Optimal Solution of Large Linear Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the optimality of Krylov information