Approximation

Heinz Rutishauser

Chapter Chapter 7 in Lectures on Numerical Mathematics, 1990, pp 175-207 from Springer

Abstract: Abstract While interpolation attempts to approximate a functionpiecewise by polynomials which pass exactly through prescribed support points, we shall now try to approximate a given function f(x) on a (relatively large) intervalI by one polynomial. Such an approximation polynomial, naturally, must be of a higher degree than in the case where f(x) is approximated by polynomial pieces.

Keywords: Discrete Fourier Transform; Chebyshev Polynomial; Recurrence Formula; Chebyshev Approximation; Chebyshev Series (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3468-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461234685

DOI: 10.1007/978-1-4612-3468-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().