Bounds-constrained polynomial approximation using the Bernstein basis
From MaRDI portal
Publication:2168063
Recommendations
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 47179 (Why is no real title available?)
- scientific article; zbMATH DE number 3516003 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- A Sum of Squares Approximation of Nonnegative Polynomials
- A projection algorithm on the set of polynomials with two bounds
- Algorithms for positive polynomial approximation
- Best approximation and interpolation of \((1+(ax)^2)^{-1}\) and its transforms.
- Best approximation in inner product spaces
- Best uniform polynomial approximation of some rational functions
- CVXPY: a Python-embedded modeling language for convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Construction of orthogonal bases for polynomials in Bernstein form on triangular and simplex domains
- Fast inversion of the simplicial Bernstein mass matrix
- Fast simplicial finite element algorithms using Bernstein polynomials
- Fast simplicial quadrature-based finite element operators using Bernstein polynomials
- Legendre-Bernstein basis transformations
- Monolithic convex limiting in discontinuous Galerkin discretizations of hyperbolic conservation laws
- Polynomials that are positive on an interval
- Polynomials with bounds and numerical approximation
- Semidefinite Programming
- Shape optimization of transfer functions
- Spline Functions on Triangulations
- Structured inversion of the Bernstein mass matrix
- Structured inversion of the Bernstein-Vandermonde matrix
- Subcell flux limiting for high-order Bernstein finite element discretizations of scalar hyperbolic conservation laws
- Sums of even powers of real linear forms
- The best approximation of some rational functions in uniform norm
- The best uniform polynomial approximation to class of the form \(\frac{1}{(a^2\pm x^2)}\)
Cited in
(8)- Accurate polynomial interpolation by using the Bernstein basis
- High-order bounds-satisfying approximation of partial differential equations via finite element variational inequalities
- A projection algorithm on the set of polynomials with two bounds
- Bounds-constrained polynomial approximation using the Bernstein basis
- Density theorems with applications in quantum signal processing
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form
- A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form
- Polynomials with bounds and numerical approximation
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)
