Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate

When using Rutishauser's qd-algorithm for the determination of the roots of a polynomial (originally the poles of a meromorphic function), or for related problems, conditions have been formulated for the interpretation of the computed q- and e-values. For a correct interpretation, the so-called...

Full description

Saved in:

Bibliographic Details
Published in:	Applied numerical mathematics Vol. 60; no. 12; pp. 1188 - 1208
Main Authors:	Allouche, Hassane, Cuyt, Annie
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2010
Subjects:	Arithmetic Computation Formally orthogonal Hadamard polynomials Mathematical models Meromorphic function Meromorphic functions Method of Bernoulli Pole detection Poles qd-algorithm Roots Formally orthogonal Hadamard polynomials Pole detection qd-algorithm Method of Bernoulli Meromorphic function
ISSN:	0168-9274, 1873-5460
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!