Show simple item record

dc.contributor.authorLang, Markus
Frenzel, Bernhard-Christian
dc.creatorLang, Markus
Frenzel, Bernhard-Christian
dc.date.accessioned 2007-10-31T00:50:57Z
dc.date.available 2007-10-31T00:50:57Z
dc.date.issued 1994-10-01
dc.date.submitted 2004-11-08
dc.identifier.citation M. Lang and B. Frenzel, "Polynomial Root Finding," IEEE Signal Processing Letters, 1994.
dc.identifier.urihttps://hdl.handle.net/1911/20045
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.subjectDSP
dc.subject.otherGeneral DSP
dc.title Polynomial Root Finding
dc.type Journal article
dc.citation.bibtexName article
dc.citation.journalTitle IEEE Signal Processing Letters
dc.date.modified 2004-11-10
dc.contributor.orgDigital Signal Processing (http://dsp.rice.edu/)
dc.subject.keywordDSP
dc.type.dcmi Text
dc.type.dcmi Text
dc.identifier.doihttp://dx.doi.org/10.1109/97.329845


Files in this item

Thumbnail

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