parrot(1)

NAME
parrot - Parrot's problem

CALLING SEQUENCE
[K]=parrot(D,r)

PARAMETERS

D,K : matrices

r   : 1X2 vector (dimension of the 2,2 part of D)

DESCRIPTION
Given a matrix D partionned as [D11 D12; D21 D22] where size(D22)=r=[r1,r2] compute a matrix K such that largest singular value of [D11 D12; D21 D22+K] is minimal (Parrot's problem)

SEE ALSO
H_inf_stat