@Article{EAJAM-10-2,
author = {P., John, Boyd},
title = {Using Parity to Accelerate the Computation of the Zeros of Truncated Legendre and Gegenbauer Polynomial Series and Gaussian Quadrature},
journal = {East Asian Journal on Applied Mathematics},
year = {2020},
volume = {10},
number = {2},
pages = {217--242},
abstract = {<p style="text-align: justify;">Any function $u(x)$ can be decomposed into its parts that are symmetric and antisymmetric with respect to the origin. The zeros, maxima and minima of a truncated spectral series of degree $N$ can always be computed as the eigenvalues of the sparse $N$-dimensional companion matrix whose elements are trivial functions of the coefficients of the spectral series. Here, we show that the matrix dimension can be halved if the series has definite parity. A series of Legendre and Gegenbauer polynomials has even parity if only even degree coefficients are nonzero and odd parity if the sum includes odd degrees only. We give the elements of the parity-exploiting companion matrices explicitly. We also give the coefficients of parity-exploiting recurrences for computing the orthogonal polynomials of even degree only or odd degree only without the wasteful computation of all polynomials of the opposite parity. For an $N$-point Gaussian quadrature, the quadrature points are the eigenvalues of a symmetric tridiagonal matrix of dimension $N$ (&quot;Jacobi matrix&quot;). We give the explicit elements of symmetric tridiagonal matrices of dimension $N$/2 that do the same job.&nbsp;</p>},
issn = {2079-7370},
doi = {https://doi.org/10.4208/eajam.140819.271119},
url = {https://global-sci.com/article/82558/using-parity-to-accelerate-the-computation-of-the-zeros-of-truncated-legendre-and-gegenbauer-polynomial-series-and-gaussian-quadrature}
}