摘要：

In this talk, we present a quasi-Chebyshev accelerated iteration method for solving a system of linear equations. From Chebyshev

semi-iterative method of the main difference is that the parameter $\omega$ is not obtained by Chebyshev polynomial but optimization models. We prove that the quasi-Chebyshev accelerated iteration method is unconditionally convergent if the original iteration method is convergent and discuss also the convergent rate. Finally, three numerical examples indicate that our algorithm are efficient than the Chebyshev semi-iterative method in
computations.

时间： 2015年3月29日下午2：30

地点：教楼D楼104党员之家