Multivariate approximation by polynomial and generalized rational functions
From MaRDI portal
Publication:5077169
Abstract: In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the second case the approximations are ratios of linear forms and the basis functions are not limited to monomials. It is already known that in the case of multivariate polynomial approximation on a finite grid the corresponding optimisation problems can be reduced to solving a linear programming problem, while the area of multivariate rational approximation is not so well understood.In this paper we demonstrate that in the case of multivariate generalised rational approximation the corresponding optimisation problems are quasiconvex. This statement remains true even when the basis functions are not limited to monomials. Then we apply a bisection method, which is a general method for quasiconvex optimisation. This method converges to an optimal solution with given precision. We demonstrate that the convex feasibility problems appearing in the bisection method can be solved using linear programming. Finally, we compare the deviation error and computational time for multivariate polynomial and generalised rational approximation with the same number of decision variables.
Recommendations
- Chebyshev multivariate polynomial approximation and point reduction procedure
- On the optimum approximation of real rational functions via linear programming
- Chebyshev approximation by a rational expression for functions of many variables
- Practical algorithms for multivariate rational approximation
- Chebyshev multivariate polynomial approximation: alternance interpretation
Cites work
- Algorithms for Chebyshev Approximations Using the Ratio of Linear Forms
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- An algorithm for real and complex rational minimax approximation
- Bivariate segment approximation and free knot splines: Research Problems 96-4
- Characterisation theorem for best polynomial spline approximation with free knots
- Chebyshev approximation by a rational expression for functions of many variables
- Chebyshev Approximation by Spline Functions with Free Knots
- Chebyshev multivariate polynomial approximation: alternance interpretation
- Dykstras algorithm with bregman projections: A convergence proof
- Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm
- Functions whose best rational Chebyshev approximation are polynomials
- Generalised rational approximation and its application to improve deep learning classifiers
- Generalized Rational Approximation
- scientific article; zbMATH DE number 5844487 (Why is no real title available?)
- scientific article; zbMATH DE number 4050200 (Why is no real title available?)
- scientific article; zbMATH DE number 44907 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- Polynomials of best uniform approximation to certain rational functions
- Rational Chebyshev approximation by Remes' algorithms
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Tchebycheff Approximation in Several Variables
- The AAA algorithm for rational approximation
- Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
- Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
Cited in
(16)- On the optimum approximation of real rational functions via linear programming
- Multirational function approximation via linear programming
- A generalisation of de la Vallée-Poussin procedure to multivariate approximations
- An algorithm for best generalised rational approximation of continuous functions
- Generalised rational approximation and its application to improve deep learning classifiers
- Solarity and proximinality in generalized rational approximation in spaces \(C(Q)\) and \(L^p\)
- scientific article; zbMATH DE number 5295869 (Why is no real title available?)
- scientific article; zbMATH DE number 5788506 (Why is no real title available?)
- scientific article; zbMATH DE number 3944458 (Why is no real title available?)
- The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
- MultivariateApart: generalized partial fractions
- Practical algorithms for multivariate rational approximation
- RATIONAL AND GENERALISED RATIONAL CHEBYSHEV APPROXIMATION PROBLEMS AND THEIR APPLICATIONS
- Existence, uniqueness, and stability of best and near-best approximations
- Optimization-aided construction of multivariate Chebyshev polynomials
- A convex dual problem for the rational minimax approximation and Lawson's iteration
This page was built for publication: Multivariate approximation by polynomial and generalized rational functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077169)
