Almost tight recursion tree bounds for the descartes method

Arno Eigenwillig, Vikram Sharma, Chee K. Yap

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

Abstract

We give a unified ("basis free") framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for polynomials in the power basis as well as its analog in the Bernstein basis. We then give a new bound on the size of the recursion tree in the Descartes method for polynomials with real coefficients. Applied to polynomials A(X) = ∑i=0 n aiXi with integer coefficients |a i| < 2L, this yields a bound of O(n(L + logn)) on the size of recursion trees. We show that this bound is tight for L = Ω(log n), and we use it to derive the best known bit complexity bound for the integer case.

Original languageEnglish (US)
Title of host publicationProceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006
Pages71-78
Number of pages8
Volume2006
StatePublished - 2006
EventInternational Symposium on Symbolic and Algebraic Computation, ISSAC 2006 - Genova, Italy
Duration: Jul 9 2006Jul 12 2006

Other

OtherInternational Symposium on Symbolic and Algebraic Computation, ISSAC 2006
CountryItaly
CityGenova
Period7/9/067/12/06

Fingerprint

Polynomials

Keywords

  • Bernstein basis
  • Davenport-Mahler bound
  • Descartes method
  • Descartes rule of signs
  • Polynomial real root isolation

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Eigenwillig, A., Sharma, V., & Yap, C. K. (2006). Almost tight recursion tree bounds for the descartes method. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006 (Vol. 2006, pp. 71-78)

Almost tight recursion tree bounds for the descartes method. / Eigenwillig, Arno; Sharma, Vikram; Yap, Chee K.

Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. Vol. 2006 2006. p. 71-78.

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

Eigenwillig, A, Sharma, V & Yap, CK 2006, Almost tight recursion tree bounds for the descartes method. in Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. vol. 2006, pp. 71-78, International Symposium on Symbolic and Algebraic Computation, ISSAC 2006, Genova, Italy, 7/9/06.
Eigenwillig A, Sharma V, Yap CK. Almost tight recursion tree bounds for the descartes method. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. Vol. 2006. 2006. p. 71-78
Eigenwillig, Arno ; Sharma, Vikram ; Yap, Chee K. / Almost tight recursion tree bounds for the descartes method. Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006. Vol. 2006 2006. pp. 71-78
@inproceedings{981e2c348a884d4a8c97bcfbda12e5b7,
title = "Almost tight recursion tree bounds for the descartes method",
abstract = "We give a unified ({"}basis free{"}) framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for polynomials in the power basis as well as its analog in the Bernstein basis. We then give a new bound on the size of the recursion tree in the Descartes method for polynomials with real coefficients. Applied to polynomials A(X) = ∑i=0 n aiXi with integer coefficients |a i| < 2L, this yields a bound of O(n(L + logn)) on the size of recursion trees. We show that this bound is tight for L = Ω(log n), and we use it to derive the best known bit complexity bound for the integer case.",
keywords = "Bernstein basis, Davenport-Mahler bound, Descartes method, Descartes rule of signs, Polynomial real root isolation",
author = "Arno Eigenwillig and Vikram Sharma and Yap, {Chee K.}",
year = "2006",
language = "English (US)",
isbn = "1595932763",
volume = "2006",
pages = "71--78",
booktitle = "Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006",

}

TY - GEN

T1 - Almost tight recursion tree bounds for the descartes method

AU - Eigenwillig, Arno

AU - Sharma, Vikram

AU - Yap, Chee K.

PY - 2006

Y1 - 2006

N2 - We give a unified ("basis free") framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for polynomials in the power basis as well as its analog in the Bernstein basis. We then give a new bound on the size of the recursion tree in the Descartes method for polynomials with real coefficients. Applied to polynomials A(X) = ∑i=0 n aiXi with integer coefficients |a i| < 2L, this yields a bound of O(n(L + logn)) on the size of recursion trees. We show that this bound is tight for L = Ω(log n), and we use it to derive the best known bit complexity bound for the integer case.

AB - We give a unified ("basis free") framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for polynomials in the power basis as well as its analog in the Bernstein basis. We then give a new bound on the size of the recursion tree in the Descartes method for polynomials with real coefficients. Applied to polynomials A(X) = ∑i=0 n aiXi with integer coefficients |a i| < 2L, this yields a bound of O(n(L + logn)) on the size of recursion trees. We show that this bound is tight for L = Ω(log n), and we use it to derive the best known bit complexity bound for the integer case.

KW - Bernstein basis

KW - Davenport-Mahler bound

KW - Descartes method

KW - Descartes rule of signs

KW - Polynomial real root isolation

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

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

M3 - Conference contribution

AN - SCOPUS:33748959696

SN - 1595932763

SN - 9781595932761

VL - 2006

SP - 71

EP - 78

BT - Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006

ER -