strsyl - solve the real Sylvester matrix equation
SUBROUTINE STRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, LDC, * SCALE, INFO) CHARACTER * 1 TRANA, TRANB INTEGER ISGN, M, N, LDA, LDB, LDC, INFO REAL SCALE REAL A(LDA,*), B(LDB,*), C(LDC,*)
SUBROUTINE STRSYL_64( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, * LDC, SCALE, INFO) CHARACTER * 1 TRANA, TRANB INTEGER*8 ISGN, M, N, LDA, LDB, LDC, INFO REAL SCALE REAL A(LDA,*), B(LDB,*), C(LDC,*)
SUBROUTINE TRSYL( TRANA, TRANB, ISGN, [M], [N], A, [LDA], B, [LDB], * C, [LDC], SCALE, [INFO]) CHARACTER(LEN=1) :: TRANA, TRANB INTEGER :: ISGN, M, N, LDA, LDB, LDC, INFO REAL :: SCALE REAL, DIMENSION(:,:) :: A, B, C
SUBROUTINE TRSYL_64( TRANA, TRANB, ISGN, [M], [N], A, [LDA], B, [LDB], * C, [LDC], SCALE, [INFO]) CHARACTER(LEN=1) :: TRANA, TRANB INTEGER(8) :: ISGN, M, N, LDA, LDB, LDC, INFO REAL :: SCALE REAL, DIMENSION(:,:) :: A, B, C
#include <sunperf.h>
void strsyl(char trana, char tranb, int isgn, int m, int n, float *a, int lda, float *b, int ldb, float *c, int ldc, float *scale, int *info);
void strsyl_64(char trana, char tranb, long isgn, long m, long n, float *a, long lda, float *b, long ldb, float *c, long ldc, float *scale, long *info);
strsyl solves the real Sylvester matrix equation:
op(A)*X + X*op(B) = scale*C or
op(A)*X - X*op(B) = scale*C,
where op(A)
= A or A**T, and A and B are both upper quasi-
triangular. A is M-by-M and B is N-by-N; the right hand side C and
the solution X are M-by-N; and scale is an output scale factor, set
<= 1 to avoid overflow in X.
A and B must be in Schur canonical form (as returned by SHSEQR), that is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block has its diagonal elements equal and its off-diagonal elements of opposite sign.
= 'N': op(A) = A (No transpose)
= 'T': op(A) = A**T (Transpose)
= 'C': op(A) = A**H (Conjugate transpose = Transpose)
= 'N': op(B) = B (No transpose)
= 'T': op(B) = B**T (Transpose)
= 'C': op(B) = B**H (Conjugate transpose = Transpose)
= +1: solve op(A)*X + X*op(B) = scale*C
= -1: solve op(A)*X - X*op(B) = scale*C
max(1,M)
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
= 1: A and B have common or very close eigenvalues; perturbed values were used to solve the equation (but the matrices A and B are unchanged).