On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion (Q5928736)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion |
scientific article; zbMATH DE number 1583605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion |
scientific article; zbMATH DE number 1583605 |
Statements
On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion (English)
0 references
2 April 2001
0 references
The known Schur-Cohn-Fujiwara criterion is usually used for finding zeros of a polynomial of the form \[ f(z)= a_0z^n + a_1z^{n-1} +\dots+ a_n, \quad a_0\neq 0 \] inside and outside the unit circle. The criterion is based on the Bezout matrix and Jacobi's sign rule. A computer realization of the criterion is presented in MAPLE V .
0 references
zeros of a polynomial
0 references
