Definition: Schur

A polynomial is Schur if .

Lemma 1

Let . If is Schur, then .

This is a necessary but not sufficient condition. So does not necessarily mean a polynomial is Schur.

Boundary Crossing Lemma

Let and . If is Schur and is not Schur (or vice versa), then such that has a root on the unit circle.

Let . Let .

  • Example: . Then

Let

  • Line 3-4: For we get .

Lemma 2

Suppose . Then is Schur is Schur.

Define :

  • degree , , , …, 1

For degree 1, we have , which has a root at . Then:

Jury Test Algorithm

Given for some .

Check if .

  • If not, then is not Schur (lemma 1).
    • Then is not Schur (lemma 2).
    • Then, is not Schur (lemma 2).
    • (presumably only made it to this step if for )
  • If yes, set
    • (repeat)
    • Stop with
      • If Schur, then is Schur
      • If not Schur, then is not Schur

Example 10.1b

For a discrete time system, determine the range of that stabilizes the CL system.

Then, the closed-loop polynomial is:

  • The first term is stable (root at -0.5), but we need to check if the second term is Schur

The Jury Test:

Then:

Which gives , since we must have .

Then:

which gives

Then:

so:

to get , we need

This is not possible; no value of would allow the system to be CL stable.

Jury Table:

Theorem: Jury Test

Assume (if not, use ).

Then, is Schur if and only if

We either check or go to .