Parallel Rayleigh quotient iterative algorithm for rooting nonstationary spectral polynomials

Jyh Chern Ho, Jar Ferr Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A parallel Rayleigh quotient iterative algorithm (PRQI) associated with the zeros extraction technique which assures that each processor converges to a different desired root is proposed. The suggested algorithm with arbitrary initialization can automatically converge to the desired roots which are close to the unit circle. The proposed algorithm has a computation complexity of O(N) for rooting spectrum polynomials. Simulations show that the suggested algorithm has a better tracking performance than the Gauss-Newton method and the gradient Newton algorithm.

Original languageEnglish
Title of host publicationProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
PublisherPubl by IEEE
Pages2233-2236
Number of pages4
ISBN (Print)078030033
Publication statusPublished - 1991 Dec 1
EventProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91 - Toronto, Ont, Can
Duration: 1991 May 141991 May 17

Publication series

NameProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume3
ISSN (Print)0736-7791

Other

OtherProceedings of the 1991 International Conference on Acoustics, Speech, and Signal Processing - ICASSP 91
CityToronto, Ont, Can
Period91-05-1491-05-17

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Parallel Rayleigh quotient iterative algorithm for rooting nonstationary spectral polynomials'. Together they form a unique fingerprint.

Cite this