Efficient Computation of Orthogonal Polynomials in Computer Algebra
Please always quote using this URN: urn:nbn:de:0297-zib-2080
- Orthogonal polynomials %like the Chebyshev polynomials can be calculated by computation of determinants, by the use of generating functions, in terms of Rodrigues formulas, by iterating recurrence equations, calculating the polynomial solutions of differential equations, through closed form representations and by other means. In this article, we give an overview about the efficiency of the above methods in Maple, Mathematica, and REDUCE. As a noncommercial package we include the MuPAD system.
Author: | Wolfram Koepf |
---|---|
Document Type: | ZIB-Report |
Date of first Publication: | 1995/12/19 |
Series (Serial Number): | ZIB-Report (SC-95-42) |
ZIB-Reportnumber: | SC-95-42 |
Published in: | Appeared in: Computer Algebra Systems: A Practical Guide. Rev. Vers. under title: Efficient Computation of Chebyshev Polynomials, John Wiley, Chichester, 1999, 79-99 |