Gemignani, Luca (1996) POLYNOMIAL ROOT COMPUTATION BY MEANS OF THE LR ALGORITHM. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (165Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-96-16.ps.g...
Abstract
By representing the $LR$ algorithm of Rutishauser and its variants in a polynomial setting, we derive numerical methods for approximating either all of the roots or a number $k$ of the roots of minimum modulus of a given polynomial $p(t)$ of degree $n$. These methods share the convergence properties of the $LR$ matrix iteration but, unlike it, they can be arranged to produce parallel and sequential algorithms which are highly efficient expecially in the case where $k<<n$.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 26 Jan 2015 14:30 |
Last Modified: | 26 Jan 2015 14:30 |
URI: | http://eprints.adm.unipi.it/id/eprint/1964 |
Repository staff only actions
View Item |