Computing the real roots of a Fourier series-plus-linear-polynomial: A Chebyshev companion matrix approach

Computing the zeros of a Fourier series

Computing the zeros of a Fourier series or a Chebyshev series or general orthogonal polynomial series with parity symmetries

✍ John P. Boyd 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 394 KB

In recent years, good algorithms have been developed for finding the zeros of trigonometric polynomials and of ordinary polynomials when written in the form of a truncated Chebyshev polynomial or Legendre polynomial series. In each case, the roots can be found from the eigenvalues of a generalized F