NAG Library Routine Document

f08qtf  (ztrexc)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

f08qtf (ztrexc) reorders the Schur factorization of a complex general matrix.

2
Specification

Fortran Interface
Subroutine f08qtf ( compq, n, t, ldt, q, ldq, ifst, ilst, info)
Integer, Intent (In):: n, ldt, ldq, ifst, ilst
Integer, Intent (Out):: info
Complex (Kind=nag_wp), Intent (Inout):: t(ldt,*), q(ldq,*)
Character (1), Intent (In):: compq
C Header Interface
#include nagmk26.h
void  f08qtf_ ( const char *compq, const Integer *n, Complex t[], const Integer *ldt, Complex q[], const Integer *ldq, const Integer *ifst, const Integer *ilst, Integer *info, const Charlen length_compq)
The routine may be called by its LAPACK name ztrexc.

3
Description

f08qtf (ztrexc) reorders the Schur factorization of a complex general matrix A=QTQH, so that the diagonal element of T with row index ifst is moved to row ilst.
The reordered Schur form T~ is computed by a unitary similarity transformation: T~=ZHTZ. Optionally the updated matrix Q~ of Schur vectors is computed as Q~=QZ, giving A=Q~T~Q~H.

4
References

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

5
Arguments

1:     compq – Character(1)Input
On entry: indicates whether the matrix Q of Schur vectors is to be updated.
compq='V'
The matrix Q of Schur vectors is updated.
compq='N'
No Schur vectors are updated.
Constraint: compq='V' or 'N'.
2:     n – IntegerInput
On entry: n, the order of the matrix T.
Constraint: n0.
3:     tldt* – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array t must be at least max1,n.
On entry: the n by n upper triangular matrix T, as returned by f08psf (zhseqr).
On exit: t is overwritten by the updated matrix T~.
4:     ldt – IntegerInput
On entry: the first dimension of the array t as declared in the (sub)program from which f08qtf (ztrexc) is called.
Constraint: ldt max1,n .
5:     qldq* – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array q must be at least max1,n if compq='V' and at least 1 if compq='N'.
On entry: if compq='V', q must contain the n by n unitary matrix Q of Schur vectors.
On exit: if compq='V', q contains the updated matrix of Schur vectors.
If compq='N', q is not referenced.
6:     ldq – IntegerInput
On entry: the first dimension of the array q as declared in the (sub)program from which f08qtf (ztrexc) is called.
Constraints:
  • if compq='V', ldq max1,n ;
  • if compq='N', ldq1.
7:     ifst – IntegerInput
8:     ilst – IntegerInput
On entry: ifst and ilst must specify the reordering of the diagonal elements of T. The element with row index ifst is moved to row ilst by a sequence of exchanges between adjacent elements.
Constraint: 1ifstn and 1ilstn.
9:     info – IntegerOutput
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.

7
Accuracy

The computed matrix T~ is exactly similar to a matrix T+E, where
E2 = Oε T2 ,  
and ε is the machine precision.
The values of the eigenvalues are never changed by the reordering.

8
Parallelism and Performance

f08qtf (ztrexc) 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 20nr if compq='N', and 40nr if compq='V', where r=ifst-ilst.
The real analogue of this routine is f08qff (dtrexc).

10
Example

This example reorders the Schur factorization of the matrix T so that element t11 is moved to t44, where
T = -6.00-7.00i 0.36-0.36i -0.19+0.48i 0.88-0.25i 0.00+0.00i -5.00+2.00i -0.03-0.72i -0.23+0.13i 0.00+0.00i 0.00+0.00i 8.00-1.00i 0.94+0.53i 0.00+0.00i 0.00+0.00i 0.00+0.00i 3.00-4.00i .  

10.1
Program Text

Program Text (f08qtfe.f90)

10.2
Program Data

Program Data (f08qtfe.d)

10.3
Program Results

Program Results (f08qtfe.r)

© The Numerical Algorithms Group Ltd, Oxford, UK. 2017