A STATE-SPACE ALGORITHM FOR THE SOLUTION OF THE 2-BLOCK SUPEROPTIMAL DISTANCE PROBLEM
A state-space algorithm for computing the solution of the 2-block superoptimal distance problem (SODP) is presented. Given a rational and antistable matrix function R(s) = [R11(s)R12(s)], find all stable approximations Q(s) that lexicographically minimize the singular values of the error function E(...
Main Authors: | Jaimoukha, I, Limebeer, D |
---|---|
Format: | Journal article |
Published: |
1993
|
Similar Items
-
A STATE-SPACE ALGORITHM FOR THE SOLUTION OF THE 2-BLOCK SUPEROPTIMAL DISTANCE PROBLEM
by: Jaimoukha, I, et al.
Published: (1992) -
A STATE-SPACE ALGORITHM FOR THE SUPEROPTIMAL HANKEL-NORM APPROXIMATION PROBLEM
by: Halikias, G, et al.
Published: (1993) -
STATE-SPACE ALGORITHM FOR THE COMPUTATION OF SUPEROPTIMAL MATRIX INTERPOLATING FUNCTIONS
by: Limebeer, D, et al.
Published: (1989) -
All solutions to the four block general distance problem
by: Limebeer, D, et al.
Published: (1988) -
A descriptor solution to a class of discrete distance problems
by: AlHusari, M, et al.
Published: (1997)