Polynomial Root Finding

Simple item page
dc.citation.bibtexNamearticleen_US
dc.citation.journalTitleIEEE Signal Processing Lettersen_US
dc.contributor.authorLang, Markusen_US
dc.contributor.authorFrenzel, Bernhard-Christianen_US
dc.contributor.orgDigital Signal Processing (http://dsp.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:50:57Z
dc.date.available2007-10-31T00:50:57Z
dc.date.issued1994-10-01en
dc.date.modified2004-11-10en_US
dc.date.submitted2004-11-08en_US
dc.descriptionJournal Paperen_US
dc.description.abstractFinding polynomial roots rapidly and accurately is an important problem in many areas of signal processing. We present a program which is superior in speed and accuracy to the best methods to our knowledge, i.e., Jenkins/Traub program and the eigenvalue method. Based on this we give a simple approach to improve the accuracy for spectral factorization in the case there are double roots on the unit circle.en_US
dc.identifier.citationM. Lang and B. Frenzel, "Polynomial Root Finding," <i>IEEE Signal Processing Letters,</i> 1994.
dc.identifier.doihttp://dx.doi.org/10.1109/97.329845en_US
dc.identifier.urihttps://hdl.handle.net/1911/20045
dc.language.isoeng
dc.subjectDSP*
dc.subject.keywordDSPen_US
dc.subject.otherGeneral DSPen_US
dc.titlePolynomial Root Findingen_US
dc.typeJournal article
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Lan1994Oct1Polynomial.PS
Size:
34.55 KB
Format:
Postscript Files
Download
Collections
ECE Publications
DSP Publications