Abstract
In this chapter, we study approximation of a function \(f\in C[a,\, b]\) by another simpler function \(\phi \in C[a,\, b]\) in a general manner. The function \(\phi \) is mostly considered a polynomial of certain degree n. In some cases, \(\phi \) as a rational function is also considered. Interestingly, this deeply theoretical development originated in Chebyshev’s work on mechanisms of machines (see the text of Steffens cited in the Bibliography); but we confine to a few significant results. These theoretical results have contemporarily been put to good use in computer software for efficiently computing transcendental mathematical functions, and obtaining easy to evaluate functional forms that approximate complicated expressions appearing in theoretical and empirical experimental studies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Bose, S.K. (2019). Approximation. In: Numerical Methods of Mathematics Implemented in Fortran. Forum for Interdisciplinary Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-13-7114-1_8
Download citation
DOI: https://doi.org/10.1007/978-981-13-7114-1_8
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-7113-4
Online ISBN: 978-981-13-7114-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)