f08wvf (zggbal) : NAG Library, Mark 27

2 Specification

Fortran Interface

Subroutine f08wvf (

job, n, a, lda, b, ldb, ilo, ihi, lscale, rscale, work, info)

Integer, Intent (In)	::	n, lda, ldb
Integer, Intent (Out)	::	ilo, ihi, info
Real (Kind=nag_wp), Intent (Out)	::	lscale(n), rscale(n), work(6*n)
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), b(ldb,)
Character (1), Intent (In)	::	job

C Header Interface

#include <nag.h>

void	f08wvf_ (const char job, const Integer n, Complex a[], const Integer lda, Complex b[], const Integer ldb, Integer ilo, Integer ihi, double lscale[], double rscale[], double work[], Integer *info, const Charlen length_job)

The routine may be called by the names f08wvf, nagf_lapackeig_zggbal or its LAPACK name zggbal.

3 Description

Balancing may reduce the

1

-norm of the matrices and improve the accuracy of the computed eigenvalues and eigenvectors in the complex generalized eigenvalue problem

A x = λ B x .

f08wvf is usually the first step in the solution of the above generalized eigenvalue problem. Balancing is optional but it is highly recommended.

The term ‘balancing’ covers two steps, each of which involves similarity transformations on

A

and

B

. The routine can perform either or both of these steps. Both steps are optional.

1.The routine first attempts to permute $A$ and $B$ to block upper triangular form by a similarity transformation:
$P A P^{T} = F = (\begin{matrix} F_{11} & F_{12} & F_{13} \\ F_{22} & F_{23} \\ F_{33} \end{matrix})$

$P B P^{T} = G = (\begin{matrix} G_{11} & G_{12} & G_{13} \\ G_{22} & G_{23} \\ G_{33} \end{matrix})$
where $P$ is a permutation matrix, $F_{11}$ , $F_{33}$ , $G_{11}$ and $G_{33}$ are upper triangular. Then the diagonal elements of the matrix pairs $(F_{11}, G_{11})$ and $(F_{33}, G_{33})$ are generalized eigenvalues of $(A, B)$ . The rest of the generalized eigenvalues are given by the matrix pair $(F_{22}, G_{22})$ which are in rows and columns $i_{lo}$ to $i_{hi}$ . Subsequent operations to compute the generalized eigenvalues of $(A, B)$ need only be applied to the matrix pair $(F_{22}, G_{22})$ ; this can save a significant amount of work if $i_{lo} > 1$ and $i_{hi} < n$ . If no suitable permutation exists (as is often the case), the routine sets $i_{lo} = 1$ and $i_{hi} = n$ .
2.The routine applies a diagonal similarity transformation to $(F, G)$ , to make the rows and columns of $(F_{22}, G_{22})$ as close in norm as possible:
$D F \hat{D} = (\begin{matrix} I & 0 & 0 \\ 0 & D_{22} & 0 \\ 0 & 0 & I \end{matrix}) (\begin{matrix} F_{11} & F_{12} & F_{13} \\ F_{22} & F_{23} \\ F_{33} \end{matrix}) (\begin{matrix} I & 0 & 0 \\ 0 & {\hat{D}}_{22} & 0 \\ 0 & 0 & I \end{matrix})$

$D G D^{- 1} = (\begin{matrix} I & 0 & 0 \\ 0 & D_{22} & 0 \\ 0 & 0 & I \end{matrix}) (\begin{matrix} G_{11} & G_{12} & G_{13} \\ G_{22} & G_{23} \\ G_{33} \end{matrix}) (\begin{matrix} I & 0 & 0 \\ 0 & {\hat{D}}_{22} & 0 \\ 0 & 0 & I \end{matrix})$
This transformation usually improves the accuracy of computed generalized eigenvalues and eigenvectors.

5 Arguments

job

– Character(1) Input

On entry: specifies the operations to be performed on matrices

A

and

B

$job ='N'$: No balancing is done. Initialize $ilo = 1$ , $ihi = n$ , $lscale (i) = 1.0$ and $rscale (i) = 1.0$ , for $i = 1, 2, \dots, n$ .
$job ='P'$: Only permutations are used in balancing.
$job ='S'$: Only scalings are are used in balancing.
$job ='B'$: Both permutations and scalings are used in balancing.

Constraint:

job ='N'

'P'

'S'

'B'

n

– Integer Input

On entry:

n

, the order of the matrices

A

and

B

Constraint:

n \geq 0

a (lda *)

– Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

On entry: the

n

n

matrix

A

On exit: a is overwritten by the balanced matrix. If

job ='N'

, a is not referenced.

lda

– Integer Input

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

Constraint:

lda \geq \max (1, n)

b (ldb *)

– Complex (Kind=nag_wp) array Input/Output

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

\max (1, n)

On entry: the

n

n

matrix

B

On exit: b is overwritten by the balanced matrix. If

job ='N'

, b is not referenced.

ldb

– Integer Input

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

Constraint:

ldb \geq \max (1, n)

ilo

– Integer Output

ihi

– Integer Output

On exit:

i_{lo}

and

i_{hi}

are set such that

a (i, j) = 0

and

b (i, j) = 0

i > j

and

1 \leq j < i_{lo}

i_{hi} < i \leq n

job ='N'

'S'

i_{lo} = 1

and

i_{hi} = n

lscale (n)

– Real (Kind=nag_wp) array Output

On exit: details of the permutations and scaling factors applied to the left side of the matrices

A

and

B

. If

P_{i}

is the index of the row interchanged with row

i

and

d_{i}

is the scaling factor applied to row

i

, then

$lscale (i) = P_{i}$ , for $i = 1, 2, \dots, i_{lo} - 1$ ;
$lscale (i) = d_{i}$ , for $i = i_{lo}, \dots, i_{hi}$ ;
$lscale (i) = P_{i}$ , for $i = i_{hi} + 1, \dots, n$ .

The order in which the interchanges are made is

n

i_{hi} + 1

, then

1

i_{lo} - 1

10:

rscale (n)

– Real (Kind=nag_wp) array Output

On exit: details of the permutations and scaling factors applied to the right side of the matrices

A

and

B

P_{j}

is the index of the column interchanged with column

j

and

{\hat{d}}_{j}

is the scaling factor applied to column

j

, then

$rscale (j) = P_{j}$ , for $j = 1, 2, \dots, i_{lo} - 1$ ;
$rscale (j) = {\hat{d}}_{j}$ , for $j = i_{lo}, \dots, i_{hi}$ ;
$rscale (j) = P_{j}$ , for $j = i_{hi} + 1, \dots, n$ .

The order in which the interchanges are made is

n

i_{hi} + 1

, then

1

i_{lo} - 1

11:

work (6 \times n)

– Real (Kind=nag_wp) array Workspace

12:

info

– Integer Output

On exit:

info = 0

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

8 Parallelism and Performance

f08wvf 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

f08wvf is usually the first step in computing the complex generalized eigenvalue problem but it is an optional step. The matrix

B

is reduced to the triangular form using the

Q R

factorization routine f08asf and the unitary transformation

Q

is applied to the matrix

A

by calling f08auf. This is followed by f08wsf which reduces the matrix pair into the generalized Hessenberg form.

If the matrix pair

(A, B)

is balanced by this routine, then any generalized eigenvectors computed subsequently are eigenvectors of the balanced matrix pair. In that case, to compute the generalized eigenvectors of the original matrix, f08wwf must be called.

The total number of floating-point operations is approximately proportional to

n^{2}

The real analogue of this routine is f08whf.

NAG FL Interface
f08wvf (zggbal)

▸▿ 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

NAG FL Interfacef08wvf (zggbal)

▸▿ 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

NAG FL Interface
f08wvf (zggbal)