Further analysis of minimum residual ite
โ
Yousef Saad
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 143 KB
The convergence behaviour of a number of algorithms based on minimizing residual norms over Krylov subspaces is not well understood. Residual or error bounds currently available are either too loose or depend on unknown constants that can be very large. In this paper we take another look at traditio