Algorithms: Algorithm 332: Jacobi polynomials

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms: Algorithm 332: Jacobi polynomials

Full text

Pdf (1.27 MB)

Source

Communications of the ACM archive
Volume 11 , Issue 6 (June 1968) table of contents

Pages: 436 - 437

Year of Publication: 1968

ISSN:0001-0782

Author

Bruno F. W. Whitte

U.S. Navy Electronics Lab, Center, San Diego, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 18, Citation Count: 1

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363347.363393 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bateman Manuscript Project, Calif. Inst. of Tech. Higher Transcendental Functions, vol. 2. McGraw-Hill, New York, 1953, pp. 168-174.
	2	SZEG~, C. Orthogonal Polynomials. Colloq. Publ., vol. 23. American Mathematical Society, New York, 1939, pp. 136- 138.
	3	STROUD, A. H ., AND SECREST, D. Gaussian Quadrature Formulas. Prentice-Hall, Englewood Cliffs, N. J., 1966, pp. 17-31.

CITED BY

Tim Hopkins, Renovating the collected algorithms from ACM, ACM Transactions on Mathematical Software (TOMS), v.28 n.1, p.59-74, March 2002

INDEX TERMS

Keywords:
Jacobi polynomials, orthogonal polynomials, special functions, three-term recurrences

Adobe Acrobat

QuickTime

Windows Media Player

Real Player