Robustness measures and level set methods P. Van Dooren Abstract In - - PDF document

robustness measures and level set methods
SMART_READER_LITE
LIVE PREVIEW

Robustness measures and level set methods P. Van Dooren Abstract In - - PDF document

Robustness measures and level set methods P. Van Dooren Abstract In this talk we discuss the computation of a range of robustness measures for linear time invariant systems. More precisely, we propose algorithms based on the idea of level set


slide-1
SLIDE 1

Robustness measures and level set methods

  • P. Van Dooren

Abstract— In this talk we discuss the computation of a range of robustness measures for linear time invariant

  • systems. More precisely, we propose algorithms based on the idea of level set methods of particular functions,

to compute or approximate several of these robustness measures in an efficient manner. Level set methods were

  • riginally proposed for the computation of the complex stability radius of a dynamical system but we show in

this talk that they can be extended to cover a wider range of robustness measures. Keywords— Stability, Passivity, Controllability, Level set methods

  • I. ROBUSTNESS ISSUES

We consider a time-invariant dynamical system with an p×m transfer matrix given by a minimal realization H(λ) := C(λIn − A)−1B + D where A ∈ Fn×n, B ∈ Fn×m, C ∈ Fp×n, and D ∈ Fp×m, and F denotes either C or R. Notice that we cover both the case of continuous-time systems (then λ denotes the Laplace transform variable s) and of discrete-time systems (then λ denotes the shift variable z). We then consider the perturbed transfer function H∆(λ) := C∆(λIn − A∆)−1B∆ + D∆ where A∆ B∆ C∆ D∆

  • :=

A B C D

∆A ∆B ∆C ∆D

  • and ask several questions related to robustness of the nominal system H(λ). If H(λ) has a particular property,

what is the smallest perturbation ∆ such that H∆(λ) looses this property ? In particular, we ask this question with respect to: (i) stability of H(λ), implying that an eigenvalue of A∆ leaves the “stable” region Γ of the complex plane, (ii) passivity of H(λ) (for m = p), implying that an eigenvalue of A∆ leaves the stable region Γ or that a zero of H∆(λ) + H∗

∆(λ) crosses the boundary ∂Γ of Γ,

(iii) minimality of H(λ), implying that (A∆, B∆) is not controllable or (A∆, C∆) is not observable anymore. We will consider several classes of perturbations, where ∆ := ∆A ∆B ∆C ∆D

  • (i) is real or complex, (ii) is full or structured, or a combination of both. As a result of this we encounter

the well known concepts of structured singular values and their computation or approximation. We also point

  • ut that other performance criteria of dynamical systems can often be recast as one of the above problems.
  • II. POSITIVE FUNCTIONS IN THE COMPLEX PLANE

If we measure the size of the perturbation ∆ by its induced 2-norm ∆2, the unstructured complex stability radius is well known [9] to be linked to the function ν(λ) := σmax[(λIn − A)−1] which is a real valued function defined in the complex plane. The so-called complex stability radius [9] rC := inf{∆2 | H∆(λ) is not stable} actually satisfies r−1

C

= max

λ∈∂Γ[ν(λ)]

  • P. Van Dooren is with the Department of Mathematical Engineering, Catholic University of Louvain, Louvain la Neuve, Belgium,

vandooren@csam.ucl.ac.be

slide-2
SLIDE 2

In Figure 1a we show the function ν(λ) for λ ∈ C corresponding to a discrete-time system of order n = 20. The inverse of the stability radius is the maximum of that function on the unit circle (i.e. on ∂Γ). Figure 1b shows the contour plot of the same function and also displays the unit circle, on which this function has to be maximized. This contour plot is also known to correspond to the spectral value sets (or pseudo-spectrum)

  • f the matrix A [18].

−2 −1 1 2 −2 −1.5 −1 −0.5 0.5 1 1.5 2

  • Fig. 1.

ν(λ) for a stable discrete time system, and the corresponding contour plot

If we parameterize ∂Γ as a function of a real variable ω (ejω for a discrete-time system and jω for a continuous-time system), then we are actually computing the maximum of a real valued functions of a real variable ω. This is depicted in Figure 2.

−4 −3 −2 −1 1 2 3 4 5 10 15 20 25 30 35 40 Frequency response amplitude |H(ejω)|

  • Fig. 2.

ν(ejω) as a function of ω

slide-3
SLIDE 3
  • III. BASIC LEVEL SET METHOD

The basic idea of level set methods is quite simple. Rather than trying to find the maximum of the above real valued function, one “cuts” with a level ξ and computes the points of intersection. These turn out to be the roots of a particular eigenvalue problem associated with the dynamical system H(λ) [5].

10 10

1

10

2

0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 Frequency ω2 ω4 ξ0 ≡ ξold ω6 ω8 ω7 ω3 ω5 ω1

  • Fig. 3.

Singular values σ1(ω) and σ2(ω)

In Figure 3, we show the two largest singular value functions σi(ω) for a matrix coming from a continuous- time system. We also indicate a level ξ0 for which we want to check if there is any eigenvalue σi(ω) = ξ0. One easily shows that the supremum ξmax of all levels for which there are still intersections, actually equals r−1

C . Using this idea, a bisection-based algorithm to find ξmax was derived in [5]. This algorithm has

linear convergence. A method with more rapid convergence can be obtained by using additional information on the above singular functions (see [3], [4], [7], [15]). which are obtained as a by-product of the eigenvalue problem used to compute the intersection ωi. In [6] it is shown how to use the information of the derivative of σmax(ω) at each point in order to determine the relevant “level sets” [ω1, ω4] and [ω5, ω8] in which one needs to find the maximum of the function σmax(ω). Using these level sets and the derivative of σmax(ω) at their endpoints, one then constructs a new frequency ωnew that is a good estimate of an extremal frequency of the largest of all singular values. It is shown in [6] that such a scheme has global linear convergence and at least cubic asymptotic convergence. The complexity of each iteration is only cubic in the dimensions of the system matrix of H(λ) and reliable numerical methods are now available to solve the underlying eigenvalue problems [1].

  • IV. EXTENSIONS TO OTHER PROBLEMS

The above basic level set method works for problems in which the plotted functions are singular values σi(H(λ)) plotted against λ = jω of ejω, and where H(λ) is a rational matrix function. In most of the other

slide-4
SLIDE 4

problems we mentioned above, this does not hold anymore. The real stability radius problem and the passivity radius problem both involve a function µ(H(λ)) plotted against λ = jω of ejω which at each frequency ω is itself the result of an optimization problem over some

  • ther scaling parameters which are elements of a matrix D. For the real stability radius, this is e.g. [14]

µ(M) = inf

d∈(0,1] σ2

  • ℜ M

−dℑ M d−1ℑ M ℜ M

  • involving only a single scalar parameter d. It is also known that µ(ω) is then not necessarily continuous

anymore (see [6]) and that the problem is much more delicate. Nevertheless, it was shown in [17] that

  • ne can still use level set methods to solve this problem. It turns out that the function µ(ω) – depicted in

Figure 4 as λγ(H(ω)) – is the lower envelope of a set of other functions µd(ω) – depicted in Figure 4 as λmax(Hγo(ω)) – which do correspond to a rational matrix function Hγo(λ)). The corresponding dotted curves are then smooth even though the lower envelope can be discontinuous [14]. One shows [17] that this can be exploited efficiently to again come up with en efficient level set method for computing the real stability

  • radius. The basic idea is to find the level set of the dotted curve, which is tangential in at least one point with

the full curve (which is the lower envelope of all dotted curves). In Figure 4 this yields two possible intervals in which to look for the supremum of the full curve. By doing this, one needs to solve the optimization problem in the scaling parameters D in only a limited number of frequencies and one shows that overall the complexity is still quite low.

1 2 3 4 5 6 7 8 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 2.2 ω ξ λγ(H(ω)) λmax(Hγ

  • (ω))
  • Fig. 4.

Level set iterations

In the computation of the passivity radius, a very similar problem occurs, except that for the complex passivity radius problem a single real parameter enters the picture, while for the real passivity radius two real parameters are involved [11], [16]. One can also link this problem tho that of finding a particular performance radius of a closed loop system [10].

slide-5
SLIDE 5

In the structured singular value problem, the same result again applies [12], but this only yields a bound for the structured singular value (this problem is known to be NP hard, in general). There the minimization problem over the parameters D can become quite complex, and it is harder to give guaranteed complexity bounds. In the problem of finding the closest non-minimal system to a given system, the function to minimize is now not constrained to a curve in the complex plane, but to a region of the complex plane. We point out that this is quite more challenging, and we report on some recent results in the area.

  • V. ACKNOWLEDGMENTS

This presents research supported by the Belgian Programme on Inter-university Poles of Attraction, initiated by the Belgian State, Prime Minister’s Office for Science, Technology and Culture. This work was also supported by the U.S. National Science Foundation under Grant No. ACI 0324944. REFERENCES

[1] P. BENNER, V. MEHRMANN, AND H. XU, A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils, Numerische Mathematik, vol. 78(3), pp. 329–358, 1998. [2] S. BOYD, V. BALAKRISHNAN, AND P. KABAMBA, A bisection method for computing the H∞ norm of a transfer matrix and related problems, Mathematics of Control, Signals, and Systems, vol. 2, pp. 207–219, 1989. [3] S. BOYD, AND V. BALAKRISHNAN, A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L∞ norm, Systems and Control Letters, vol. 15, pp. 1–7, 1990. [4] N. BRUINSMA, AND M. STEINBUCH, A fast algorithm to compute the H∞ norm of a transfer function matrix, Systems & Control Letters, vol. 14, pp. 287–293, 1990. [5] R. BYERS, A bisection method for measuring the distance of a stable matrix to the unstable matrices, SIAM J. Sci. Stat. Comput.,

  • vol. 9, pp. 875–881, Sept 1988.

[6] Y. GENIN, P. VAN DOOREN, AND V. VERMAUT. Convergence of the calculation of H∞ norms and related questions. in Proceedings MTNS-98, pp. 429–432, July 1998. [7] D. HINRICHSEN, B. KELB, AND A. LINNEMANN, An algorithm for the computation of the complex stability radius, Automatica,

  • vol. 25, pp. 771–775, 1989.

[8] D. HINRICHSEN, AND N. K. SON, The complex stability radius of discrete-time systems and symplectic pencils, in Proceedings 28th IEEE Conference on Decision and Control, (Tampa, FL), pp. 2265–2270, 1989. [9] D. HINRICHSEN, AND A. PRITCHARD. Mathematical Systems Theory I : Modelling State Space Analysis, Stability and Robustness, Springer Verlag, Vol. TAM 48, 2004. [10] T-S. HU, AND L. QIU, Complex and real performance radii and their computation, Int. J. Robust and Nonlinear Control, Vol. 7,

  • pp. 187–209, 1997.

[11] T-S. HU, AND L. QIU, On structured perturbations of Hermitian matrices, Linear Algebra and its Applications, Vol. 275-276,

  • pp. 287–314, 1998.

[12] C. LAWRENCE, A. TITS, AND P. VAN DOOREN, A fast algorithm for the computation of an upper bound on the µ-norm, Automatica, vol. 36, pp. 449–456, 2000. [13] M. MOTSCHA, An algorithm to compute the complex stability radius, International Journal of Control, vol. 48, pp. 2417–2428, 1988. [14] L. QIU, B. BERNHARDSSON, A. RANTZER, E.J. DAVISON, P.M. YOUNG, AND J.C. DOYLE, A formula for computation of the real stability radius, Automatica, vol. 31, pp. 879-890, 1995. [15] G. ROBEL, On computing the infinity norm, IEEE Transactions on Automatic Control, vol. 34, pp. 882–884, 1989. [16] M. OVERTON, AND P. VAN DOOREN, On computing the complex passivity radius, in Proceedings 44th IEEE Conference on Decision and Control, pp. 7960–7964, Spain, 2005. [17] J. SREEDHAR, P. VAN DOOREN, AND A.L. TITS, A fast algorithm to compute the real structured stability radius, in Int. Series

  • f Numer. Math., Birkhauser, Vol. 121, pp. 219–230, 1996.

[18] L. TREFETHEN, AND M. EMBREE, Spectra and Pseudospectra, Princeton University Press, 2005.