Chebyshev iteration

Chebyshev iteration, also known as Chebyshev acceleration or Chebyshev polynomial iteration, is a numerical method used to accelerate the convergence of a sequence generated by an iterative process, particularly in the context of solving linear systems or eigenvalue problems. The method leverages Chebyshev polynomials, which possess properties that can be used to approximate functions and enhance convergence rates. The idea is to apply polynomial interpolation to the iterative process, allowing for improved convergence through the use of these polynomials.