Bounds-constrained polynomial approximation using the Bernstein basis
DOI10.1007/S00211-022-01311-1OpenAlexW3157902398WikidataQ114231012 ScholiaQ114231012MaRDI QIDQ2168063FDOQ2168063
Authors: Larry Allen, Robert C. Kirby 
Publication date: 31 August 2022
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.11819
Recommendations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Algorithms for approximation of functions (65D15) Approximation by rational functions (41A20) Approximation with constraints (41A29)
Cites Work
- CVXPY: a Python-embedded modeling language for convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Semidefinite Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomials that are positive on an interval
- Best approximation in inner product spaces
- Legendre-Bernstein basis transformations
- Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
- Title not available (Why is that?)
- Sums of even powers of real linear forms
- Best uniform polynomial approximation of some rational functions
- Spline Functions on Triangulations
- A Sum of Squares Approximation of Nonnegative Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast simplicial finite element algorithms using Bernstein polynomials
- Fast simplicial quadrature-based finite element operators using Bernstein polynomials
- Fast inversion of the simplicial Bernstein mass matrix
- The best uniform polynomial approximation to class of the form \(\frac{1}{(a^2\pm x^2)}\)
- Polynomials with bounds and numerical approximation
- Best approximation and interpolation of \((1+(ax)^2)^{-1}\) and its transforms.
- Subcell flux limiting for high-order Bernstein finite element discretizations of scalar hyperbolic conservation laws
- Algorithms For Positive Polynomial Approximation
- A projection algorithm on the set of polynomials with two bounds
- The best approximation of some rational functions in uniform norm
- Shape optimization of transfer functions
- Monolithic convex limiting in discontinuous Galerkin discretizations of hyperbolic conservation laws
- Structured Inversion of the Bernstein--Vandermonde Matrix
- Structured Inversion of the Bernstein Mass Matrix
Cited In (6)
- High-order bounds-satisfying approximation of partial differential equations via finite element variational inequalities
- Accurate polynomial interpolation by using the Bernstein basis
- Polynomials with bounds and numerical approximation
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
- Bounds-constrained polynomial approximation using the Bernstein basis
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
Uses Software
This page was built for publication: Bounds-constrained polynomial approximation using the Bernstein basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168063)
