Advertisement

Journal of Optimization Theory and Applications

, Volume 171, Issue 2, pp 536–549 | Cite as

Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions

  • Nadezda Sukhorukova
  • Julien Ugon
Article
  • 143 Downloads

Abstract

In this paper, we derive conditions for best uniform approximation by fixed knots polynomial splines with weighting functions. The theory of Chebyshev approximation for fixed knots polynomial functions is very elegant and complete. Necessary and sufficient optimality conditions have been developed leading to efficient algorithms for constructing optimal spline approximations. The optimality conditions are based on the notion of alternance (maximal deviation points with alternating deviation signs). In this paper, we extend these results to the case when the model function is a product of fixed knots polynomial splines (whose parameters are subject to optimization) and other functions (whose parameters are predefined). This problem is nonsmooth, and therefore, we make use of convex and nonsmooth analysis to solve it.

Keywords

Uniform approximation Polynomial splines Alternance  Weighting functions 

Mathematics Subject Classification

90C51 41A15 41A50 

References

  1. 1.
    Nürnberger, G.: Approximation by Spline Functions. Springer, Berlin (1989)CrossRefMATHGoogle Scholar
  2. 2.
    Nürnberger, G., Schumaker, L., Sommer, M., Strauss, H.: Approximation by generalized splines. J. Math. Anal. Appl. 108, 466–494 (1985)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Rice, J.: Characterization of Chebyshev approximation by splines. SIAM J. Numer. Anal. 4(4), 557–567 (1967)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Schumaker, L.: Uniform approximation by Chebyshev spline functions. II: free knots. SIAM J. Numer. Anal. 5, 647–656 (1968)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Sukhorukova, N., Ugon, J.: Characterization theorem for best linear spline approximation with free knots. Dyn. Contin. Discrete Impuls. Syst. 17(5), 687–708 (2010)MathSciNetMATHGoogle Scholar
  6. 6.
    Sukhorukova, N., Ugon, J.: Characterization theorem for best polynomial spline approximation with free knots. Trans. Am. Math. Soc. arXiv:1412.2323 (2016)
  7. 7.
    Gavurin, M., Malozemov, V.: Extremum problems with linear constraints. Leningrad University Press, Leningrad (1984)MATHGoogle Scholar
  8. 8.
    Vasil’ev, A.A., Malozemov, V.N., Pevnyi, A.B.: Interpolation and approximation by spline functions of arbitrary defect. Vestn. Leningr. Univ. [Mat.] 12, 262–271 (1980)MATHGoogle Scholar
  9. 9.
    Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (1970)CrossRefMATHGoogle Scholar
  10. 10.
    Demyanov, V., Rubinov, A.: Constructive Nonsmooth Analysis. Peter Lang, Frankfurt am Main (1995)MATHGoogle Scholar
  11. 11.
    Demyanov, V., Rubinov, A. (eds.): Quasidifferentiability and Related Topics, Nonconvex Optimization and Its Applications, vol. 43. Kluwer Academic, London (2000)Google Scholar
  12. 12.
    Nürnberger, G.: Bivariate segment approximation and free knot splines: research problems 96–4. Constr. Approx. 12(4), 555–558 (1996)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Zamir, Z.R., Sukhorukova, N., Amiel, H., Ugon, A., Philippe, C.: Optimization-based features extraction for k-complex detection. ANZIAM 55, C384–C398 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Zamir, Z.R., Sukhorukova, N., Amiel, H., Ugon, A., Philippe, C.: Convex optimisation-based methods for k-complex detection. Appl. Math. Comput. 268, 947–956 (2015)MathSciNetGoogle Scholar
  15. 15.
    Zamir, Z.R., Sukhorukova, N.: Linear least squares problems involving fixed knots polynomial splines and their singularity study. arXiv:1503.01176 (2015)
  16. 16.
    Sukhorukova, N.: Uniform approximation by the highest defect continuous polynomial splines: necessary and sufficient optimality conditions and their generalisations. J. Optim. Theory Appl. 147(2), 378–394 (2010)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Demyanov, V., Malozemov, V.: Introduction to Minimax. Wiley, New York (1974)Google Scholar
  18. 18.
    Stiefel, E.: Note on jordan elimination, linear programming and tchebycheff approximation. Numer. Math. 2(1), 1–17 (1960). doi: 10.1007/BF01386203 MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Carathéodory, C.: Uber den variabilitatsbereich der fourierschen konstanten von positiven harmonischen funktionen. Rend. Circ. Mat. Palermo (2) Suppl. 32(1), 193–217 (1911). doi: 10.1007/BF03014795 CrossRefMATHGoogle Scholar
  20. 20.
    Mirrlees, J.A.: Optimal tax theory: a synthesis. J. Public Econ. 6(4), 327–358 (1976)CrossRefGoogle Scholar
  21. 21.
    Tuomala, M.: Optimal Income Tax and Redistribution. Oxford University Press, Oxford (1990)Google Scholar
  22. 22.
    Sukhorukova, N.: A generalization of the remez algorithm to a class of linear spline approximation problems with constraints on spline parameters. Optim. Methods Softw. 23(5), 793–810 (2008)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Remez, E.Y.: General Computation Methods of Chebyshev Approximation. The Problems with Linear Real Parameters. Publishing House of the Academy of Science of the Ukrainian SSR, Kiev (1957). English translation, AEC-TR-4491, United States Atomic Energy CommissionGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Swinburne University of TechnologyMelbourneAustralia
  2. 2.Federation University AustraliaBallaratAustralia
  3. 3.Centre for Informatics and Applied Optimization (CIAO)Federation University AustraliaBallaratAustralia

Personalised recommendations