Computational geometry

Preface 1. The approximation problem and existence of best approximations 2. The uniqueness of best approximations 3. Approximation operators and some approximating functions 4. Polynomial interpolation 5. Divided differences 6. The uniform convergence of polynomial approximations 7. The theory of minimax approximation 8. The exchange algorithm 9. The convergence of the exchange algorithm 10. Rational approximation by the exchange algorithm 11. Least squares approximation 12. Properties of orthogonal polynomials 13. Approximation of periodic functions 14. The theory of best L1 approximation 15. An example of L1 approximation and the discrete case 16. The order of convergence of polynomial approximations 17. The uniform boundedness theorem 18. Interpolation by piecewise polynomials 19. B-splines 20. Convergence properties of spline approximations 21. Knot positions and the calculation of spline approximations 22. The Peano kernel theorem 23. Natural and perfect splines 24. Optimal interpolation Appendices Index.

Approximation theory and methods, by M. J. D. Powell. Pp 339. £25 (hardcover), £8·50 (paperback). 1981. ISBN 0-521-22472-1/29514-9 (Cambridge University Press)

This is a survey of the main results on multivariate polynomial interpolation in the last twenty-five years, a period of time when the subject experienced its most rapid development. The problem is considered from two different points of view: the construction of data points which allow unique interpolation for given interpolation spaces as well as the converse. In addition, one section is devoted to error formulas and another to connections with computer algebra. An extensive list of references is also included.

/pdf/polynomial-interpolation-in-several-variables-xsmcljpc29.pdf

Polynomial interpolation in several variables

A general method for near-best approximations to functionals on R d , using scattered-data information is discussed. The method is actually the moving least-squares method, presented by the Backus-Gilbert approach. It is shown that the method works very well for interpolation, smoothing and derivatives' approximations. For the interpolation problem this approach gives Mclain's method. The method is near-best in the sense that the local error is bounded in terms of the error of a local best polynomial approximation. The interpolation approximation in R d is shown to be a C∞ function, and an approximation order result is proven for quasi-uniform sets of data points.

/pdf/the-approximation-power-of-moving-least-squares-54b8mx7wwf.pdf

The approximation power of moving least-squares

We consider the numerical calculation of several matrix eigenvalue problems which require some manipulation before the standard algorithms may be used. This includes finding the stationary values of a quadratic form subject to linear constraints and determining the eigenvalues of a matrix which is modified by a matrix of rank one. We also consider several inverse eigenvalue problems. This includes the problem of determining the coefficients for the Gauss–Radau and Gauss–Lobatto quadrature rules. In addition, we study several eigenvalue problems which arise in least squares.

Some modified matrix eigenvalue problems.

https://www.math.unipd.it/~marcov/pdf/PaduaCurve3.pdf

Bivariate Lagrange interpolation at the Padua points: The generating curve approach

Theorems of Jackson type are given, for the simultaneous approximation of a function of class Cm and its partial derivatives, by a polynomial and the corresponding partial derivatives.

Multivariate simultaneous approximation

Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange interpolation.

/pdf/geometric-weakly-admissible-meshes-discrete-least-squares-1q6xpngycq.pdf

Len Bos

Papers

Bivariate Lagrange interpolation at the Padua points: The generating curve approach

Multivariate simultaneous approximation

Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points

Bounding the Lebesgue function for Lagrange interpolation in a simplex

On certain configurations of points in R n which are unisolvent for polynomial interpolation