Polytope-based computation of polynomial ranges

Christoph Fünfzig, Dominique Michelucci, Sebti Foufou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate several polytopes based on the tensorial Bernstein basis, and we formulate a polytope for the quadratic patch Q n:= (x1, ..., xn, x21, ..., x2n, x1x2, ..., x n-1xn) by projections. This Bernstein polytope has Θ(n2) hyperplanes. We give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1, 2, 3, 4, and we compare the computed range widths for random n-variate polynomials for n ≤ 10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size.

Original languageEnglish (US)
Title of host publicationAPPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing
Pages1247-1252
Number of pages6
DOIs
StatePublished - Jul 23 2010
Event25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre, Switzerland
Duration: Mar 22 2010Mar 26 2010

Other

Other25th Annual ACM Symposium on Applied Computing, SAC 2010
CountrySwitzerland
CitySierre
Period3/22/103/26/10

Fingerprint

Polynomials
Linear programming

Keywords

  • Bernstein polynomials
  • multivariate polynomials
  • polynomial ranges
  • polytopes

ASJC Scopus subject areas

  • Software

Cite this

Fünfzig, C., Michelucci, D., & Foufou, S. (2010). Polytope-based computation of polynomial ranges. In APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing (pp. 1247-1252) https://doi.org/10.1145/1774088.1774353

Polytope-based computation of polynomial ranges. / Fünfzig, Christoph; Michelucci, Dominique; Foufou, Sebti.

APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. 2010. p. 1247-1252.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fünfzig, C, Michelucci, D & Foufou, S 2010, Polytope-based computation of polynomial ranges. in APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. pp. 1247-1252, 25th Annual ACM Symposium on Applied Computing, SAC 2010, Sierre, Switzerland, 3/22/10. https://doi.org/10.1145/1774088.1774353
Fünfzig C, Michelucci D, Foufou S. Polytope-based computation of polynomial ranges. In APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. 2010. p. 1247-1252 https://doi.org/10.1145/1774088.1774353
Fünfzig, Christoph ; Michelucci, Dominique ; Foufou, Sebti. / Polytope-based computation of polynomial ranges. APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. 2010. pp. 1247-1252
@inproceedings{354f7b799d7c4a7d96903c60fe7f3388,
title = "Polytope-based computation of polynomial ranges",
abstract = "Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate several polytopes based on the tensorial Bernstein basis, and we formulate a polytope for the quadratic patch Q n:= (x1, ..., xn, x21, ..., x2n, x1x2, ..., x n-1xn) by projections. This Bernstein polytope has Θ(n2) hyperplanes. We give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1, 2, 3, 4, and we compare the computed range widths for random n-variate polynomials for n ≤ 10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size.",
keywords = "Bernstein polynomials, multivariate polynomials, polynomial ranges, polytopes",
author = "Christoph F{\"u}nfzig and Dominique Michelucci and Sebti Foufou",
year = "2010",
month = "7",
day = "23",
doi = "10.1145/1774088.1774353",
language = "English (US)",
isbn = "9781605586380",
pages = "1247--1252",
booktitle = "APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing",

}

TY - GEN

T1 - Polytope-based computation of polynomial ranges

AU - Fünfzig, Christoph

AU - Michelucci, Dominique

AU - Foufou, Sebti

PY - 2010/7/23

Y1 - 2010/7/23

N2 - Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate several polytopes based on the tensorial Bernstein basis, and we formulate a polytope for the quadratic patch Q n:= (x1, ..., xn, x21, ..., x2n, x1x2, ..., x n-1xn) by projections. This Bernstein polytope has Θ(n2) hyperplanes. We give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1, 2, 3, 4, and we compare the computed range widths for random n-variate polynomials for n ≤ 10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size.

AB - Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensorial Bernstein basis, which is exponential size in the number n of variables. In this paper, we consider methods to compute tight bounds for polynomials in n variables by solving two linear programming problems over a polytope. We formulate several polytopes based on the tensorial Bernstein basis, and we formulate a polytope for the quadratic patch Q n:= (x1, ..., xn, x21, ..., x2n, x1x2, ..., x n-1xn) by projections. This Bernstein polytope has Θ(n2) hyperplanes. We give the number of vertices, the number of hyperplanes, and the volume of each polytope for n = 1, 2, 3, 4, and we compare the computed range widths for random n-variate polynomials for n ≤ 10. The Bernstein polytope of polynomial size gives only marginally worse range bounds compared to the range bounds obtained with the tensorial Bernstein basis of exponential size.

KW - Bernstein polynomials

KW - multivariate polynomials

KW - polynomial ranges

KW - polytopes

UR - http://www.scopus.com/inward/record.url?scp=77954701892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954701892&partnerID=8YFLogxK

U2 - 10.1145/1774088.1774353

DO - 10.1145/1774088.1774353

M3 - Conference contribution

AN - SCOPUS:77954701892

SN - 9781605586380

SP - 1247

EP - 1252

BT - APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing

ER -