Computer algebra methods for testing the structural stability of - - PowerPoint PPT Presentation

computer algebra methods for testing the structural
SMART_READER_LITE
LIVE PREVIEW

Computer algebra methods for testing the structural stability of - - PowerPoint PPT Presentation

Computer algebra methods for testing the structural stability of multidimensional systems Yacine Bouzidi , Alban Quadrat , Fabrice Rouillier INRIA Saclay - le-de-France, Disco project INRIA Lille, Nord Europe,


slide-1
SLIDE 1

Computer algebra methods for testing the structural stability of multidimensional systems

Yacine Bouzidi⋆, Alban Quadrat⋆⋆, Fabrice Rouillier⋆⋆⋆

⋆ INRIA Saclay - Île-de-France, Disco project ⋆⋆ INRIA Lille, Nord Europe, NON-A Project ⋆⋆⋆ INRIA Paris - Roquencourt, Ouragan ⋆ yacine.bouzidi@inria.fr, ⋆⋆ alban.quadrat@inria.fr, ⋆⋆⋆ Fabrice.Rouillier@inria.fr

supported by the ANR MSDOS

Journées Nationales de Calcul Formel, Cluny, 2-6 Novembre 2015

slide-2
SLIDE 2

Overview

1

Multidimensional systems

2

Structural stability

3

Contribution on the stability test

4

Ongoing work on the stability analysis

2/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-3
SLIDE 3

Overview

1

Multidimensional systems

2

Structural stability

3

Contribution on the stability test

4

Ongoing work on the stability analysis

3/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-4
SLIDE 4

Discrete-time linear shift-invariant systems

  • Let (yn)n∈N and (un)n∈N be 2 sequences satisfying the equation:

     yn+2 − 3 yn+1 + 2 yn = 2 un+1 + 2 un, y0 = 0, y1 = 0. (⋆)

  • Definition: The Z-transform of a sequence = (xn)n∈Z is defined by:

Z((xn)n∈Z)(z) :=

  • n∈Z

xn z−n. (⋆) ⇒ Z(y)(z) = 2 (z−1 + 1) z−2 − 3 z−1 + 2 Z(u)(z) = 2 (z2 + z) 2 z2 − 3 z + 1 Z(u)(z).

  • Definition: The rational function

P(z) := s

j=0 bj z−j

r

i=0 ai z−i

is called the transfer function of the discrete-time linear system:

r

  • i=0

ai yi =

s

  • j=0

bj uj.

4/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-5
SLIDE 5

Discrete multidimensional systems

  • Roesser model:

          

  • xh(i + 1, j)

xv(i, j + 1)

  • = A
  • xh(i, j)

xv(i, j)

  • + B u(i, j),

y(i, j) = C

  • xh(i, j)

xv(i, j)

  • + D u(i, j).
  • Fornasini-Marchesini models:

x(i+1, j+1) = A1 x(i+1, j)+A2 x(i, j+1)+B1 u(i+1, j)+B2 u(i, j+1), . . .

  • n-dimensional recursive filters: digitial image processing, . . .

j := (j1, . . . , jn), k := (k1, . . . , kn) ∈ Zn ⇒ k − j := (k1 − j1, . . . , kn − jn) Z((h(k))k∈Zn)(z) :=

  • k∈Zn

h(k) z−k, z−k := z−k1

1

. . . z−kn

n

. y(k) = (h ⋆ u)(k) :=

  • j∈Zn

h(k − j) u(j) ⇒ Z(y)(z) = Z(h)(z) Z(u)(z), Z(h)(z1, . . . , zn) = n(z1, . . . , zn) d(z1, . . . , zn) ∈ R(z1, . . . , zn).

5/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-6
SLIDE 6

Overview

1

Multidimensional systems

2

Structural stability

3

Contribution on the stability test

4

Ongoing work on the stability analysis

6/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-7
SLIDE 7

Structural stability

  • P := N(z1,...,zn)

D(z1,...,zn) ∈ R(z1, . . . , zn): a transfer function (gcd(D, N) = 1).

  • The closed unit polydisc of Cn:

D

n := {z = (z1, . . . , zn) ∈ Cn | |zi| ≤ 1, i = 1, . . . , n, }.

  • Definition: P is structurally stable if D is devoid from zero in D

n, i.e.:

∀ z = (z1, . . . , zn) ∈ D

n : D(z1, . . . , zn) = 0.

(1)

  • The affine algebraic set associated to D:

VC(D) := {z = (z1, . . . , zn) ∈ Cn | D(z1, . . . , zn) = 0}.

  • Condition (1) is equivalent to:

VC(D) ∩ D

n = ∅.

7/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-8
SLIDE 8

Previous works

The case n = 1

  • Check that the complex roots of the polynomial

D(z) = an zn + an−1 zn−1 + . . . + a0 do not belong to D := {z ∈ C | |z| ≤ 1}.

  • Several algebraic stability criteria (Jury test, Bistritz test, etc),

discrete time analogues of the Routh-Hurwitz criterion.

  • Based on Cauchy index computation: sign variation in some

polynomial sequences.

  • The complexity of a univariate gcd computation.

8/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-9
SLIDE 9

Previous works

Bistritz test

  • Let D(z) := an zn + an−1 zn−1 + . . . + a0 and D⋆(z) := zn D(z−1).
  • Compute the sequence of polynomials {Ti(z)}i=n,...,0, defined by

             Tn(z) := D(z) + D⋆(z), Tn−1(z) := D(z) + D⋆(z) (z − 1) , Ti−1(z) := δi+1(1 + z)Ti(z) − Ti+1(z) z , where δi+1 := Ti+1(0)

Ti(0) for i = n − 1, . . . , 1.

  • Criterion: The system is stable if and only if the sequence is

normal and the number of sign variation in {Tn(1), . . . , T0(1)} is zero.

8/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-10
SLIDE 10

Previous works

The case n>1

  • First step: Simplification of the initial condition.
  • [Strintzis,Huang 1977]:

             D(0, . . . , 0, zn) = 0, |zn| ≤ 1, D(0, . . . , 0, zn−1, zn) = 0, |zn−1| ≤ 1, |zn| = 1, . . . . . . D(0, z2, . . . , zn) = 0, |z2| ≤ 1, |zi| = 1, i > 2, D(z1, z2, . . . , zn) = 0, |z1| ≤ 1, |zi| = 1, i > 1.

  • [DeCarlo et al, 1977]:

             D(z1, 1, . . . , 1) = 0, |z1| ≤ 1, D(1, z2, 1, . . . , 1) = 0, |z2| ≤ 1, . . . . . . D(1, . . . , 1, zn) = 0, |zn| ≤ 1, D(z1, . . . , zn) = 0, |z1| = . . . = |zn| = 1.

9/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-11
SLIDE 11

Previous works

The case n>1

  • Second step: Implementation.
  • The case n = 2: Numerous tests (Bistritz (94,99,02,03,04), Xu et
  • al. 04, Fu et al. 06, etc).

Most of them are based on Strintzis conditions. Generalization of univariate tests (sub-resultant computation).

  • The case n > 2: very few (Dumetriscu 06, Serban and Najim 07).

Sum of square techniques: either inefficient or conservative.

9/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-12
SLIDE 12

Overview

1

Multidimensional systems

2

Structural stability

3

Contribution on the stability test

4

Ongoing work on the stability analysis

10/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-13
SLIDE 13

DeCarlo’s conditions

  • Start with DeCarlo’s conditions:

                 D(z1, 1, . . . , 1) = 0, |z1| ≤ 1, D(1, z2, 1, . . . , 1) = 0, |z2| ≤ 1, . . . . . . D(1, . . . , 1, zn) = 0, |zn| ≤ 1, D(z1, . . . , zn) = 0, |z1| = . . . = |zn| = 1.

  • All the conditions except the last one can be tested using classical

univariate stability tests.

  • Focus on the condition: D(z1, . . . , zn) = 0, |z1| = . . . = |zn| = 1.

11/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-14
SLIDE 14

One first approach

  • zk := xk + i yk, xk, yk ∈ R, k = 1, . . . , n, i2 = −1.

The problem is equivalent to the study of the algebraic system: (S)                R(D(x1 + i y1, . . . , xn + i yn)) := R(x1, y1, . . . , xn, yn) = 0, C(D(x1 + i y1, . . . , xn + i yn)) := C(x1, y1, . . . , xn, yn) = 0, x2

1 + y2 1 − 1 = 0,

. . . x2

n + y2 n − 1 = 0.

  • Case n = 2 : zero-dimensional system univariate rational

representation, triangular representation, Gröbner bases.

  • Case n > 2 : systems with positive dimension cylindrical

algebraic decomposition, critical points methods

12/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-15
SLIDE 15

One first approach

  • zk := xk + i yk, xk, yk ∈ R, k = 1, . . . , n, i2 = −1.

The problem is equivalent to the study of the algebraic system: (S)                R(D(x1 + i y1, . . . , xn + i yn)) := R(x1, y1, . . . , xn, yn) = 0, C(D(x1 + i y1, . . . , xn + i yn)) := C(x1, y1, . . . , xn, yn) = 0, x2

1 + y2 1 − 1 = 0,

. . . x2

n + y2 n − 1 = 0.

  • Case n = 2 : zero-dimensional system univariate rational

representation, triangular representation, Gröbner bases.

  • Case n > 2 : systems with positive dimension cylindrical

algebraic decomposition, critical points methods Drawback: The number of variables is doubled!

12/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-16
SLIDE 16

Alternative approach

  • Goal: Avoid doubling the number of variables.
  • The unit poly-circle defines a n-D subspace in the 2n-D complex

space.

  • Via some transformations, the problem can be reduced to the

search of zeros in the real space Rn.

  • The obtained conditions are checked using classical algorithms for

solving algebraic systems.

13/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-17
SLIDE 17

Unit circle parametrization

  • Only the zeros of D on the unit poly-circle Tn are considered.
  • Use the parametrization of the complex unit circle:

T := {z ∈ C | |z| = 1}. zk := (1−x2

k )

(1+x2

k ) + i

2 xk (1+x2

k ), k = 1, . . . , n

  • Let R(x1, . . . , xn) + i C(x1, . . . , xn) be the numerator of the fraction:

D 1 − x2

1

1 + x2

1

+ i 2x1 1 + x2

1

, . . . , 1 − x2

n

1 + x2

n

+ i 2xn 1 + x2

n

  • .
  • Theorem: VC(D) ∩ [T \ {−1}]n = ∅ ⇐

⇒ VR(R, C) = ∅.

14/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-18
SLIDE 18

Unit circle parametrization

  • Only the zeros of D on the unit poly-circle Tn are considered.
  • Use the parametrization of the complex unit circle:

T := {z ∈ C | |z| = 1}. zk := (1−x2

k )

(1+x2

k ) + i

2 xk (1+x2

k ), k = 1, . . . , n

  • Let R(x1, . . . , xn) + i C(x1, . . . , xn) be the numerator of the fraction:

D 1 − x2

1

1 + x2

1

+ i 2x1 1 + x2

1

, . . . , 1 − x2

n

1 + x2

n

+ i 2xn 1 + x2

n

  • .
  • Theorem: VC(D) ∩ [T \ {−1}]n = ∅ ⇐

⇒ VR(R, C) = ∅. Drawback: The degree is doubled!

14/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-19
SLIDE 19

Möbius transformation

  • Definition: A Möbius transformation is a rational function

φ : C := C ∪ {∞} − → C := C ∪ {∞} z − →

a z+b c z+d ,

for a, b, c, d ∈ C satisfying ad − bc = 0

  • φ
  • − d

c

  • = ∞, φ(∞) = a

c

  • .
  • The Möbius transformation φ(z) := z−i

z+i maps the real line

R := R ∪ ∞ to the unit complex circle T. zk := (xk−i)

(xk+i),

k = 1, . . . , n.

  • Let R(x1, . . . , xn) + i C(x1, . . . , xn) be the numerator of the fraction:

D x1 − i x1 + i , . . . , xn − i xn + i

  • .
  • Theorem: VC(D) ∩ [T \ {1}]n = ∅ ⇐

⇒ VR(R, C) = ∅.

  • Remark: The total degree of R and C is bounded by n

i=1 degzi(D)

15/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-20
SLIDE 20

Checking for real zeros in Rn

Critical point methods

  • Basu, Pollack, Roy, Giusti, Heintz, Bank, Safey El Din . . .
  • Principle: Computation of the critical points of some polynomial

application π restricted to the algebraic set V := V(R, C).

  • Algorithm: Based on Safey El Din and Schost 2003
  • Compute zero-dimensional systems that encode these critical

points and check if they admits real solutions.

  • A convenient representation of the solutions is the Rational

Univariate Representation (RUR).

16/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-21
SLIDE 21

Rational Univariate Representation

  • Let I ⊂ R[x1, . . . , xn] be a zero-dimensional ideal and

V(I) ⊂ Cn its variety. A RUR of I is given by: A linear form a1x1 + . . . + anxn that separates the points of V: A one-to-one mapping between the roots of an univariate polynomial f and the solutions of V: φt : VC(I) ≈ VC(f) α − → t(α), fx1(β) f1(β) , . . . , fxn(β) f1(β)

− β.

  • V(I) ∩ Rn = ∅ if and only if V(f) ∩ R = ∅ Sturm sequence.

17/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-22
SLIDE 22

The overall algorithm

Procedure: IsStable begin Data : D(z1, . . . , zn) ∈ R[z1, . . . , zn] Result : return True if V(D(z1, . . . , zn)) ∩ Dn = ∅ for k = 0 to n − 2 do Compute Sk, the set of polynomials obtained from D(z1, . . . , zn) after substituting k variables by 1 foreach Dk in Sk do {R, C} = Möbius_transform(Dk) if VR({R, C}) = ∅ then return False end end end if all the univariate polynomials in Sn−1 are stable then return True else return false end end end

18/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-23
SLIDE 23

Implementation

  • A Maple procedure is provided based on:

The univariate stability test of Bistritz. The external Maple package RAGlib for the study of real zeros of polynomial systems developed by M. Safey El Din.

  • This implementation is able to check the stability of systems in 5

variables with moderate degree (5-10). ❳❳❳❳❳❳❳❳❳ ❳ nb var degree 3 5 8 10 12 2 sparse 0.1 0.12 0.3 0.5 4 dense 0.1 0.2 0.9 3.0 12 3 sparse 0.15 0.3 0.8 3 15 dense 1 2 12 53 342

Table: CPU times in seconds of IsStable run on random polynomials in 2 and 3 variables with rational coefficients.

19/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-24
SLIDE 24

Overview

1

Multidimensional systems

2

Structural stability

3

Contribution on the stability test

4

Ongoing work on the stability analysis

20/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-25
SLIDE 25

Ongoing work

  • The first certified structural stability test for multidimensional

systems.

  • Stability of systems with parameters: compute regions of the

parameter space where the system is structurally stable.

  • Handle an arbitrary algebraic set instead of an hypersurface:

needed for testing the stabilization.

21/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-26
SLIDE 26

References on the stability analysis

  • M. Benidir, M. Barret, Stabilité des filtres et des systémes

linéaires, Dunod, 1999.

  • L. Li, L. Xu, Z. Lin, “Stability and stabilisation of linear

multidimensional discrete systems in the frequency domain”, 2013.

  • E. I. Jury, “Stability of multidimensional systems and related

problems”, in Multidimensional Systems. Techniques and Applications, Marcel Dekker, New York, 1986, 89-159.

  • M. Safey El Din, Polynomial System Solver over the Real,

Habilitation Thesis, Univ. Pierre and Marie Curie, 2010. F . Rouillier, “Solving zero-dimensional systems through the rational univariate representation” Journal of applicable algebra in engineering, communication and computing, 1999.

22/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems

slide-27
SLIDE 27

References on the stability analysis

  • S. Basu, R. Pollack, M.-F. Roy, Algorithms in Real Algebraic

Geometry, Springer- Verlag, 2003.

  • D. S. Arnon, G. E. Collins, S. McCallum, “Cylindrical algebraic

decomposition I: The basic algorithm”, SIAM Journal on Computing, 13 (1984), 865-877, “Cylindrical algebraic decomposition II: An adjacency algorithm for the plane”, 13 (1984), 878-889.

  • G. E. Collins, “Quantifier elimination for real closed fields by

cylindrical algebraic decomposition”, in Automation Theory and Formal Languages, Lecture Notes in Computer Sciences 33, Springer, 1975, 184-232.

  • T. Becker, V. Weispfenning, Gröbner Bases, Springer, 1998.

23/23 Yacine Bouzidi, Alban Quadrat, Fabrice Rouillier Stability of n-dimensional systems