NAME

ctrevc - compute some or all of the right and/or left eigenvectors of a complex upper triangular matrix T


SYNOPSIS

  SUBROUTINE CTREVC( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, 
 *      LDVR, MM, M, WORK, RWORK, INFO)
  CHARACTER * 1 SIDE, HOWMNY
  COMPLEX T(LDT,*), VL(LDVL,*), VR(LDVR,*), WORK(*)
  INTEGER N, LDT, LDVL, LDVR, MM, M, INFO
  LOGICAL SELECT(*)
  REAL RWORK(*)
  SUBROUTINE CTREVC_64( SIDE, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, 
 *      LDVR, MM, M, WORK, RWORK, INFO)
  CHARACTER * 1 SIDE, HOWMNY
  COMPLEX T(LDT,*), VL(LDVL,*), VR(LDVR,*), WORK(*)
  INTEGER*8 N, LDT, LDVL, LDVR, MM, M, INFO
  LOGICAL*8 SELECT(*)
  REAL RWORK(*)

F95 INTERFACE

  SUBROUTINE TREVC( SIDE, HOWMNY, SELECT, [N], T, [LDT], VL, [LDVL], 
 *       VR, [LDVR], MM, M, [WORK], [RWORK], [INFO])
  CHARACTER(LEN=1) :: SIDE, HOWMNY
  COMPLEX, DIMENSION(:) :: WORK
  COMPLEX, DIMENSION(:,:) :: T, VL, VR
  INTEGER :: N, LDT, LDVL, LDVR, MM, M, INFO
  LOGICAL, DIMENSION(:) :: SELECT
  REAL, DIMENSION(:) :: RWORK
  SUBROUTINE TREVC_64( SIDE, HOWMNY, SELECT, [N], T, [LDT], VL, [LDVL], 
 *       VR, [LDVR], MM, M, [WORK], [RWORK], [INFO])
  CHARACTER(LEN=1) :: SIDE, HOWMNY
  COMPLEX, DIMENSION(:) :: WORK
  COMPLEX, DIMENSION(:,:) :: T, VL, VR
  INTEGER(8) :: N, LDT, LDVL, LDVR, MM, M, INFO
  LOGICAL(8), DIMENSION(:) :: SELECT
  REAL, DIMENSION(:) :: RWORK

C INTERFACE

#include <sunperf.h>

void ctrevc(char side, char howmny, logical *select, int n, complex *t, int ldt, complex *vl, int ldvl, complex *vr, int ldvr, int mm, int *m, int *info);

void ctrevc_64(char side, char howmny, logical *select, long n, complex *t, long ldt, complex *vl, long ldvl, complex *vr, long ldvr, long mm, long *m, long *info);


PURPOSE

ctrevc computes some or all of the right and/or left eigenvectors of a complex upper triangular matrix T.

The right eigenvector x and the left eigenvector y of T corresponding to an eigenvalue w are defined by:

             T*x = w*x,     y'*T = w*y'

where y' denotes the conjugate transpose of the vector y.

If all eigenvectors are requested, the routine may either return the matrices X and/or Y of right or left eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an input unitary

matrix. If T was obtained from the Schur factorization of an original matrix A = Q*T*Q', then Q*X and Q*Y are the matrices of right or left eigenvectors of A.


ARGUMENTS


FURTHER DETAILS

The algorithm used in this program is basically backward (forward) substitution, with scaling to make the the code robust against possible overflow.

Each eigenvector is normalized so that the element of largest magnitude has magnitude 1; here the magnitude of a complex number (x,y) is taken to be |x| + |y|.