Reference points based transformation and approximation

Csaba Török

Kybernetika (2013)

  • Volume: 49, Issue: 4, page 644-662
  • ISSN: 0023-5954

Abstract

top
Interpolating and approximating polynomials have been living separately more than two centuries. Our aim is to propose a general parametric regression model that incorporates both interpolation and approximation. The paper introduces first a new r -point transformation that yields a function with a simpler geometrical structure than the original function. It uses r 2 reference points and decreases the polynomial degree by r - 1 . Then a general representation of polynomials is proposed based on r 1 reference points. The two-part model, which is suited to piecewise approximation, consist of an ordinary least squares polynomial regression and a reparameterized one. The later is the central component where the key role is played by the reference points. It is constructed based on the proposed representation of polynomials that is derived using the r -point transformation T r ( x ) . The resulting polynomial passes through r reference points and the other points approximates. Appropriately chosen reference points ensure quasi smooth transition between the two components and decrease the dimension of the LS normal matrix. We show that the model provides estimates with such statistical properties as consistency and asymptotic normality.

How to cite

top

Török, Csaba. "Reference points based transformation and approximation." Kybernetika 49.4 (2013): 644-662. <http://eudml.org/doc/260700>.

@article{Török2013,
abstract = {Interpolating and approximating polynomials have been living separately more than two centuries. Our aim is to propose a general parametric regression model that incorporates both interpolation and approximation. The paper introduces first a new $r$-point transformation that yields a function with a simpler geometrical structure than the original function. It uses $r \ge 2$ reference points and decreases the polynomial degree by $r-1$. Then a general representation of polynomials is proposed based on $r \ge 1$ reference points. The two-part model, which is suited to piecewise approximation, consist of an ordinary least squares polynomial regression and a reparameterized one. The later is the central component where the key role is played by the reference points. It is constructed based on the proposed representation of polynomials that is derived using the $r$-point transformation $T_r(x)$. The resulting polynomial passes through $r$ reference points and the other points approximates. Appropriately chosen reference points ensure quasi smooth transition between the two components and decrease the dimension of the LS normal matrix. We show that the model provides estimates with such statistical properties as consistency and asymptotic normality.},
author = {Török, Csaba},
journal = {Kybernetika},
keywords = {polynomial representation; approximation model; smooth connection; consistency; asymptotic normality; polynomial representation; approximation model; smooth connection; consistency; asymptotic normality},
language = {eng},
number = {4},
pages = {644-662},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Reference points based transformation and approximation},
url = {http://eudml.org/doc/260700},
volume = {49},
year = {2013},
}

TY - JOUR
AU - Török, Csaba
TI - Reference points based transformation and approximation
JO - Kybernetika
PY - 2013
PB - Institute of Information Theory and Automation AS CR
VL - 49
IS - 4
SP - 644
EP - 662
AB - Interpolating and approximating polynomials have been living separately more than two centuries. Our aim is to propose a general parametric regression model that incorporates both interpolation and approximation. The paper introduces first a new $r$-point transformation that yields a function with a simpler geometrical structure than the original function. It uses $r \ge 2$ reference points and decreases the polynomial degree by $r-1$. Then a general representation of polynomials is proposed based on $r \ge 1$ reference points. The two-part model, which is suited to piecewise approximation, consist of an ordinary least squares polynomial regression and a reparameterized one. The later is the central component where the key role is played by the reference points. It is constructed based on the proposed representation of polynomials that is derived using the $r$-point transformation $T_r(x)$. The resulting polynomial passes through $r$ reference points and the other points approximates. Appropriately chosen reference points ensure quasi smooth transition between the two components and decrease the dimension of the LS normal matrix. We show that the model provides estimates with such statistical properties as consistency and asymptotic normality.
LA - eng
KW - polynomial representation; approximation model; smooth connection; consistency; asymptotic normality; polynomial representation; approximation model; smooth connection; consistency; asymptotic normality
UR - http://eudml.org/doc/260700
ER -

References

top
  1. Csörgő, S., Mielniczuk, J., 10.1214/aos/1176324633, Ann. Statist. 23 (1995), 3, 1000-1014. Zbl0852.62035MR1345211DOI10.1214/aos/1176324633
  2. Dikoussar, N. D., 10.1016/S0010-4655(96)00110-5, Comput. Phys. Commun. 99 (1997), 235-254. Zbl0927.65009DOI10.1016/S0010-4655(96)00110-5
  3. Dikoussar, N. D., Kusochno-kubicheskoje priblizhenije I sglazhivanije krivich v rezhime adaptacii., Communication JINR, P10-99-168, Dubna 1999. 
  4. Dikusar, N. D., 10.1134/S2070048211040053, Math. Models Comput. Simulat. 3 (2011), 4, 492-507. Zbl1240.65077MR2810219DOI10.1134/S2070048211040053
  5. Dikoussar, N. D., Török, Cs., Automatic knot finding for piecewise-cubic approximation., Matem. Mod. 18 (2006), 3, 23-40. Zbl1099.65014MR2255951
  6. Dikoussar, N. D., Török, Cs., On one approach to local surface smoothing., Kybernetika 43 (2007), 4, 533-546. Zbl1139.65009MR2377931
  7. Eubank, R. L., Nonparametric Regression and Spline Smoothing., Marcel Dekker, Inc., 1999. Zbl0936.62044MR1680784
  8. Kahaner, D., Moler, C., Nash, S., Numerical Methods and Software., Prentice-Hall, Inc., 1989. Zbl0744.65002
  9. Kepič, T., Török, Cs., Dikoussar, N. D., Wavelet compression., In: 13. International Workshop on Computational Statistics, Bratislava 2004, pp. 49-52. 
  10. Matejčiková, A., Török, Cs., Noise suppression in RDPT., Forum Statisticum Slovacum 3 (2005), 199-203. 
  11. Nadaraya, E. A., On estimating regression., Theory Probab. Appl. 9 (1964), 141-142. Zbl0136.40902
  12. Révayová, M., Török, Cs., Piecewise approximation and neural networks., Kybernetika 43 (2007), 4, 547-559. Zbl1145.68495MR2377932
  13. Révayová, M., Török, Cs., Reference points based recursive approximation., Kybernetika 49 (2013), 1, 60-72. 
  14. Riplay, B. D., Pattern Recognition and Neural Networks., Cambridge University Press 1996. MR1438788
  15. Seber, G. A. F., Linear Regression Analysis., J. Wiley and Sons, New York 1977. Zbl1029.62059MR0436482
  16. Török, Cs., 10.1016/S0010-4655(99)00483-X, Comput. Phys. Commun. 125 (2000), 154-166. Zbl0976.65011DOI10.1016/S0010-4655(99)00483-X
  17. Török, Cs., Dikoussar, N. D., 10.1016/S0898-1221(99)00276-X, Comput. Math. Appl. 38 (1999), 211-220. MR1718884DOI10.1016/S0898-1221(99)00276-X
  18. Trefethen, L. N., Approximation Theory and Approximation Practice., SIAM, 2013. Zbl1264.41001MR3012510

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.