Multivariate approximation by polynomial and generalized rational functions

References

• Chebyshev PL. The theory of mechanisms known as parallelograms. Moscow: Publishing Hours of the USSR Academy of Sciences; 1955. pp. 611–648. (Selected Works; In Russian).
   Google Scholar
• Remez EY. General computational methods of chebyshev approximation. Kiev (Ukraine); 1957. (Atomic Energy Translation; vol. 4491).
   Google Scholar
• Northrop RB. Signals and systems analysis in biomedical engineering. Boca Raton (FL): CRC Press; 2003.
   Google Scholar
• Nürnberger G. Approximation by spline functions. New York (NY): Springer-Verlag; 1989.
   Google Scholar
• Schumaker L. Uniform approximation by chebyshev spline functions. II: free knots. SIAM J Numer Anal. 1968;5:647–656.
   Web of Science ®Google Scholar
• Sukhorukova N. Uniform approximation by the highest defect continuous polynomial splines: necessary and sufficient optimality conditions and their generalisations. J Optim Theory Appl. 2010;147(2):378–394.
   Web of Science ®Google Scholar
• Crouzeix JP, Sukhorukova N, Ugon J. Finite alternation theorems and a constructive approach to piecewise polynomial approximation in chebyshev norm. Set-Valued Var Anal. 2020;28:123–147.
   Web of Science ®Google Scholar
• Meinardus G, Nürnberger G, Sommer M, et al. Algorithms for piecewise polynomials and splines with free knots. Math Comput. 1989;53:235–247.
   Web of Science ®Google Scholar
• Mulansky B. Chebyshev approximation by spline functions with free knots. IMA J Numer Anal. 1992;12:95–105.
   Web of Science ®Google Scholar
• Sukhorukova N, Ugon J. Characterization theorem for best linear spline approximation with free knots. Dyn Contin Discrete Impuls Syst. 2010;17(5):687–708.
   Google Scholar
• Sukhorukova Nadezda, Ugon Julien. Characterisation theorem for best polynomial spline approximation with free knots. Trans Am Math Soc. 2017;369(9):6389–6405.
   Web of Science ®Google Scholar
• Borwein P, Daubechies I, Totik V, et al. Bivariate segment approximation and free knot splines: research problems 96-4. Construct Approximation. 1996;12(4):555–558.
   Web of Science ®Google Scholar
• Lorentz GG, von Golitschek M, Makovoz Y. Constructive approximation: advanced problems. Vol. 304. Berlin: Springer; 1996.
   Google Scholar
• Petrushev P, Popov V. Rational approximation of real functions. New York (NY): Cambridge University Press; 1987.
   Google Scholar
• Achieser NI. Theory of approximation. New York: Frederick Ungar; 1965.
   Google Scholar
• Boehm B. Functions whose best rational chebyshev approximation are polynomials. Numer Math. 1964;6:235–242.
   Google Scholar
• Meinardus G. Approximation of functions: theory and numerical methods. Berlin: Springer-Verlag; 1967.
   Google Scholar
• Ralston A. Rational chebyshev approximation by remes' algorithms. Numer Math. 1965;7(4):322–330.
   Google Scholar
• Rivlin TJ. Polynomials of best uniform approximation to certain rational functions. Numer Math. 1962;4(1):345–349.
   Google Scholar
• Cheney EW, Loeb HL. Generalized rational approximation. J Soc Ind Appl Math Ser B: Numer Anal. 1964;1(1):11–25.
   Google Scholar
• Nakatsukasa Y, Sete O, Trefethen LN. The aaa algorithm for rational approximation. SIAM J Sci Comput. 2018;40(3):A1494–A1522.
   Web of Science ®Google Scholar
• Peiris V, Sharon N, Sukhorukova N, et al. Generalised rational approximation and its application to improve deep learning classifiers. Appl Math Comput. 2021;389:125560.
   Web of Science ®Google Scholar
• Boyd S, Vandenberghe L. Convex optimization. New York (NY): Cambridge University Press; 2010.
   Google Scholar
• Díaz Millán R, Sukhorukova N, Ugon J. An algorithm for best generalised rational approximation of continuous functions; 2020. p. 1–17. Available from: https://arxiv.org/abs/2011.02721.
   Google Scholar
• Loeb HL. Algorithms for chebyshev approximations using the ratio of linear forms. J Soc Ind Appl Math. 1960;8(3):458–465.
   Google Scholar
• Nakatsukasa Y, Trefethen LN. An algorithm for real and complex rational minimax approximation. SIAM J Sci Comput. 2020;42(5):A3157–A3179.
   Web of Science ®Google Scholar
• Criado JM, Pérez-Maqueda LA, Sánchez-Jiménez PE. Dependence of the preexponential factor on temperature. J Therm Anal Calorim. 2005;82(3):671–675.
   Web of Science ®Google Scholar
• Rice JR. Tchebycheff approximation in several variables. Trans Am Math Soc. 1963;109(3):444–466.
   Google Scholar
• Sukhorukova N, Ugon J, Yost D. Chebyshev multivariate polynomial approximation: alternance interpretation. In: de Gier J, Praeger CE, Tao T editors. 2016 MATRIX Annals. Cham: Springer International Publishing; 2018. p. 177–182.
   Google Scholar
• Bauschke HH, Lewis AS. Dykstras algorithm with Bregman projections: a convergence proof. Optimization. 2000;48(4):409–427.
   Google Scholar
• Matsushita S, Xu L. On the finite termination of the Douglas–Rachford method for the convex feasibility problem. Optimization. 2016;65(11):2037–2047.
   Web of Science ®Google Scholar
• Yang Y, Yang Q. Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem. Optimization. 2013;62(4):509–525.
   Web of Science ®Google Scholar
• Zaslavski AJ. Subgradient projection algorithms and approximate solutions of convex feasibility problems. J Optim Theory Appl. 2013;157:803–819.
   Web of Science ®Google Scholar
• Zhao X, Köbis MA. On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery. Optimization. 2018;67(9):1409–1427.
   Web of Science ®Google Scholar
• Malachivskyy PS, Pizyur Ya V, Malachivsky RP. Chebyshev approximation by a rational expression for functions of many variables. Cybern Syst Anal. 2020;56:811–819.
   Web of Science ®Google Scholar