Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


A method for the approximation of functions defined by formal series expansions in orthogonal polynomials

Author: Jonas T. Holdeman
Journal: Math. Comp. 23 (1969), 275-287
MSC: Primary 41.30; Secondary 42.00
MathSciNet review: 0251412
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: An algorithm is described for numerically evaluating functions defined by formal (and possibly divergent) series as well as convergent series of orthogonal functions which are, apart from a factor, orthogonal polynomials. When the orthogonal functions are polynomials, the approximations are rational functions. The algorithm is similar in some respects to the method of Padé approximants. A rational approximation involving Tchebychev polynomials due to H. Maehley and described by E. Kogbetliantz [1] is a special case of the algorithm.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 41.30, 42.00

Retrieve articles in all journals with MSC: 41.30, 42.00

Additional Information

PII: S 0025-5718(1969)0251412-1
Article copyright: © Copyright 1969 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia