Improvements of Lagrange's bound for polynomial roots
type: Item
instance of: scholarly article
title: Improvements of Lagrange's bound for polynomial roots
zbMATH Open document ID: 1358.65028
author: Prashant Batra
author: Maurice Mignotte
author: Doru Ştefănescu
published in: Journal of Symbolic Computation
publication date: 2017-02-24T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6688743
zbMATH Keywords: Lagrange's bound
zbMATH Keywords: complex roots
zbMATH Keywords: overestimation factor
zbMATH Keywords: computational effort
zbMATH Keywords: polynomial roots
zbMATH Keywords: asymptotic computational complexity
MaRDI profile type: Publication
full work available at URL: j.jsc.2016.10.001
OpenAlex ID: W2565229654
cites work: A property of the nearly optimal root-bound
cites work: On the Quality of Some Root-Bounds
cites work: Krandick's proof of Lagrange's real root bound claim
cites work: Bounds for absolute positiveness of multivariate polynomials
cites work: Bounds for positive roots of polynomials
cites work: A Generalization of a Theorem of Bôcher
cites work: Faster algorithms for computing Hong's bound on absolute positiveness
cites work: Q4248251
cites work: Q5627593
cites work: Q4779788
cites work: Q3251480
cites work: Upperbounds for roots of polynomials
cites work: New Bounds for the Roots of an Algebraic Equation
DOI: 10.1016/J.JSC.2016.10.001
description: scientific article; zbMATH DE number 6688743