Methods of Numerical Approximation

Methods of Numerical Approximation

Lectures Delivered at a Summer School Held at Oxford University, September 1965

1st Edition - January 1, 1966

Write a review

  • Editor: D. C. Handscomb
  • eBook ISBN: 9781483149028

Purchase options

Purchase options
DRM-free (PDF)
Sales tax will be calculated at check-out

Institutional Subscription

Free Global Shipping
No minimum order


Methods of Numerical Approximation is based on lectures delivered at the Summer School held in September 1965, at Oxford University. The book deals with the approximation of functions with one or more variables, through means of more elementary functions. It explains systems to approximate functions, such as trigonometric sums, rational functions, continued fractions, and spline functions. The book also discusses linear approximation including topics such as convergence of polynomial interpolation and the least-squares approximation. The text analyzes Bernstein polynomials, Weierstrass' theorem, and Lagrangian interpolation. The book also gives attention to the Chebyshev least-squares approximation, the Chebyshev series, and the determination of Chebyshev series, under general methods. These general methods are useful when the student wants to investigate practical methods for finding forms of approximations under various situations. One of the lectures concerns the general theory of linear approximation and the existence of a best approximation approach using different theorems. The book also discusses the theory and calculation of the best rational approximations as well as the optimal approximation of linear functionals. The text will prove helpful for students in advanced mathematics and calculus. It can be appreciated by statisticians and those working with numbers theory.

Table of Contents

  • Editor's Preface

    I. General

    1. Introduction

    2. Some Abstract Concepts and Definitions

    II. Linear Approximation

    3. Convergence of Polynomial Interpolation

    4. Least-Squares Approximation. Orthogonal Polynomials

    5. Chebyshev Least-Squares Approximation

    6. Determination and Properties of Chebyshev Expansions

    7. The General Theory of Linear Approximation

    8. The Exchange Algorithm on a Discrete Point Set

    9. Calculation of the Best Linear Approximation on a Continuum

    10. The Rate of Convergence of Best Approximations

    III. Rational Approximation

    11. Continued Fractions

    12. Interpolation by Rational Functions

    13. Economization of Continued Fractions

    14. The Pade Table

    15. Applications of the QD and ε Algorithms

    16. Theory and Calculation of Best Rational Approximations

    17. Convergence of Rational Approximations

    IV. Miscellaneous

    18. Theory of General Non-linear Minimax Approximation

    19. Spline Functions

    20. Optimal Approximation of Linear Functionals

    21. Optimal Approximation by Means of Spline Functions

    22. An Introduction to ε-Entropy

    23. Functions of Many Variables

    24. Practical Considerations


    Further References


Product details

  • No. of pages: 228
  • Language: English
  • Copyright: © Pergamon 1966
  • Published: January 1, 1966
  • Imprint: Pergamon
  • eBook ISBN: 9781483149028

About the Editor

D. C. Handscomb

Ratings and Reviews

Write a review

There are currently no reviews for "Methods of Numerical Approximation"