On the optimality of Krylov information
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 26912 (Why is no real title available?)
- On the Optimal Solution of Large Linear Systems
- On the optimal solution of large eigenpair problems
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
- Complexity of fixed points. I
- scientific article; zbMATH DE number 933211 (Why is no real title available?)
- 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)
