Geodesic
Reference points based recursive approximation
Kybernetika, Tome 49 (2013) no. 1, pp. 60-72 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The paper studies polynomial approximation models with a new type of constraints that enable to get estimates with significant properties. Recently we enhanced a representation of polynomials based on three reference points. Here we propose a two-part cubic smoothing scheme that leverages this representation. The presence of these points in the model has several consequences. The most important one is the fact that by appropriate location of the reference points the resulting approximant of two successively assessed neighboring approximants will be smooth. We also show that the considered models provide estimates with appropriate statistical properties such as consistency and asymptotic normality.
The paper studies polynomial approximation models with a new type of constraints that enable to get estimates with significant properties. Recently we enhanced a representation of polynomials based on three reference points. Here we propose a two-part cubic smoothing scheme that leverages this representation. The presence of these points in the model has several consequences. The most important one is the fact that by appropriate location of the reference points the resulting approximant of two successively assessed neighboring approximants will be smooth. We also show that the considered models provide estimates with appropriate statistical properties such as consistency and asymptotic normality.
Classification : 41A10, 62-07, 62F10, 62J05, 62L12, 65D05, 65D07, 65D10
Keywords: approximation model; consistency; asymptotic normality 
@article{KYB_2013_49_1_a4,
     author = {R\'evayov\'a, Martina and T\"or\"ok, Csaba},
     title = {Reference points based recursive approximation},
     journal = {Kybernetika},
     pages = {60--72},
     year = {2013},
     volume = {49},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2013_49_1_a4/}
}
TY  - JOUR
AU  - Révayová, Martina
AU  - Török, Csaba
TI  - Reference points based recursive approximation
JO  - Kybernetika
PY  - 2013
SP  - 60
EP  - 72
VL  - 49
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KYB_2013_49_1_a4/
LA  - en
ID  - KYB_2013_49_1_a4
ER  - 
%0 Journal Article
%A Révayová, Martina
%A Török, Csaba
%T Reference points based recursive approximation
%J Kybernetika
%D 2013
%P 60-72
%V 49
%N 1
%U http://geodesic.mathdoc.fr/item/KYB_2013_49_1_a4/
%G en
%F KYB_2013_49_1_a4
Révayová, Martina; Török, Csaba. Reference points based recursive approximation. Kybernetika, Tome 49 (2013) no. 1, pp. 60-72. http://geodesic.mathdoc.fr/item/KYB_2013_49_1_a4/

[1] Dikoussar, N. D.: Adaptive projective filters for track finding. Comput. Phys. Commun. 79 (1994), 39-51. | DOI

[2] Dikoussar, N. D.: Kusochno-kubicheskoje priblizhenije I sglazhivanije krivich v rezhime adaptacii. Comm. JINR, P10-99-168, Dubna 1999.

[3] Dikoussar, N. D., Török, Cs.: Automatic knot finding for piecewise-cubic approximation. Mat. Model. T-17 (2006), 3. | MR | Zbl

[4] Dikoussar, N. D., Török, Cs.: Approximation with DPT. Comput. Math. Appl. 38 (1999), 211-220. | MR

[5] Haykin, S.: Adaptive Filter Theory. Prentice Hall, 2002 | Zbl

[6] Nadaraya, E. A.: On estimating regression. Theory Probab. Appl. 9 (1964 ), 141-142. | Zbl

[7] Reinsch, Ch. H.: Smoothing by spline functions. Numer. Math. 10 (1967), 177-183. | DOI | MR | Zbl

[8] Révayová, M., Török, Cs.: Piecewise approximation and neural networks. Kybernetika 43 (2007), 4, 547-559. | MR | Zbl

[9] Ripley, B. D.: Pattern Recognision and Neural Networks. Cambridge University Press, 1996. | MR

[10] Török, Cs.: 4-point transforms and approximation. Comput. Phys. Commun. 125 (2000), 154-166. | DOI | Zbl

[11] Wasan, M. T.: Stochastic Approximation. Cambridge University Press, 2004. | MR | Zbl