Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms
暂无分享,去创建一个
The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods far sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, and topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The purpose of the present work is to analyze the convergence and stability properties of these methods, and to show that they are bona fide acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods.
[1] David A. Smith,et al. Acceleration of convergence of vector sequences , 1986 .
[2] R. P. Eddy. EXTRAPOLATING TO THE LIMIT OF A VECTOR SEQUENCE , 1979 .
[3] P. Wynn,et al. Acceleration techniques for iterated vector and matrix problems : (mathematics of computation, _1_6(1962), nr 79, p 301-322) , 1962 .
[4] M. Mesina. Convergence acceleration for the iterative solution of the equations X = AX + f , 1977 .
[5] A. Sidi,et al. Extrapolation methods for vector sequences , 1987 .