Hostname: page-component-848d4c4894-p2v8j Total loading time: 0 Render date: 2024-05-11T00:37:11.161Z Has data issue: false hasContentIssue false
  • English
  • Français

Uniform partition and the best least-squares piecewise polynomial approximation

Published online by Cambridge University Press:  17 April 2009

François Dubeau
François Dubeau
Affiliation:
Département de Mathématiques, Collège militaire royal de Saint-Jean, Saint-Jean-sur-Richelieu Québec, Canada, JOJ 1RO
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It is shown that the best least-squares piecewise n degree polynomial approximation of xn+1 over [a, b] is obtained for a uniform partition. Moreover the approximation is continuous for n odd and discontinuous, with equal stepsizes at the nodes, for n even.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 44 , Issue 2 , October 1991 , pp. 279 - 283
Copyright
Copyright © Australian Mathematical Society 1991

References

[1]Bechenbach, E.F. and Bellman, R., Inequalities (Springer-Verlag, Berlin, Heidelberg, New York, 1965).CrossRefGoogle Scholar
[2]Bellman, R., ‘On the approximation of curves by line segments using dynamic programming’, Comm. ACM 4 (1961), 284.CrossRefGoogle Scholar
[3]Cantoni, A., ‘Optimal curve fitting with piecewise linear functions’, IEEE Trans. Comput. (1971), 59–67.CrossRefGoogle Scholar
[4]Cheney, E.W., Introduction to approximation theory (McGraw-Hill, New York, 1966).Google Scholar
[5]Cooper, R., ‘Notes on certain inequalities: II’, J. London. Math. Soc. 2 (1927), 159–163.CrossRefGoogle Scholar
[6]Gluss, B., ‘Further remarks on line segment curve-fitting using dynamic programming’, Comm. ACM 5 (1962), 441–443.CrossRefGoogle Scholar
[7]Imai, H. and Iri, M., ‘Computational-geometric methods for polygonal approximations of a curve’, Comput. Vision Graphics Image Process 36 (1986), 31–41.CrossRefGoogle Scholar
[8]Kurozumi, Y. and Davis, W.A., ‘Polygonal approximation by the minimax method’, Comput. Graphics and Image Processing 19 (1982), 248–264.CrossRefGoogle Scholar
[9]Leung, M.K. and Yang, Y.-H., ‘Dynamic strip algorithm in curve fitting’, Comput. Vision Graphics Image Process. 51 (1990), 146–165.CrossRefGoogle Scholar
[10]Ream, N., ‘Note on: Approximation of curves by line segments’, Math. Comp. 15 (1961), 418–419.Google Scholar
[11]Scheid, F., Numerical analysis, Schaum's outline series (McGraw-Hill, New York, 1968).Google Scholar
[12]Stone, H., ‘Approximation of curves by line segments’, Math. Comp. 15 (1961), 40–47.CrossRefGoogle Scholar
[13]Tomek, I., ‘Two algorithms for piecewise-linear continuous approximation of functions of one variable’, IEEE Trans. Comput. 23 (1974), 445–448.CrossRefGoogle Scholar