On the best least squares approximation of continuous functions using linear splines with free knots

IMA Journal of Numerical Analysis

Volumn 11, Issue 3, 1991, Pages 393-409

  Loach, P D ^a   Wathen, A J ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000046383     PISSN: 02724979     EISSN: None     Source Type: Journal    
DOI: 10.1093/imanum/11.3.393     Document Type: Article

References (22)

1. Baines, M. J., and Wathen, A. J. 1988 Moving finite element methods for evolutionary problems I: theory. J. Comput. Phys.79, 245-269.
2. Baker, A. J. 1985 CFD finite element penalty algorithm. In: The Mathematics of Finite Elements and Applications V (J. R. Whiteman, Ed.). London: Academic Press. Pp. 391-414.
3. Barrow, D. L., Chui, C. K., Smith, P. W., and Ward, J. D. 1978 Unicity of best mean approximation by second order splines with variable knots. Math. Comput.32, 1131-1143.
4. Bellman, R. E., and Dreyfus, S. E. 1962Applied Dynamic Programming.Princeton, NJ: Princeton University Press.
5. Blom, J. G., Sanz-Serna, J. M., and Verwer, J. G. 1988 On simple moving grid methods for one-dimensional evolutionary partial differential equations. J. Comput. Phys.74, 191-213.
6. Carey, G. F., and Dinh, H. T. 1985 Grading functions and mesh redistribution. SIAM J. Numer. Anal.22, 1028-1040.
7. Chui, C. K., Smith, P. W., and Ward, J. D.1977On the smoothness of best L2 approximants from nonlinear spline manifolds. Math. Comput.31, 17-23.
8. de Boor, C. 1969 On the approximation by /-polynomials. In: Approximation with Special Emphasis on Spline Functions (I. J. Schoenberg, ed.). New York: Academic Press. Pp. 157-183.
9. de Boor, C., and Rice, J. R. 1968 Least squares cubic spline approximation II: variable knots. CSD TR 21, Purdue University, West Lafayette, Indiana.
10. Fischer, B. 1988 An algorithm for Chebyshev approximation by splines with free knots. Universität Hamburg, Institute fur Angewandte Mathematik, 2000 Hamburg 13.
11. Flannery, B. P., Press, W. H., Teukolsky, S. A., and Vetterling, W. T. 1986Numerical Recipes-The Art of Scientific Computing.Cambridge: Cambridge University Press.
12. Handscomb, D. C. 1970 Characterisation of best spline approximations with free knots. In: Approximation Theory.London: Academic Press. Pp. 63-70.
13. Hobby, C. R., and Rice, J. R. 1967 Approximation from a curve of functions. Arch. Rational Mech. Anal.27, 91-106.
14. Jupp, D. L. B. 1975The ‘lethargy’ theorem-a property of approximation by y-polynomials. J. Approximation Theory.14, 204-217.
15. Jupp, D. L. B. 1978 Approximation to data by splines with free knots. SIAM J. Numer. Anal.15, 328-343.
16. Knuth, D. E. 1975The Art of Computer Programming, Vol. 4. Reading, MA: Addison-Wesley.
17. Lyche, T., and Morken, K. 1987 Knot removal for parametric B-spline curves and surfaces. CAGD4, 217-230.
18. Powell, M. J. D. 1968On best L2 spline approximations. In: Numerische Mathematik, Differentialgleichungen, Approximations-theorie, ISNM 9. Basel: Birkhauser Verlag. Pp. 317-339.
19. Powell, M. J. D. 1981Approximation Theory and Methods.Cambridge: Cambridge University Press.
20. Rice, J. R. 1964The Approximation of Functions, Vol. 1. Reading, MA: Addison-Wesley.
21. Rice, J. R. 1969The Approximation of Functions, Vol. 2. Reading, MA: Addison-Wesley.
22. Schumaker, L. L. 1969 On the smoothness of best spline approximations. J. Approximation Theory2, 410-418.