ruby-lapack 1.3

data/dev/defs/dtgsja

@@ -0,0 +1,343 @@
+--- 
+:name: dtgsja
+:md5sum: bdebfefc02addc07abc6c7dc534b59bb
+:category: :subroutine
+:arguments: 
+- jobu: 
+    :type: char
+    :intent: input
+- jobv: 
+    :type: char
+    :intent: input
+- jobq: 
+    :type: char
+    :intent: input
+- m: 
+    :type: integer
+    :intent: input
+- p: 
+    :type: integer
+    :intent: input
+- n: 
+    :type: integer
+    :intent: input
+- k: 
+    :type: integer
+    :intent: input
+- l: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- b: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - ldb
+    - n
+- ldb: 
+    :type: integer
+    :intent: input
+- tola: 
+    :type: doublereal
+    :intent: input
+- tolb: 
+    :type: doublereal
+    :intent: input
+- alpha: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - n
+- beta: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - n
+- u: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - ldu
+    - m
+- ldu: 
+    :type: integer
+    :intent: input
+- v: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - ldv
+    - p
+- ldv: 
+    :type: integer
+    :intent: input
+- q: 
+    :type: doublereal
+    :intent: input/output
+    :dims: 
+    - ldq
+    - n
+- ldq: 
+    :type: integer
+    :intent: input
+- work: 
+    :type: doublereal
+    :intent: workspace
+    :dims: 
+    - 2*n
+- ncycle: 
+    :type: integer
+    :intent: output
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: {}
+
+:fortran_help: "      SUBROUTINE DTGSJA( JOBU, JOBV, JOBQ, M, P, N, K, L, A, LDA, B, LDB, TOLA, TOLB, ALPHA, BETA, U, LDU, V, LDV, Q, LDQ, WORK, NCYCLE, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DTGSJA computes the generalized singular value decomposition (GSVD)\n\
+  *  of two real upper triangular (or trapezoidal) matrices A and B.\n\
+  *\n\
+  *  On entry, it is assumed that matrices A and B have the following\n\
+  *  forms, which may be obtained by the preprocessing subroutine DGGSVP\n\
+  *  from a general M-by-N matrix A and P-by-N matrix B:\n\
+  *\n\
+  *               N-K-L  K    L\n\
+  *     A =    K ( 0    A12  A13 ) if M-K-L >= 0;\n\
+  *            L ( 0     0   A23 )\n\
+  *        M-K-L ( 0     0    0  )\n\
+  *\n\
+  *             N-K-L  K    L\n\
+  *     A =  K ( 0    A12  A13 ) if M-K-L < 0;\n\
+  *        M-K ( 0     0   A23 )\n\
+  *\n\
+  *             N-K-L  K    L\n\
+  *     B =  L ( 0     0   B13 )\n\
+  *        P-L ( 0     0    0  )\n\
+  *\n\
+  *  where the K-by-K matrix A12 and L-by-L matrix B13 are nonsingular\n\
+  *  upper triangular; A23 is L-by-L upper triangular if M-K-L >= 0,\n\
+  *  otherwise A23 is (M-K)-by-L upper trapezoidal.\n\
+  *\n\
+  *  On exit,\n\
+  *\n\
+  *              U'*A*Q = D1*( 0 R ),    V'*B*Q = D2*( 0 R ),\n\
+  *\n\
+  *  where U, V and Q are orthogonal matrices, Z' denotes the transpose\n\
+  *  of Z, R is a nonsingular upper triangular matrix, and D1 and D2 are\n\
+  *  ``diagonal'' matrices, which are of the following structures:\n\
+  *\n\
+  *  If M-K-L >= 0,\n\
+  *\n\
+  *                      K  L\n\
+  *         D1 =     K ( I  0 )\n\
+  *                  L ( 0  C )\n\
+  *              M-K-L ( 0  0 )\n\
+  *\n\
+  *                    K  L\n\
+  *         D2 = L   ( 0  S )\n\
+  *              P-L ( 0  0 )\n\
+  *\n\
+  *                 N-K-L  K    L\n\
+  *    ( 0 R ) = K (  0   R11  R12 ) K\n\
+  *              L (  0    0   R22 ) L\n\
+  *\n\
+  *  where\n\
+  *\n\
+  *    C = diag( ALPHA(K+1), ... , ALPHA(K+L) ),\n\
+  *    S = diag( BETA(K+1),  ... , BETA(K+L) ),\n\
+  *    C**2 + S**2 = I.\n\
+  *\n\
+  *    R is stored in A(1:K+L,N-K-L+1:N) on exit.\n\
+  *\n\
+  *  If M-K-L < 0,\n\
+  *\n\
+  *                 K M-K K+L-M\n\
+  *      D1 =   K ( I  0    0   )\n\
+  *           M-K ( 0  C    0   )\n\
+  *\n\
+  *                   K M-K K+L-M\n\
+  *      D2 =   M-K ( 0  S    0   )\n\
+  *           K+L-M ( 0  0    I   )\n\
+  *             P-L ( 0  0    0   )\n\
+  *\n\
+  *                 N-K-L  K   M-K  K+L-M\n\
+  * ( 0 R ) =    K ( 0    R11  R12  R13  )\n\
+  *            M-K ( 0     0   R22  R23  )\n\
+  *          K+L-M ( 0     0    0   R33  )\n\
+  *\n\
+  *  where\n\
+  *  C = diag( ALPHA(K+1), ... , ALPHA(M) ),\n\
+  *  S = diag( BETA(K+1),  ... , BETA(M) ),\n\
+  *  C**2 + S**2 = I.\n\
+  *\n\
+  *  R = ( R11 R12 R13 ) is stored in A(1:M, N-K-L+1:N) and R33 is stored\n\
+  *      (  0  R22 R23 )\n\
+  *  in B(M-K+1:L,N+M-K-L+1:N) on exit.\n\
+  *\n\
+  *  The computation of the orthogonal transformation matrices U, V or Q\n\
+  *  is optional.  These matrices may either be formed explicitly, or they\n\
+  *  may be postmultiplied into input matrices U1, V1, or Q1.\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOBU    (input) CHARACTER*1\n\
+  *          = 'U':  U must contain an orthogonal matrix U1 on entry, and\n\
+  *                  the product U1*U is returned;\n\
+  *          = 'I':  U is initialized to the unit matrix, and the\n\
+  *                  orthogonal matrix U is returned;\n\
+  *          = 'N':  U is not computed.\n\
+  *\n\
+  *  JOBV    (input) CHARACTER*1\n\
+  *          = 'V':  V must contain an orthogonal matrix V1 on entry, and\n\
+  *                  the product V1*V is returned;\n\
+  *          = 'I':  V is initialized to the unit matrix, and the\n\
+  *                  orthogonal matrix V is returned;\n\
+  *          = 'N':  V is not computed.\n\
+  *\n\
+  *  JOBQ    (input) CHARACTER*1\n\
+  *          = 'Q':  Q must contain an orthogonal matrix Q1 on entry, and\n\
+  *                  the product Q1*Q is returned;\n\
+  *          = 'I':  Q is initialized to the unit matrix, and the\n\
+  *                  orthogonal matrix Q is returned;\n\
+  *          = 'N':  Q is not computed.\n\
+  *\n\
+  *  M       (input) INTEGER\n\
+  *          The number of rows of the matrix A.  M >= 0.\n\
+  *\n\
+  *  P       (input) INTEGER\n\
+  *          The number of rows of the matrix B.  P >= 0.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The number of columns of the matrices A and B.  N >= 0.\n\
+  *\n\
+  *  K       (input) INTEGER\n\
+  *  L       (input) INTEGER\n\
+  *          K and L specify the subblocks in the input matrices A and B:\n\
+  *          A23 = A(K+1:MIN(K+L,M),N-L+1:N) and B13 = B(1:L,N-L+1:N)\n\
+  *          of A and B, whose GSVD is going to be computed by DTGSJA.\n\
+  *          See Further Details.\n\
+  *\n\
+  *  A       (input/output) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          On entry, the M-by-N matrix A.\n\
+  *          On exit, A(N-K+1:N,1:MIN(K+L,M) ) contains the triangular\n\
+  *          matrix R or part of R.  See Purpose for details.\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A. LDA >= max(1,M).\n\
+  *\n\
+  *  B       (input/output) DOUBLE PRECISION array, dimension (LDB,N)\n\
+  *          On entry, the P-by-N matrix B.\n\
+  *          On exit, if necessary, B(M-K+1:L,N+M-K-L+1:N) contains\n\
+  *          a part of R.  See Purpose for details.\n\
+  *\n\
+  *  LDB     (input) INTEGER\n\
+  *          The leading dimension of the array B. LDB >= max(1,P).\n\
+  *\n\
+  *  TOLA    (input) DOUBLE PRECISION\n\
+  *  TOLB    (input) DOUBLE PRECISION\n\
+  *          TOLA and TOLB are the convergence criteria for the Jacobi-\n\
+  *          Kogbetliantz iteration procedure. Generally, they are the\n\
+  *          same as used in the preprocessing step, say\n\
+  *              TOLA = max(M,N)*norm(A)*MAZHEPS,\n\
+  *              TOLB = max(P,N)*norm(B)*MAZHEPS.\n\
+  *\n\
+  *  ALPHA   (output) DOUBLE PRECISION array, dimension (N)\n\
+  *  BETA    (output) DOUBLE PRECISION array, dimension (N)\n\
+  *          On exit, ALPHA and BETA contain the generalized singular\n\
+  *          value pairs of A and B;\n\
+  *            ALPHA(1:K) = 1,\n\
+  *            BETA(1:K)  = 0,\n\
+  *          and if M-K-L >= 0,\n\
+  *            ALPHA(K+1:K+L) = diag(C),\n\
+  *            BETA(K+1:K+L)  = diag(S),\n\
+  *          or if M-K-L < 0,\n\
+  *            ALPHA(K+1:M)= C, ALPHA(M+1:K+L)= 0\n\
+  *            BETA(K+1:M) = S, BETA(M+1:K+L) = 1.\n\
+  *          Furthermore, if K+L < N,\n\
+  *            ALPHA(K+L+1:N) = 0 and\n\
+  *            BETA(K+L+1:N)  = 0.\n\
+  *\n\
+  *  U       (input/output) DOUBLE PRECISION array, dimension (LDU,M)\n\
+  *          On entry, if JOBU = 'U', U must contain a matrix U1 (usually\n\
+  *          the orthogonal matrix returned by DGGSVP).\n\
+  *          On exit,\n\
+  *          if JOBU = 'I', U contains the orthogonal matrix U;\n\
+  *          if JOBU = 'U', U contains the product U1*U.\n\
+  *          If JOBU = 'N', U is not referenced.\n\
+  *\n\
+  *  LDU     (input) INTEGER\n\
+  *          The leading dimension of the array U. LDU >= max(1,M) if\n\
+  *          JOBU = 'U'; LDU >= 1 otherwise.\n\
+  *\n\
+  *  V       (input/output) DOUBLE PRECISION array, dimension (LDV,P)\n\
+  *          On entry, if JOBV = 'V', V must contain a matrix V1 (usually\n\
+  *          the orthogonal matrix returned by DGGSVP).\n\
+  *          On exit,\n\
+  *          if JOBV = 'I', V contains the orthogonal matrix V;\n\
+  *          if JOBV = 'V', V contains the product V1*V.\n\
+  *          If JOBV = 'N', V is not referenced.\n\
+  *\n\
+  *  LDV     (input) INTEGER\n\
+  *          The leading dimension of the array V. LDV >= max(1,P) if\n\
+  *          JOBV = 'V'; LDV >= 1 otherwise.\n\
+  *\n\
+  *  Q       (input/output) DOUBLE PRECISION array, dimension (LDQ,N)\n\
+  *          On entry, if JOBQ = 'Q', Q must contain a matrix Q1 (usually\n\
+  *          the orthogonal matrix returned by DGGSVP).\n\
+  *          On exit,\n\
+  *          if JOBQ = 'I', Q contains the orthogonal matrix Q;\n\
+  *          if JOBQ = 'Q', Q contains the product Q1*Q.\n\
+  *          If JOBQ = 'N', Q is not referenced.\n\
+  *\n\
+  *  LDQ     (input) INTEGER\n\
+  *          The leading dimension of the array Q. LDQ >= max(1,N) if\n\
+  *          JOBQ = 'Q'; LDQ >= 1 otherwise.\n\
+  *\n\
+  *  WORK    (workspace) DOUBLE PRECISION array, dimension (2*N)\n\
+  *\n\
+  *  NCYCLE  (output) INTEGER\n\
+  *          The number of cycles required for convergence.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          = 0:  successful exit\n\
+  *          < 0:  if INFO = -i, the i-th argument had an illegal value.\n\
+  *          = 1:  the procedure does not converge after MAXIT cycles.\n\
+  *\n\
+  *  Internal Parameters\n\
+  *  ===================\n\
+  *\n\
+  *  MAXIT   INTEGER\n\
+  *          MAXIT specifies the total loops that the iterative procedure\n\
+  *          may take. If after MAXIT cycles, the routine fails to\n\
+  *          converge, we return INFO = 1.\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  DTGSJA essentially uses a variant of Kogbetliantz algorithm to reduce\n\
+  *  min(L,M-K)-by-L triangular (or trapezoidal) matrix A23 and L-by-L\n\
+  *  matrix B13 to the form:\n\
+  *\n\
+  *           U1'*A13*Q1 = C1*R1; V1'*B13*Q1 = S1*R1,\n\
+  *\n\
+  *  where U1, V1 and Q1 are orthogonal matrix, and Z' is the transpose\n\
+  *  of Z.  C1 and S1 are diagonal matrices satisfying\n\
+  *\n\
+  *                C1**2 + S1**2 = I,\n\
+  *\n\
+  *  and R1 is an L-by-L nonsingular upper triangular matrix.\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"

data/dev/defs/dtgsna

@@ -0,0 +1,354 @@
+--- 
+:name: dtgsna
+:md5sum: 75f02e486f5cd5b703e5e189eb4780e2
+:category: :subroutine
+:arguments: 
+- job: 
+    :type: char
+    :intent: input
+- howmny: 
+    :type: char
+    :intent: input
+- select: 
+    :type: logical
+    :intent: input
+    :dims: 
+    - n
+- n: 
+    :type: integer
+    :intent: input
+- a: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - lda
+    - n
+- lda: 
+    :type: integer
+    :intent: input
+- b: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - ldb
+    - n
+- ldb: 
+    :type: integer
+    :intent: input
+- vl: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - ldvl
+    - m
+- ldvl: 
+    :type: integer
+    :intent: input
+- vr: 
+    :type: doublereal
+    :intent: input
+    :dims: 
+    - ldvr
+    - m
+- ldvr: 
+    :type: integer
+    :intent: input
+- s: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - mm
+- dif: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - mm
+- mm: 
+    :type: integer
+    :intent: input
+- m: 
+    :type: integer
+    :intent: output
+- work: 
+    :type: doublereal
+    :intent: output
+    :dims: 
+    - MAX(1,lwork)
+- lwork: 
+    :type: integer
+    :intent: input
+    :option: true
+    :default: "(lsame_(&job,\"V\")||lsame_(&job,\"B\")) ? 2*n*n : n"
+- iwork: 
+    :type: integer
+    :intent: workspace
+    :dims: 
+    - "lsame_(&job,\"E\") ? 0 : n + 6"
+- info: 
+    :type: integer
+    :intent: output
+:substitutions: 
+  mm: m
+:fortran_help: "      SUBROUTINE DTGSNA( JOB, HOWMNY, SELECT, N, A, LDA, B, LDB, VL, LDVL, VR, LDVR, S, DIF, MM, M, WORK, LWORK, IWORK, INFO )\n\n\
+  *  Purpose\n\
+  *  =======\n\
+  *\n\
+  *  DTGSNA estimates reciprocal condition numbers for specified\n\
+  *  eigenvalues and/or eigenvectors of a matrix pair (A, B) in\n\
+  *  generalized real Schur canonical form (or of any matrix pair\n\
+  *  (Q*A*Z', Q*B*Z') with orthogonal matrices Q and Z, where\n\
+  *  Z' denotes the transpose of Z.\n\
+  *\n\
+  *  (A, B) must be in generalized real Schur form (as returned by DGGES),\n\
+  *  i.e. A is block upper triangular with 1-by-1 and 2-by-2 diagonal\n\
+  *  blocks. B is upper triangular.\n\
+  *\n\
+  *\n\n\
+  *  Arguments\n\
+  *  =========\n\
+  *\n\
+  *  JOB     (input) CHARACTER*1\n\
+  *          Specifies whether condition numbers are required for\n\
+  *          eigenvalues (S) or eigenvectors (DIF):\n\
+  *          = 'E': for eigenvalues only (S);\n\
+  *          = 'V': for eigenvectors only (DIF);\n\
+  *          = 'B': for both eigenvalues and eigenvectors (S and DIF).\n\
+  *\n\
+  *  HOWMNY  (input) CHARACTER*1\n\
+  *          = 'A': compute condition numbers for all eigenpairs;\n\
+  *          = 'S': compute condition numbers for selected eigenpairs\n\
+  *                 specified by the array SELECT.\n\
+  *\n\
+  *  SELECT  (input) LOGICAL array, dimension (N)\n\
+  *          If HOWMNY = 'S', SELECT specifies the eigenpairs for which\n\
+  *          condition numbers are required. To select condition numbers\n\
+  *          for the eigenpair corresponding to a real eigenvalue w(j),\n\
+  *          SELECT(j) must be set to .TRUE.. To select condition numbers\n\
+  *          corresponding to a complex conjugate pair of eigenvalues w(j)\n\
+  *          and w(j+1), either SELECT(j) or SELECT(j+1) or both, must be\n\
+  *          set to .TRUE..\n\
+  *          If HOWMNY = 'A', SELECT is not referenced.\n\
+  *\n\
+  *  N       (input) INTEGER\n\
+  *          The order of the square matrix pair (A, B). N >= 0.\n\
+  *\n\
+  *  A       (input) DOUBLE PRECISION array, dimension (LDA,N)\n\
+  *          The upper quasi-triangular matrix A in the pair (A,B).\n\
+  *\n\
+  *  LDA     (input) INTEGER\n\
+  *          The leading dimension of the array A. LDA >= max(1,N).\n\
+  *\n\
+  *  B       (input) DOUBLE PRECISION array, dimension (LDB,N)\n\
+  *          The upper triangular matrix B in the pair (A,B).\n\
+  *\n\
+  *  LDB     (input) INTEGER\n\
+  *          The leading dimension of the array B. LDB >= max(1,N).\n\
+  *\n\
+  *  VL      (input) DOUBLE PRECISION array, dimension (LDVL,M)\n\
+  *          If JOB = 'E' or 'B', VL must contain left eigenvectors of\n\
+  *          (A, B), corresponding to the eigenpairs specified by HOWMNY\n\
+  *          and SELECT. The eigenvectors must be stored in consecutive\n\
+  *          columns of VL, as returned by DTGEVC.\n\
+  *          If JOB = 'V', VL is not referenced.\n\
+  *\n\
+  *  LDVL    (input) INTEGER\n\
+  *          The leading dimension of the array VL. LDVL >= 1.\n\
+  *          If JOB = 'E' or 'B', LDVL >= N.\n\
+  *\n\
+  *  VR      (input) DOUBLE PRECISION array, dimension (LDVR,M)\n\
+  *          If JOB = 'E' or 'B', VR must contain right eigenvectors of\n\
+  *          (A, B), corresponding to the eigenpairs specified by HOWMNY\n\
+  *          and SELECT. The eigenvectors must be stored in consecutive\n\
+  *          columns ov VR, as returned by DTGEVC.\n\
+  *          If JOB = 'V', VR is not referenced.\n\
+  *\n\
+  *  LDVR    (input) INTEGER\n\
+  *          The leading dimension of the array VR. LDVR >= 1.\n\
+  *          If JOB = 'E' or 'B', LDVR >= N.\n\
+  *\n\
+  *  S       (output) DOUBLE PRECISION array, dimension (MM)\n\
+  *          If JOB = 'E' or 'B', the reciprocal condition numbers of the\n\
+  *          selected eigenvalues, stored in consecutive elements of the\n\
+  *          array. For a complex conjugate pair of eigenvalues two\n\
+  *          consecutive elements of S are set to the same value. Thus\n\
+  *          S(j), DIF(j), and the j-th columns of VL and VR all\n\
+  *          correspond to the same eigenpair (but not in general the\n\
+  *          j-th eigenpair, unless all eigenpairs are selected).\n\
+  *          If JOB = 'V', S is not referenced.\n\
+  *\n\
+  *  DIF     (output) DOUBLE PRECISION array, dimension (MM)\n\
+  *          If JOB = 'V' or 'B', the estimated reciprocal condition\n\
+  *          numbers of the selected eigenvectors, stored in consecutive\n\
+  *          elements of the array. For a complex eigenvector two\n\
+  *          consecutive elements of DIF are set to the same value. If\n\
+  *          the eigenvalues cannot be reordered to compute DIF(j), DIF(j)\n\
+  *          is set to 0; this can only occur when the true value would be\n\
+  *          very small anyway.\n\
+  *          If JOB = 'E', DIF is not referenced.\n\
+  *\n\
+  *  MM      (input) INTEGER\n\
+  *          The number of elements in the arrays S and DIF. MM >= M.\n\
+  *\n\
+  *  M       (output) INTEGER\n\
+  *          The number of elements of the arrays S and DIF used to store\n\
+  *          the specified condition numbers; for each selected real\n\
+  *          eigenvalue one element is used, and for each selected complex\n\
+  *          conjugate pair of eigenvalues, two elements are used.\n\
+  *          If HOWMNY = 'A', M is set to N.\n\
+  *\n\
+  *  WORK    (workspace/output) DOUBLE PRECISION array, dimension (MAX(1,LWORK))\n\
+  *          On exit, if INFO = 0, WORK(1) returns the optimal LWORK.\n\
+  *\n\
+  *  LWORK   (input) INTEGER\n\
+  *          The dimension of the array WORK. LWORK >= max(1,N).\n\
+  *          If JOB = 'V' or 'B' LWORK >= 2*N*(N+2)+16.\n\
+  *\n\
+  *          If LWORK = -1, then a workspace query is assumed; the routine\n\
+  *          only calculates the optimal size of the WORK array, returns\n\
+  *          this value as the first entry of the WORK array, and no error\n\
+  *          message related to LWORK is issued by XERBLA.\n\
+  *\n\
+  *  IWORK   (workspace) INTEGER array, dimension (N + 6)\n\
+  *          If JOB = 'E', IWORK is not referenced.\n\
+  *\n\
+  *  INFO    (output) INTEGER\n\
+  *          =0: Successful exit\n\
+  *          <0: If INFO = -i, the i-th argument had an illegal value\n\
+  *\n\
+  *\n\n\
+  *  Further Details\n\
+  *  ===============\n\
+  *\n\
+  *  The reciprocal of the condition number of a generalized eigenvalue\n\
+  *  w = (a, b) is defined as\n\
+  *\n\
+  *       S(w) = (|u'Av|**2 + |u'Bv|**2)**(1/2) / (norm(u)*norm(v))\n\
+  *\n\
+  *  where u and v are the left and right eigenvectors of (A, B)\n\
+  *  corresponding to w; |z| denotes the absolute value of the complex\n\
+  *  number, and norm(u) denotes the 2-norm of the vector u.\n\
+  *  The pair (a, b) corresponds to an eigenvalue w = a/b (= u'Av/u'Bv)\n\
+  *  of the matrix pair (A, B). If both a and b equal zero, then (A B) is\n\
+  *  singular and S(I) = -1 is returned.\n\
+  *\n\
+  *  An approximate error bound on the chordal distance between the i-th\n\
+  *  computed generalized eigenvalue w and the corresponding exact\n\
+  *  eigenvalue lambda is\n\
+  *\n\
+  *       chord(w, lambda) <= EPS * norm(A, B) / S(I)\n\
+  *\n\
+  *  where EPS is the machine precision.\n\
+  *\n\
+  *  The reciprocal of the condition number DIF(i) of right eigenvector u\n\
+  *  and left eigenvector v corresponding to the generalized eigenvalue w\n\
+  *  is defined as follows:\n\
+  *\n\
+  *  a) If the i-th eigenvalue w = (a,b) is real\n\
+  *\n\
+  *     Suppose U and V are orthogonal transformations such that\n\
+  *\n\
+  *                U'*(A, B)*V  = (S, T) = ( a   *  ) ( b  *  )  1\n\
+  *                                        ( 0  S22 ),( 0 T22 )  n-1\n\
+  *                                          1  n-1     1 n-1\n\
+  *\n\
+  *     Then the reciprocal condition number DIF(i) is\n\
+  *\n\
+  *                Difl((a, b), (S22, T22)) = sigma-min( Zl ),\n\
+  *\n\
+  *     where sigma-min(Zl) denotes the smallest singular value of the\n\
+  *     2(n-1)-by-2(n-1) matrix\n\
+  *\n\
+  *         Zl = [ kron(a, In-1)  -kron(1, S22) ]\n\
+  *              [ kron(b, In-1)  -kron(1, T22) ] .\n\
+  *\n\
+  *     Here In-1 is the identity matrix of size n-1. kron(X, Y) is the\n\
+  *     Kronecker product between the matrices X and Y.\n\
+  *\n\
+  *     Note that if the default method for computing DIF(i) is wanted\n\
+  *     (see DLATDF), then the parameter DIFDRI (see below) should be\n\
+  *     changed from 3 to 4 (routine DLATDF(IJOB = 2 will be used)).\n\
+  *     See DTGSYL for more details.\n\
+  *\n\
+  *  b) If the i-th and (i+1)-th eigenvalues are complex conjugate pair,\n\
+  *\n\
+  *     Suppose U and V are orthogonal transformations such that\n\
+  *\n\
+  *                U'*(A, B)*V = (S, T) = ( S11  *   ) ( T11  *  )  2\n\
+  *                                       ( 0    S22 ),( 0    T22) n-2\n\
+  *                                         2    n-2     2    n-2\n\
+  *\n\
+  *     and (S11, T11) corresponds to the complex conjugate eigenvalue\n\
+  *     pair (w, conjg(w)). There exist unitary matrices U1 and V1 such\n\
+  *     that\n\
+  *\n\
+  *         U1'*S11*V1 = ( s11 s12 )   and U1'*T11*V1 = ( t11 t12 )\n\
+  *                      (  0  s22 )                    (  0  t22 )\n\
+  *\n\
+  *     where the generalized eigenvalues w = s11/t11 and\n\
+  *     conjg(w) = s22/t22.\n\
+  *\n\
+  *     Then the reciprocal condition number DIF(i) is bounded by\n\
+  *\n\
+  *         min( d1, max( 1, |real(s11)/real(s22)| )*d2 )\n\
+  *\n\
+  *     where, d1 = Difl((s11, t11), (s22, t22)) = sigma-min(Z1), where\n\
+  *     Z1 is the complex 2-by-2 matrix\n\
+  *\n\
+  *              Z1 =  [ s11  -s22 ]\n\
+  *                    [ t11  -t22 ],\n\
+  *\n\
+  *     This is done by computing (using real arithmetic) the\n\
+  *     roots of the characteristical polynomial det(Z1' * Z1 - lambda I),\n\
+  *     where Z1' denotes the conjugate transpose of Z1 and det(X) denotes\n\
+  *     the determinant of X.\n\
+  *\n\
+  *     and d2 is an upper bound on Difl((S11, T11), (S22, T22)), i.e. an\n\
+  *     upper bound on sigma-min(Z2), where Z2 is (2n-2)-by-(2n-2)\n\
+  *\n\
+  *              Z2 = [ kron(S11', In-2)  -kron(I2, S22) ]\n\
+  *                   [ kron(T11', In-2)  -kron(I2, T22) ]\n\
+  *\n\
+  *     Note that if the default method for computing DIF is wanted (see\n\
+  *     DLATDF), then the parameter DIFDRI (see below) should be changed\n\
+  *     from 3 to 4 (routine DLATDF(IJOB = 2 will be used)). See DTGSYL\n\
+  *     for more details.\n\
+  *\n\
+  *  For each eigenvalue/vector specified by SELECT, DIF stores a\n\
+  *  Frobenius norm-based estimate of Difl.\n\
+  *\n\
+  *  An approximate error bound for the i-th computed eigenvector VL(i) or\n\
+  *  VR(i) is given by\n\
+  *\n\
+  *             EPS * norm(A, B) / DIF(i).\n\
+  *\n\
+  *  See ref. [2-3] for more details and further references.\n\
+  *\n\
+  *  Based on contributions by\n\
+  *     Bo Kagstrom and Peter Poromaa, Department of Computing Science,\n\
+  *     Umea University, S-901 87 Umea, Sweden.\n\
+  *\n\
+  *  References\n\
+  *  ==========\n\
+  *\n\
+  *  [1] B. Kagstrom; A Direct Method for Reordering Eigenvalues in the\n\
+  *      Generalized Real Schur Form of a Regular Matrix Pair (A, B), in\n\
+  *      M.S. Moonen et al (eds), Linear Algebra for Large Scale and\n\
+  *      Real-Time Applications, Kluwer Academic Publ. 1993, pp 195-218.\n\
+  *\n\
+  *  [2] B. Kagstrom and P. Poromaa; Computing Eigenspaces with Specified\n\
+  *      Eigenvalues of a Regular Matrix Pair (A, B) and Condition\n\
+  *      Estimation: Theory, Algorithms and Software,\n\
+  *      Report UMINF - 94.04, Department of Computing Science, Umea\n\
+  *      University, S-901 87 Umea, Sweden, 1994. Also as LAPACK Working\n\
+  *      Note 87. To appear in Numerical Algorithms, 1996.\n\
+  *\n\
+  *  [3] B. Kagstrom and P. Poromaa, LAPACK-Style Algorithms and Software\n\
+  *      for Solving the Generalized Sylvester Equation and Estimating the\n\
+  *      Separation between Regular Matrix Pairs, Report UMINF - 93.23,\n\
+  *      Department of Computing Science, Umea University, S-901 87 Umea,\n\
+  *      Sweden, December 1993, Revised April 1994, Also as LAPACK Working\n\
+  *      Note 75.  To appear in ACM Trans. on Math. Software, Vol 22,\n\
+  *      No 1, 1996.\n\
+  *\n\
+  *  =====================================================================\n\
+  *\n"