In addition to coverage of univariate interpolation and approximation, the text includes material on multivariate interpolation and multivariate numerical integration, a generalization of the Bernstein polynomials that has not previously appeared in book form, and a greater coverage of Peano kernel theory than is found in most textbooks. There are many worked examples and each section ends with a number of carefully selected problems that extend the student's understanding of the text. The author is well known for his clarity of writing and his many contributions as a researcher in approximation theory.

Intermediate-level survey covers remainder theory, convergence theorems, and uniform and best approximation. Other topics include least square approximation, Hilbert space, orthogonal polynomials, theory of closure and completeness, and more. 1963 edition.

This book introduces general theory by presenting the most important facts on multivariate interpolation, quadrature, orthogonal projections and their summation, all treated under a constructive view, and embedded in the theory of positive linear operators. On this background, the book builds the first comprehensive introduction to the theory of generalized hyperinterpolation. Several parts of the book are based on rotation principles, which are presented in the beginning of the book.

This is a textbook on classical polynomial and rational approximation theory for the twenty-first century. Aimed at advanced undergraduates and graduate students across all of applied mathematics, it uses MATLAB to teach the field’s most important ideas and results. Approximation Theory and Approximation Practice, Extended Edition differs fundamentally from other works on approximation theory in a number of ways: its emphasis is on topics close to numerical algorithms; concepts are illustrated with Chebfun; and each chapter is a PUBLISHable MATLAB M-file, available online. The book centers on theorems and methods for analytic functions, which appear so often in applications, rather than on functions at the edge of discontinuity with their seductive theoretical challenges. Original sources are cited rather than textbooks, and each item in the bibliography is accompanied by an editorial comment. In addition, each chapter has a collection of exercises, which span a wide range from mathematical theory to Chebfun-based numerical experimentation. This textbook is appropriate for advanced undergraduate or graduate students who have an understanding of numerical analysis and complex analysis. It is also appropriate for seasoned mathematicians who use MATLAB.

Most functions that occur in mathematics cannot be used directly in computer calculations. Instead they are approximated by manageable functions such as polynomials and piecewise polynomials. The general theory of the subject and its application to polynomial approximation are classical, but piecewise polynomials have become far more useful during the last twenty years. Thus many important theoretical properties have been found recently and many new techniques for the automatic calculation of approximations to prescribed accuracy have been developed. This book gives a thorough and coherent introduction to the theory that is the basis of current approximation methods. Professor Powell describes and analyses the main techniques of calculation supplying sufficient motivation throughout the book to make it accessible to scientists and engineers who require approximation methods for practical needs. Because the book is based on a course of lectures to third-year undergraduates in mathematics at Cambridge University, sufficient attention is given to theory to make it highly suitable as a mathematical textbook at undergraduate or postgraduate level.

Mathematics of Computing -- Numerical Analysis.