Show simple item record

dc.contributor.authorLang, Markus
Frenzel, Bernhard-Christian
dc.creatorLang, Markus
Frenzel, Bernhard-Christian 2007-10-31T00:50:57Z 2007-10-31T00:50:57Z 1994-10-01 2004-11-08
dc.identifier.citation M. Lang and B. Frenzel, "Polynomial Root Finding," IEEE Signal Processing Letters, 1994.
dc.description Journal Paper
dc.description.abstract Finding 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.
dc.language.iso eng
dc.subject.otherGeneral DSP
dc.title Polynomial Root Finding
dc.type Journal article
dc.citation.bibtexName article
dc.citation.journalTitle IEEE Signal Processing Letters 2004-11-10
dc.contributor.orgDigital Signal Processing (
dc.type.dcmi Text
dc.type.dcmi Text

Files in this item


This item appears in the following Collection(s)

  • DSP Publications [508]
    Publications by Rice Faculty and graduate students in digital signal processing.
  • ECE Publications [1450]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students

Show simple item record