Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T12:29:29.409Z Has data issue: false hasContentIssue false

The numerical solution of integral equations using Chebyshev polynomials

Published online by Cambridge University Press:  09 April 2009

David Elliott
Affiliation:
Mathematics Department, University of Adelaide, Adelaide, S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An investigation has been made into the numerical solution of non-singular linear integral equations by the direct expansion of the unknown function f(x) into a series of Chebyshev polynomials of the first kind. The use of polynomial expansions is not new, and was first described by Crout [1]. He writes f(x) as a Lagrangian-type polynomial over the range in x, and determines the unknown coefficients in this expansion by evaluating the functions and integral arising in the equation at chosen points xi. A similar method (known as collocation) is used here for cases where the kernel is not separable. From the properties of expansion of functions in Chebyshev series (see, for example, [2]), one expects greater accuracy in this case when compared with other polynomial expansions of the same order. This is well borne out in comparison with one of Crout's examples.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1960