Developer Reference

  • 2020.2
  • 07/15/2020
  • Public Content
Contents

?tgsy2

Solves the generalized Sylvester equation (unblocked algorithm).

Syntax

call stgsy2
(
trans
,
ijob
,
m
,
n
,
a
,
lda
,
b
,
ldb
,
c
,
ldc
,
d
,
ldd
,
e
,
lde
,
f
,
ldf
,
scale
,
rdsum
,
rdscal
,
iwork
,
pq
,
info
)
call dtgsy2
(
trans
,
ijob
,
m
,
n
,
a
,
lda
,
b
,
ldb
,
c
,
ldc
,
d
,
ldd
,
e
,
lde
,
f
,
ldf
,
scale
,
rdsum
,
rdscal
,
iwork
,
pq
,
info
)
call ctgsy2
(
trans
,
ijob
,
m
,
n
,
a
,
lda
,
b
,
ldb
,
c
,
ldc
,
d
,
ldd
,
e
,
lde
,
f
,
ldf
,
scale
,
rdsum
,
rdscal
,
iwork
,
pq
,
info
)
call ztgsy2
(
trans
,
ijob
,
m
,
n
,
a
,
lda
,
b
,
ldb
,
c
,
ldc
,
d
,
ldd
,
e
,
lde
,
f
,
ldf
,
scale
,
rdsum
,
rdscal
,
iwork
,
pq
,
info
)
Include Files
  • mkl.fi
Description
The routine
?tgsy2
solves the generalized Sylvester equation:
A
*
R
-
L
*
B
=
scale
*
C
                            (1)
D
*
R
-
L
*
E
=
scale
*
F
using Level 1 and 2 BLAS, where
R
and
L
are unknown
m
-by-
n
matrices, (
A
,
D
), (
B, E)
and (
C
,
F
) are given matrix pairs of size
m
-by -
m
,