Minimax approximations to the zeros of P_ n(x) and Gauss-Legendre quadrature

DOI10.1016/0377-0427(94)00030-5MaRDI QIDQ1899984zbMATH OpenOpenAlexFDO

Authors Frank G. Lether, Paul R. Wenston

Publication date 11 October 1995

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(94)00030-5

computational complexity Gauss-Legendre quadrature rule iterative method Legendre polynomial minimax trigonometric approximations positive zeros

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Approximate quadratures (41A55) Computation of special functions and constants, construction of tables (65D20) Numerical quadrature and cubature formulas (65D32) Numerical computation of solutions to single equations (65H05)

Review text

This paper is concerned with the numerical development of some minimax trigonometric approximations to the positive zeros of the \(n\)-th Legendre polynomial \(P_n(x)\). One of the approximation formulas yields at least 4.2 significant decimal digits of accuracy for any \(n \geq 2\), and can be used to furnish initial guesses in an iterative method for the computation of the zeros of \(P_n(x)\) to nearly full machine accuracy. This approach avoids some of the computational complexity associated with the selection of appropriate initial guesses for use in a special 5th order scheme previously developed by the first author for the numerical computation of the abscissas required in the \(n\)-point Gauss-Legendre quadrature rule.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Minimax approximations to the zeros of \(P_ n(x)\) and Gauss-Legendre quadrature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899984)