P PhD Apr 2015 1 0 Tunisia Apr 25, 2015 #1 Hi, The PCG algorithm is a fast solver for linear Toeplitz systems Tx=b. The solution x is reached after Niter (Number of iterations) How can I compute exactlt the needed iterations number ? Thanks

Hi, The PCG algorithm is a fast solver for linear Toeplitz systems Tx=b. The solution x is reached after Niter (Number of iterations) How can I compute exactlt the needed iterations number ? Thanks