Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials

DOI10.1016/j.amc.2017.07.026zbMath1426.41009OpenAlexW2740115203MaRDI QIDQ1740149

Jürgen Garloff, Jihad Titi

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-0-416554

zbMATH Keywords

range enclosurepolynomial evaluationsimplicial subdivisionBernstein coefficientsimplicial Bernstein representation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation by polynomials (41A10)

Related Items (2)

Bounds for the range of a complex polynomial over a rectangular region ⋮ Matrix methods for the tensorial Bernstein form

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A literature survey of benchmark functions for global optimisation problems
• The Bernstein polynomial basis: a centennial retrospective
• On computing Bézier curves by Pascal matrix methods
• Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
• The multivariate Horner scheme revisited
• On the complexity of optimization over the standard simplex
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Bounds for the range of a bivariate polynomial over a triangle
• Computation of the Bernstein coefficients on subdivided triangles
• Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
• A unified approach to evaluation algorithms for multivariate polynomials
• On the Multivariate Horner Scheme
• Convergence of the Simplicial Rational Bernstein Form
• Hybrid Systems: Computation and Control

This page was built for publication: Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials