Zur Kurzanzeige

dc.creatorAkritas, A. G.en
dc.creatorStrzeboński, A. W.en
dc.creatorVigklas, P. S.en
dc.date.accessioned2015-11-23T10:21:53Z
dc.date.available2015-11-23T10:21:53Z
dc.date.issued2007
dc.identifier.isbn9783540751861
dc.identifier.issn3029743
dc.identifier.urihttp://hdl.handle.net/11615/25415
dc.description.abstractWe present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method1, or any of its variants. © Springer-Verlag Berlin Heidelberg 2007.en
dc.source.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-38149051503&partnerID=40&md5=611559c35a37aaf807f0d9a7cde357f3
dc.subjectNumerical methodsen
dc.subjectProblem solvingen
dc.subjectPositive root boundsen
dc.subjectReal root isolationen
dc.subjectPolynomialsen
dc.titleAdvances on the continued fractions method using better estimations of positive root boundsen
dc.typeotheren


Dateien zu dieser Ressource

DateienGrößeFormatAnzeige

Zu diesem Dokument gibt es keine Dateien.

Das Dokument erscheint in:

Zur Kurzanzeige