1ZLATDF(1)           LAPACK auxiliary routine (version 3.2)           ZLATDF(1)
2
3
4

NAME

6       ZLATDF  -  computes  the contribution to the reciprocal Dif-estimate by
7       solving for x in Z * x = b, where b is chosen such that the norm  of  x
8       is as large as possible
9

SYNOPSIS

11       SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, JPIV )
12
13           INTEGER        IJOB, LDZ, N
14
15           DOUBLE         PRECISION RDSCAL, RDSUM
16
17           INTEGER        IPIV( * ), JPIV( * )
18
19           COMPLEX*16     RHS( * ), Z( LDZ, * )
20

PURPOSE

22       ZLATDF  computes  the  contribution  to  the reciprocal Dif-estimate by
23       solving for x in Z * x = b, where b is chosen such that the norm  of  x
24       is  as  large as possible. It is assumed that LU decomposition of Z has
25       been computed by ZGETC2. On entry RHS = f holds the  contribution  from
26       earlier  solved  sub-systems, and on return RHS = x.  The factorization
27       of Z returned by ZGETC2 has the form
28       Z = P * L * U * Q, where P and Q are permutation matrices. L  is  lower
29       triangular with unit diagonal elements and U is upper triangular.
30

ARGUMENTS

32       IJOB    (input) INTEGER
33               IJOB  =  2:  First  compute an approximative null-vector e of Z
34               using ZGECON, e is normalized and solve for Zx = +-e -  f  with
35               the  sign giving the greater value of 2-norm(x).  About 5 times
36               as expensive as Default.  IJOB .ne. 2: Local look ahead  stratā€
37               egy  where  all entries of the r.h.s. b is choosen as either +1
38               or -1.  Default.
39
40       N       (input) INTEGER
41               The number of columns of the matrix Z.
42
43       Z       (input) DOUBLE PRECISION array, dimension (LDZ, N)
44               On entry, the LU part of the factorization of the n-by-n matrix
45               Z computed by ZGETC2:  Z = P * L * U * Q
46
47       LDZ     (input) INTEGER
48               The leading dimension of the array Z.  LDA >= max(1, N).
49
50       RHS     (input/output) DOUBLE PRECISION array, dimension (N).
51               On entry, RHS contains contributions from other subsystems.  On
52               exit, RHS contains the solution of the subsystem  with  entries
53               according to the value of IJOB (see above).
54
55       RDSUM   (input/output) DOUBLE PRECISION
56               On  entry,  the sum of squares of computed contributions to the
57               Dif-estimate under computation by  ZTGSYL,  where  the  scaling
58               factor  RDSCAL (see below) has been factored out.  On exit, the
59               corresponding sum of squares  updated  with  the  contributions
60               from  the  current  sub-system.   If  TRANS  = 'T' RDSUM is not
61               touched.  NOTE: RDSUM only makes sense when ZTGSY2 is called by
62               CTGSYL.
63
64       RDSCAL  (input/output) DOUBLE PRECISION
65               On entry, scaling factor used to prevent overflow in RDSUM.  On
66               exit, RDSCAL is updated w.r.t.  the  current  contributions  in
67               RDSUM.   If  TRANS  = 'T', RDSCAL is not touched.  NOTE: RDSCAL
68               only makes sense when ZTGSY2 is called by ZTGSYL.
69
70       IPIV    (input) INTEGER array, dimension (N).
71               The pivot indices; for 1 <= i <= N, row i  of  the  matrix  has
72               been interchanged with row IPIV(i).
73
74       JPIV    (input) INTEGER array, dimension (N).
75               The  pivot indices; for 1 <= j <= N, column j of the matrix has
76               been interchanged with column JPIV(j).
77

FURTHER DETAILS

79       Based on contributions by
80          Bo Kagstrom and Peter Poromaa, Department of Computing Science,
81          Umea University, S-901 87 Umea, Sweden.
82       This routine is a further developed implementation of algorithm  BSOLVE
83       in [1] using complete pivoting in the LU factorization.
84        [1]   Bo Kagstrom and Lars Westin,
85              Generalized Schur Methods with Condition Estimators for
86              Solving the Generalized Sylvester Equation, IEEE Transactions
87              on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.
88        [2]   Peter Poromaa,
89              On Efficient and Robust Estimators for the Separation
90              between two Regular Matrix Pairs with Applications in
91              Condition Estimation. Report UMINF-95.05, Department of
92              Computing Science, Umea University, S-901 87 Umea, Sweden,
93              1995.
94
95
96
97 LAPACK auxiliary routine (versionNo3v.e2m)ber 2008                       ZLATDF(1)
Impressum