One method for searching the best discrete TL_p approximation (CROSBI ID 90519)
Prilog u časopisu | izvorni znanstveni rad
Podaci o odgovornosti
Sabo, Kristian ; Baumgartner, Alfonzo
engleski
One method for searching the best discrete TL_p approximation
On the basis of the given data we will show how efficiently the best TL_p natural cubic spline can be found. Cases p=1, 2 will be especially considered. The best TL_1 spline is of special interest because it is insensitive to the so called outliers, although for its constuction it is necessary to carry out a multidimensional minimization of an undifferetiable function. For that purpose Nelder-Meads Downhill Simplex Method is used. For the calculation of the distance from the data-point to the spline the Brent Method for onedimensional minimization is used. Also, based on the described methods we will show generating of the optimal curve of the second order on the basis of the given data. The method is illustrated with examples developed on the basis of our own programs written in the C programming language.
discrete TL_p approximation; natural cubic spline
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano