Algebraic manipulation in the Bernstein form made simple via convolutions
From MaRDI portal
Publication:628091
DOI10.1016/S0010-4485(03)00021-6zbMath1206.68375OpenAlexW1997224045MaRDI QIDQ628091
Publication date: 4 March 2011
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0010-4485(03)00021-6
Symbolic computation and algebraic computation (68W30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer aspects of numerical algorithms (65Y99)
Related Items (7)
Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic ⋮ Bernstein-Bézier weight-adjusted discontinuous Galerkin methods for wave propagation in heterogeneous media ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Offset-rational sinusoidal spirals in bézier form ⋮ A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
This page was built for publication: Algebraic manipulation in the Bernstein form made simple via convolutions
