Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Select your language


Constructing best chebyshev spline approximations

Vakal L.1
1 V.M. Hlushkov Institute of Cybernetics of NAS of Ukraine

Full text (PDF)

UDC: 004.021:519.651
Publication Language: Ukrainian
Stuc. intelekt. 2017; 22(2):94-100

Abstract: In order to compute the best Chebyshev (uniform) approximation for a given function by polynomial spline of degree n with r fixed knots it is proposed to apply, after an appropriate modification, an algorithm for approximating many-variables function by a generalized polynomial. In the algorithm a reduction to the linear programming problem with the main dual maximum-problem is used. Analysis of the numerical results showed that in most cases the modified algorithm has computed spline approximations more precisely than other known algorithms.

Keywords: polynomial spline, best Chebyshev approximation, algorithm, linear programming.

References:

  1. Popov B.A. Ravnomernoe priblizhenie splaynami / B.А. Popov. – Кiev: Nauk. dumka, 1989. – 272 s.
  2. Berdyshev V.I. Approksimatsiya funktsiy, szhatie chislennoy informatsii, prilozheniya / V.I. Berdyshev,L.V. Petrak. – Ekaterinburg: UrO RAN, 1999. – 297 с.
  3. Malachivs'kyy P. Neperervne y hladke rivnomirne splayn-nablyzhennya temperaturnoyi kharakterystykysensora ta yoho chutlyvosti / P. Malachivs'kyy, Ya. Pizyur, V. Andrunyk // Vymiryuval'na tekhnika tametrolohiya. – 2007. – № 67. – S. 24–30.
  4. Stechkin S.B. Splayny v vychislitelnoy matematike / S.B. Stechkin, Yu.N. Subbotin. – M.: Nauka, 1976. – 248 s.
  5. Kornejchuk N.P. Tochnyie konstanty v teorii priblizheniya / N.P. Kornejchuk. – M.: Nauka, 1987. – 424 s.
  6. Berdyshev V.I. Chislennye metody priblizheniya funktsiy / V.I. Berdyshev, Yu.N. Subbotin. –Sverdlovsk: Sredne-Uralskoe kn. izd-vo, 1979. – 120 s.
  7. Barrodale J. A note on numerical procedures for approximation by spline functions / J. Barrodale,A. Young // Comput. J. – 1966. – Vol. 9. – P. 318 – 320.
  8. Esch R.E. Computational methods for the best spline function approximation / R.E. Esch, W.L. Eastman// J. Approx. Theory. – 1969. – Vol. 2. – P. 85 – 96.
  9. Remez E.Ya. Osnovy chislennyh metodov chebyshevskogo priblizheniya / E.Ya. Remez. – Kiev: Nauk.dumka, 1969. – 623 s.
  10. Vakal L.P. Analitychna obrobka danykh na osnovi chebyshovs'koyi aproksymatsiyi / L.P. Vakal,A.O. Kalenchuk-Porkhanova // Matematychni mashyny i systemy. – 2006. – № 2. – С. 15 – 24.
  11. Kalenchuk-Porhanova A.A. Apparat approksimatsii v sostave programmnogo obespecheniyasuperkomp'yutera s klasternoy arhitekturoy / A.A. Kalenchuk-Porhanova, L.P. Vakal // Shtuchnyyintelekt. – 2009. – № 1. – S. 158 – 165.
  12. Schumaker L.L. Some algorithms for the computation of interpolating and approximating splinefunctions / Schumaker L.L. // T.N.E. Greville (Ed.) Theory and applications of spline functions. – NewYork: Academic Press, 1969. – P. 87 – 102.
  13. Nürnberger G. A Remez type algorithm for spline functions / G. Nürnberger, M. Sommer // Numer.Math. – 1983. – Vol. 41, N 1. – P. 117 – 146.
  14. Kalenchuk-Porkhanova A.O. Pobudova naykrashchykh rivnomirnykh nablyzhen' funktsiy bahat'okhzminnykh / A.O. Kalenchuk-Porkhanova, L.P. Vakal // Komp"yuterni zasoby, merezhi ta systemy. –2007. – № 6. – S. 141 – 148.
  15. Kondrat'ev V.P. Algoritm nailuchshego priblizheniya funktsiy mnogih peremennyh / V.P. Kondrat'ev // Programmyioptimizatsii(priblizhenie funktsiy). – Sverdlovsk: IMM UNTsAN SSSR. – 1972. – Vyp. 3.  S. 20  48.

View full text (PDF)