A computational method for determining strong stabilizability of \(n\)-D systems (Q1300577)
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: A computational method for determining strong stabilizability of \(n\)-D systems |
scientific article; zbMATH DE number 1330688
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational method for determining strong stabilizability of \(n\)-D systems |
scientific article; zbMATH DE number 1330688 |
Statements
A computational method for determining strong stabilizability of \(n\)-D systems (English)
0 references
18 May 2000
0 references
The stability of a multidimensional system with transfer function \(p(z)= f(z)/g(z)\), where \(z= (z_1,\dots, z_n)\in\mathbb{C}^n\), is determined by the condition that there exist two complex polynomials \(h\), \(k\) such that \[ k(z)\neq 0,\quad f(z)h(z)+ g(z)k(z)\neq 0 \] for all \(z\) in the unit polydisc \(U\). This has been shown to be equivalent to the winding number of \(g(\gamma)\) being zero for any closed curve \(\gamma\) in \(\overline U\cap \{z\in\mathbb{C}^n: f(z)= 0\}\). This means that efficient computational algorithms are needed to evaluate the winding number. This is achieved in this paper by determining an appropriate discretization of a given cycle.
0 references
stability
0 references
multidimensional system
0 references
winding number
0 references
0 references
0.9134187
0 references
0.8989497
0 references
0.89470667
0 references
0.8903962
0 references
0.88939977
0 references
0.8854037
0 references
0.8835397
0 references