TY - JOUR T1 - Using Parity to Accelerate the Computation of the Zeros of Truncated Legendre and Gegenbauer Polynomial Series and Gaussian Quadrature AU - P. Boyd , John JO - East Asian Journal on Applied Mathematics VL - 2 SP - 217 EP - 242 PY - 2020 DA - 2020/04 SN - 10 DO - http://doi.org/10.4208/eajam.140819.271119 UR - https://global-sci.org/intro/article_detail/eajam/16135.html KW - Gaussian quadrature, Legendre polynomials, Gegenbauer polynomials, parity, root-ﬁnding. AB -

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 coefﬁcients of the spectral series. Here, we show that the matrix dimension can be halved if the series has deﬁnite parity. A series of Legendre and Gegenbauer polynomials has even parity if only even degree coefﬁcients 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 coefﬁcients 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\$ ("Jacobi matrix"). We give the explicit elements of symmetric tridiagonal matrices of dimension \$N\$/2 that do the same job.