Research Article Open Access

On Discrete Least Squares Polynomial Fit, Linear Spaces and Data Classification

François Dubeau and Youness Mir

Abstract

The best discrete least squares polynomial fit to a data set is revisited. We point out some properties related to the best polynomial and precise the dimension of vector spaces encountered to solve the problem. Finally, we suggest a basic classification of data sets based on their increasing or decreasing trend, and on their convexity or concavity form.

Journal of Mathematics and Statistics
Volume 3 No. 4, 2007, 222-227

DOI: https://doi.org/10.3844/jmssp.2007.222.227

Submitted On: 12 July 2007 Published On: 31 December 2007

How to Cite: Dubeau, F. & Mir, Y. (2007). On Discrete Least Squares Polynomial Fit, Linear Spaces and Data Classification . Journal of Mathematics and Statistics, 3(4), 222-227. https://doi.org/10.3844/jmssp.2007.222.227

  • 3,364 Views
  • 2,123 Downloads
  • 0 Citations

Download

Keywords

  • Polynomial data fitting
  • weighted least squares
  • orthogonal polynomials
  • linear spaces
  • data classification