Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Approximation theory and approximation practice
Trefethen L., Society for Industrial and Applied Mathematics, Philadelphia, PA, 2012. 318 pp.  Type: Book (978-1-611972-39-9)
Date Reviewed: Apr 1 2013

Many of the numerical algorithms used in today’s scientific computing are built on results from classical approximation theory. However, in spite of its significance, activities in this area have suffered a noticeable decline since the late 1990s. The fact that this trend has now been reversed is evident in the fact that numerous new textbooks in approximation theory have been published recently [1,2,3]. Most of these textbooks cover traditional content and are written in a classical style. In contrast, this new work deviates from the usual paths in both respects.

The author discusses the usual questions, but under a somewhat different fundamental assumption. Specifically, while one traditionally used to deal with functions of a limited degree of smoothness (that is, a finite number of derivatives), this book focuses on analytic functions and argues that, in practice, all relevant functions are analytic--possibly after a suitable transformation--or at least piecewise analytic, and, in the latter case, should be handled in a piecewise manner.

This approach has significant implications. For example, classical methods and results like Peano kernels and Jackson and Bernstein theorems become irrelevant in such a context; here, they are replaced by Cauchy kernels and related error bounds.

Another important point the author emphasizes is the fact that suitably chosen polynomials, mainly based on Chebyshev points, can usually provide approximations that are almost as good as the optimal ones, but much easier to compute. These should therefore be the tool of choice. Thus, the core of the book explores methods based on this approach and describes their theoretical and practical properties.

The style of writing is also highly nonclassical. As a matter of fact, each chapter is actually a hardcopy of a MATLAB M-file that can be downloaded from a companion website. As the title of the book suggests, the development of the theory is accompanied by many practical exercises and examples, all of which are coded in MATLAB and heavily use the author’s Chebfun package. At first sight, this is a very attractive feature. However, it also has a slight disadvantage. Because the (sometimes not very self-explanatory) MATLAB syntax is not explained, reading the book and understanding what is actually happening in the examples is occasionally somewhat cumbersome for readers who are not experienced in working with MATLAB.

Nevertheless, this is an excellent overview for readers who are interested in the practical aspects of numerical approximation. If you are more of a theoretical person, you will still find the book worth reading, but to get the complete picture, you should read it in combination with a more classical book.

Reviewer:  Kai Diethelm Review #: CR141094 (1307-0577)
1) de Villiers, J. Mathematics of approximation. Atlantis Press, Paris, France, 2012.
2) Temlyakov, V. Greedy approximation. Cambridge University Press, New York, NY, 2011.
3) Mastroianni, G.; Milovanović, G. Interpolation processes: basic theory and applications. Springer, Berlin, Germany, 2008.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
Approximation (G.1.2 )
Numerical Algorithms (G.1.0 ... )
Numerical Algorithms And Problems (F.2.1 )
Would you recommend this review?
Other reviews under "Approximation": Date
Sparsification and subexponential approximation
Bonnet E., Paschos V.  Acta Informatica 55(1): 1-15, 2018. Type: Article
Jun 14 2018
Antenna orientation and range assignment algorithms in directional WSNs
Tran T., An M., Huynh D.  IEEE/ACM Transactions on Networking 25(6): 3368-3381, 2017. Type: Article
Jun 13 2018
An FPT 2-approximation for tree-cut decomposition
Kim E., Oum S., Paul C., Sau I., Thilikos D.  Algorithmica 80(1): 116-135, 2018. Type: Article
May 7 2018

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy