2002•1993 IEEE International Symposium on Circuits and SystemsRequires access

Stability and zeros of a complex polynomial

Kaoru Kurosawa, Kenichi Kawabe, Shigeo Tsujii

Open publisher page 3 citations

Abstract

For real polynomials, a stability test algorithm shown by Y. Bistritz (1984) requires about a half of the operations of the Marden-July table method (1964). His method also gives the number of inside the unit circle (IUC) zeros, outside the unit circle (OUC) zeros and on the unit circle (UC) zeros. However, it doesn't work for complex polynomials. The authors present such an efficient counting algorithm for complex polynomials. For stability testing, it requires about half of the operations of the Marden-July table method. In the approach, a Sturm sequence of trigonometric functions is derived.>

About this research paper

What this paper is about

For real polynomials, a stability test algorithm shown by Y. Bistritz (1984) requires about a half of the operations of the Marden-July table method (1964). His method also gives the number of inside the unit circle (IUC) zeros, outside the unit circle (OUC) zeros and on the unit circle (UC) zeros. However, it doesn't work for complex polynomials. The authors present such an efficient counting algorithm for complex polynomials. For stability testing, it requires about half of the operations of the Marden-July table method. In the approach, a Sturm sequence of trigonometric functions is derived.>

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

For real polynomials, a stability test algorithm shown by Y. Bistritz (1984) requires about a half of the operations of the Marden-July table method (1964). His method also gives the number of inside the unit circle (IUC) zeros, outside the unit circle (OUC) zeros and on the unit circle (UC) zeros. However, it doesn't work for complex polynomials. The authors present such an efficient counting algorithm for complex polynomials. For stability testing, it requires about half of the operations of the Marden-July table method. In the approach, a Sturm sequence of trigonometric functions is derived.>

Key concepts: Unit circle, Trigonometry, Trigonometric polynomial, Table (database), Mathematics, Polynomial, Stability (learning theory), Complex plane

Related papers

Back to paper searchBrowse research topicsOriginal source
Stability and zeros of a complex polynomial — Research Paper | ScholarLens