I have a problem about the Chebyshev iterative method in the book. Assume that we use the simple iteration
$$\mathbf{u}_{k+1}=\mathbf{u}_k+p(A)\left(\mathbf{b}-A \mathbf{u}_k\right)$$
and we have the Chebyshev polynomial $q(x)$ already, how to implement it?
Do we need to calculate $p(A)=(q(A)-I)A^{-1}$ in the iteration?
Hi, @bueler !
I have a problem about the Chebyshev iterative method in the book. Assume that we use the simple iteration $$\mathbf{u}_{k+1}=\mathbf{u}_k+p(A)\left(\mathbf{b}-A \mathbf{u}_k\right)$$ and we have the Chebyshev polynomial $q(x)$ already, how to implement it?
Do we need to calculate $p(A)=(q(A)-I)A^{-1}$ in the iteration?