Integer, Intent (In)	::	isgn, m, n, lda, ldb, ldc
Integer, Intent (Out)	::	info
Real (Kind=nag_wp), Intent (Out)	::	scal
Complex (Kind=nag_wp), Intent (In)	::	a(lda,), b(ldb,)
Complex (Kind=nag_wp), Intent (Inout)	::	c(ldc,*)
Character (1), Intent (In)	::	trana, tranb

C Header Interface

#include <nag.h>

void	f08qvf_ (const char trana, const char tranb, const Integer isgn, const Integer m, const Integer n, const Complex a[], const Integer lda, const Complex b[], const Integer ldb, Complex c[], const Integer ldc, double scal, Integer info, const Charlen length_trana, const Charlen length_tranb)

The routine may be called by the names f08qvf, nagf_lapackeig_ztrsyl or its LAPACK name ztrsyl.

3 Description

f08qvf solves the complex Sylvester matrix equation

op (A) X \pm X op (B) = α C,

where

op (A) = A

A^{H}

, and the matrices

A

and

B

are upper triangular;

α

is a scale factor (

\leq 1

) determined by the routine to avoid overflow in

X

;

A

m \times m

and

B

n \times n

while the right-hand side matrix

C

and the solution matrix

X

are both

m \times n

. The matrix

X

is obtained by a straightforward process of back-substitution (see Golub and Van Loan (1996)).

Note that the equation has a unique solution if and only if

α_{i} \pm β_{j} \neq 0

, where

{α_{i}}

and

{β_{j}}

are the eigenvalues of

A

and

B

respectively and the sign (

+

-

) is the same as that used in the equation to be solved.

4 References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Higham N J (1992) Perturbation theory and backward error for

A X - X B = C

Numerical Analysis Report University of Manchester

5 Arguments

1: $trana$ – Character(1) Input

On entry: specifies the option

op (A)

$trana ='N'$: $op (A) = A$ .
$trana ='C'$: $op (A) = A^{H}$ .

Constraint:

trana ='N'

'C'

2: $tranb$ – Character(1) Input

On entry: specifies the option

op (B)

$tranb ='N'$: $op (B) = B$ .
$tranb ='C'$: $op (B) = B^{H}$ .

Constraint:

tranb ='N'

'C'

3: $isgn$ – Integer Input

On entry: indicates the form of the Sylvester equation.

$isgn = + 1$: The equation is of the form $op (A) X + X op (B) = α C$ .
$isgn = −1$: The equation is of the form $op (A) X - X op (B) = α C$ .

Constraint:

isgn = + 1

−1

4: $m$ – Integer Input

On entry:

m

, the order of the matrix

A

, and the number of rows in the matrices

X

and

C

Constraint:

m \geq 0

5: $n$ – Integer Input

On entry:

n

, the order of the matrix

B

, and the number of columns in the matrices

X

and

C

Constraint:

n \geq 0

6: $a (lda, *)$ – Complex (Kind=nag_wp) array Input

Note: the second dimension of the array a must be at least

\max (1, m)

On entry: the

m \times m

upper triangular matrix

A

7: $lda$ – Integer Input

On entry: the first dimension of the array a as declared in the (sub)program from which f08qvf is called.

Constraint:

lda \geq \max (1, m)

8: $b (ldb, *)$ – Complex (Kind=nag_wp) array Input

Note: the second dimension of the array b must be at least

\max (1, n)

On entry: the

n \times n

upper triangular matrix

B

9: $ldb$ – Integer Input

On entry: the first dimension of the array b as declared in the (sub)program from which f08qvf is called.

Constraint:

ldb \geq \max (1, n)

10: $c (ldc, *)$ – Complex (Kind=nag_wp) array Input/Output

Note: the second dimension of the array c must be at least

\max (1, n)

On entry: the

m \times n

right-hand side matrix

C

On exit: c is overwritten by the solution matrix

X

11: $ldc$ – Integer Input

On entry: the first dimension of the array c as declared in the (sub)program from which f08qvf is called.

Constraint:

ldc \geq \max (1, m)

12: $scal$ – Real (Kind=nag_wp) Output

On exit: the value of the scale factor

α

13: $info$ – Integer Output

On exit:

info = 0

unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

$info < 0$: If $info = - i$ , argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

$info = 1$: $A$ and $B$ have common or close eigenvalues, perturbed values of which were used to solve the equation.

7 Accuracy

Consider the equation

A X - X B = C

. (To apply the remarks to the equation

A X + X B = C

, simply replace

B

- B

Let

\tilde{X}

be the computed solution and

R

the residual matrix:

R = C - (A \tilde{X} - \tilde{X} B) .

Then the residual is always small:

{‖ R ‖}_{F} = O (ε) ({‖ A ‖}_{F} + {‖ B ‖}_{F}) {‖ \tilde{X} ‖}_{F} .

However,

\tilde{X}

is not necessarily the exact solution of a slightly perturbed equation; in other words, the solution is not backwards stable.

For the forward error, the following bound holds:

{‖ \tilde{X} - X ‖}_{F} \leq \frac{{‖ R ‖}_{F}}{sep (A, B)}

but this may be a considerable over estimate. See Golub and Van Loan (1996) for a definition of

sep (A, B)

, and Higham (1992) for further details.

These remarks also apply to the solution of a general Sylvester equation, as described in Section 9.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

f08qvf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of real floating-point operations is approximately

4 m n (m + n)

To solve the general complex Sylvester equation

A X \pm X B = C

where

A

and

B

are general matrices,

A

and

B

must first be reduced to Schur form (by calling f08pnf, for example):

A = Q_{1} \tilde{A} Q_{1}^{H} and B = Q_{2} \tilde{B} Q_{2}^{H}

where

\tilde{A}

and

\tilde{B}

are upper triangular and

Q_{1}

and

Q_{2}

are unitary. The original equation may then be transformed to:

\tilde{A} \tilde{X} \pm \tilde{X} \tilde{B} = \tilde{C}

where

\tilde{X} = Q_{1}^{H} X Q_{2}

and

\tilde{C} = Q_{1}^{H} C Q_{2}

\tilde{C}

may be computed by matrix multiplication; f08qvf may be used to solve the transformed equation; and the solution to the original equation can be obtained as

X = Q_{1} \tilde{X} Q_{2}^{H}

The real analogue of this routine is f08qhf.

10 Example

This example solves the Sylvester equation

A X + X B = C

, where

A = (\begin{array}{r} - 6.00 - 7.00 i & 0.36 - 0.36 i & - 0.19 + 0.48 i & 0.88 - 0.25 i \\ 0.00 + 0.00 i & - 5.00 + 2.00 i & - 0.03 - 0.72 i & - 0.23 + 0.13 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & 8.00 - 1.00 i & 0.94 + 0.53 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & 0.00 + 0.00 i & 3.00 - 4.00 i \end{array}),

B = (\begin{array}{r} 0.50 - 0.20 i & - 0.29 - 0.16 i & - 0.37 + 0.84 i & - 0.55 + 0.73 i \\ 0.00 + 0.00 i & - 0.40 + 0.90 i & 0.06 + 0.22 i & - 0.43 + 0.17 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & - 0.90 - 0.10 i & - 0.89 - 0.42 i \\ 0.00 + 0.00 i & 0.00 + 0.00 i & 0.00 + 0.00 i & 0.30 - 0.70 i \end{array})

and

C = (\begin{array}{r} 0.63 + 0.35 i & 0.45 - 0.56 i & 0.08 - 0.14 i & - 0.17 - 0.23 i \\ - 0.17 + 0.09 i & - 0.07 - 0.31 i & 0.27 - 0.54 i & 0.35 + 1.21 i \\ - 0.93 - 0.44 i & - 0.33 - 0.35 i & 0.41 - 0.03 i & 0.57 + 0.84 i \\ 0.54 + 0.25 i & - 0.62 - 0.05 i & - 0.52 - 0.13 i & 0.11 - 0.08 i \end{array}) .

f08qv: FL CL CPP AD PY MB

NAG FL Interfacef08qvf (ztrsyl)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
f08qvf (ztrsyl)