Update to SLICOT v5.9

[bnavigator]

SLICOT was updated to v5.9

There are some sneaky addtions, which could be useful:

SLICOT/SLICOT-Reference@v5.8...v5.9

      SUBROUTINE AB13HD( DICO, JOBE, EQUIL, JOBD, CKPROP, REDUCE, POLES,
     $                   N, M, P, RANKE, FPEAK, A, LDA, E, LDE, B, LDB,
     $                   C, LDC, D, LDD, NR, GPEAK, TOL, IWORK, DWORK,
     $                   LDWORK, ZWORK, LZWORK, BWORK, IWARN, INFO )
C
C     PURPOSE
C
C     To compute the L-infinity norm of a proper continuous-time or
C     causal discrete-time system, either standard or in the descriptor
C     form,

--> Enhancement of python-control/python-control#971

      SUBROUTINE MB04RT( M, N, PMAX, A, LDA, B, LDB, C, LDC, D, LDD, E,
     $                   LDE, F, LDF, SCALE, IWORK, INFO )
C
C     PURPOSE
C
C     To solve the generalized real Sylvester equation
C
C              A * R - L * B = scale * C,                            (1)
C              D * R - L * E = scale * F,
C
C     using Level 3 BLAS, where R and L are unknown M-by-N matrices, and
C     (A, D), (B, E) and (C, F) are given real matrix pairs of size
C     M-by-M, N-by-N and M-by-N, respectively.  (A,D) and (B,E) must be
C     in generalized Schur canonical form, i.e., A, B are upper quasi-
C     triangular and D, E are upper triangular.

 SUBROUTINE MB04RV( M, N, PMAX, A, LDA, B, LDB, C, LDC, D, LDD, E,
     $                   LDE, F, LDF, SCALE, INFO )
C
C     PURPOSE
C
C     To solve the generalized complex Sylvester equation
C
C              A * R - L * B = scale * C,                            (1)
C              D * R - L * E = scale * F,
C
C     using Level 1 and 2 BLAS, where R and L are unknown M-by-N
C     matrices, and (A, D), (B, E) and (C, F) are given matrix pairs of
C     size M-by-M, N-by-N and M-by-N, respectively. A, B, D and E are
C     complex upper triangular (i.e., (A,D) and (B,E) are in generalized
C     Schur form).

 SUBROUTINE MB04RW( M, N, PMAX, A, LDA, B, LDB, C, LDC, D, LDD, E,
     $                   LDE, F, LDF, SCALE, IWORK, INFO )
C
C     PURPOSE
C
C     To solve the generalized complex Sylvester equation
C
C              A * R - L * B = scale * C,                            (1)
C              D * R - L * E = scale * F,
C
C     using Level 3 BLAS, where R and L are unknown M-by-N matrices, and
C     (A, D), (B, E) and (C, F) are given matrix pairs of size M-by-M,
C     N-by-N and M-by-N, respectively. A, B, D and E are complex upper
C     triangular (i.e., (A,D) and (B,E) are in generalized Schur form).