## Approximation theory: proceedings of a symposium held at Lancaster, July 1969 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Error estimates for best polynomial approximations | 1 |

Orthogonal polynomial approximation methods in numerical analysis | 7 |

Asymptotic properties and the convergence of numerical quadratures | 35 |

Copyright | |

22 other sections not shown

### Other editions - View all

### Common terms and phrases

algorithm alternant Amer analytic applications Approximation of Functions approximation problem approximation theory approximation to f(x Banach space best approximation bigradient bounded Cauchy interpolation Chebyshev polynomials Cheney coefficients compact computation constant constraints continuous functions converges uniformly convex programming convex set Corollary corresponding curve defined definition denote derivatives determinant differential equations discrete elements equivalent example exists ext S(X finite function f given H-set Haar subspace Hausdorff Hausdorff distance Hence Hilbert space inequality integral interpolating projections interpolating subspace interpolation problem interval Lemma linear programming Math matrix minimax approximation monotone n-dimensional Nauk nodes nonlinear programming normed space obtain orthogonal parameters points polynomial approximation polynomial of degree Proof prove proximity map quadratic quadrature rational approximation rational functions result satisfies sequence solution spline function subset Tchebycheff Theorem 2.1 uniform convergence unique values variables zeros