On the optimality of Krylov information

DOI10.1016/0885-064X(87)90003-3zbMATH Open0626.65027MaRDI QIDQ580896FDOQ580896

Authors: Arthur W. Chou 

Publication date: 1987

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

Recommendations

• On optimality of Krylov's information when solving linear operator equations
• scientific article; zbMATH DE number 16954
• On the Optimal Solution of Large Linear Systems
• Minimal residual algorithm and matrix-vector information
• An optimal Q-OR Krylov subspace method for solving linear systems

zbMATH Keywords

eigenvaluesoptimalitycomplexityKrylov 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Optimal Solution of Large Linear Systems
• On the optimal solution of large eigenpair problems
• Title not available (Why is that?)

Cited In (12)

• Perspectives on information-based complexity
• On the Optimal Solution of Large Linear Systems
• Randomized block Krylov methods for approximating extreme eigenvalues
• An efficient solution to the informed principal problem
• Information-based complexity: New questions for mathematicians
• Title not available (Why is that?)
• Complexity of fixed points. I
• Excess information in parametric linear optimization
• On optimality of Krylov's information when solving linear operator equations
• Information-based complexity of linear operator equations
• Minimal residual algorithm and matrix-vector information
• Krivine schemes are optimal

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580896)