Hostname: page-component-77c78cf97d-lmk9j Total loading time: 0 Render date: 2026-04-29T17:02:05.098Z Has data issue: false hasContentIssue false

Orthogonal polynomials: applications and computation

Published online by Cambridge University Press:  07 November 2008

Walter Gautschi
Affiliation:
Department of Computer SciencesPurdue UniversityWest Lafayette, IN 47907–1398, USA E-mail: wxg@cs.purdue.edu

Extract

We give examples of problem areas in interpolation, approximation, and quadrature, that call for orthogonal polynomials not of the classical kind. We then discuss numerical methods of computing the respective Gauss-type quadrature rules and orthogonal polynomials. The basic task is to compute the coefficients in the three-term recurrence relation for the orthogonal polynomials. This can be done by methods relying either on moment information or on discretization procedures. The effect on the recurrence coefficients of multiplying the weight function by a rational function is also discussed. Similar methods are applicable to computing Sobolev orthogonal polynomials, although their recurrence relations are more complicated. The paper concludes with a brief account of available software.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable