Pregled bibliografske jedinice broj: 58559
One method for searching the best discrete TL_p approximation
One method for searching the best discrete TL_p approximation // Mathematical Communications - Supplement, 1 (2001), 1; 63-68. (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 58559 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
One method for searching the best discrete TL_p approximation
Autori
Sabo, Kristian ; Baumgartner, Alfonzo
Izvornik
Mathematical Communications - Supplement (1333-0829) 1
(2001), 1;
63-68.
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
discrete TL_p approximation; natural cubic spline
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
165021
Ustanove:
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Citiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- Current Mathematical Publications
- Mathematical Review
- MathSci
- Zentrallblatt fuer Mathematik/Mathematics Abstracts
- MATH on STN International
- CompactMath
- INSPEC
- Current Index to Statistics
- Urlich'
- s