1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
.TH CLATDF l "15 June 2000" "LAPACK version 3.0" ")"
.SH NAME
CLATDF - compute the contribution to the reciprocal Dif-estimate by solving for x in Z * x = b, where b is chosen such that the norm of x is as large as possible
.SH SYNOPSIS
.TP 19
SUBROUTINE CLATDF(
IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV,
JPIV )
.TP 19
.ti +4
INTEGER
IJOB, LDZ, N
.TP 19
.ti +4
REAL
RDSCAL, RDSUM
.TP 19
.ti +4
INTEGER
IPIV( * ), JPIV( * )
.TP 19
.ti +4
COMPLEX
RHS( * ), Z( LDZ, * )
.SH PURPOSE
CLATDF computes the contribution to the reciprocal Dif-estimate by solving for x in Z * x = b, where b is chosen such that the norm of x is as large as possible. It is assumed that LU decomposition of Z has been computed by CGETC2. On entry RHS = f holds the
contribution from earlier solved sub-systems, and on return RHS = x.
The factorization of Z returned by CGETC2 has the form
.br
Z = P * L * U * Q, where P and Q are permutation matrices. L is lower
triangular with unit diagonal elements and U is upper triangular.
.SH ARGUMENTS
.TP 8
IJOB (input) INTEGER
IJOB = 2: First compute an approximative null-vector e
of Z using CGECON, e is normalized and solve for
Zx = +-e - f with the sign giving the greater value of
2-norm(x). About 5 times as expensive as Default.
IJOB .ne. 2: Local look ahead strategy where
all entries of the r.h.s. b is choosen as either +1 or
-1. Default.
.TP 8
N (input) INTEGER
The number of columns of the matrix Z.
.TP 8
Z (input) REAL array, dimension (LDZ, N)
On entry, the LU part of the factorization of the n-by-n
matrix Z computed by CGETC2: Z = P * L * U * Q
.TP 8
LDZ (input) INTEGER
The leading dimension of the array Z. LDA >= max(1, N).
.TP 8
RHS (input/output) REAL array, dimension (N).
On entry, RHS contains contributions from other subsystems.
On exit, RHS contains the solution of the subsystem with
entries according to the value of IJOB (see above).
.TP 8
RDSUM (input/output) REAL
On entry, the sum of squares of computed contributions to
the Dif-estimate under computation by CTGSYL, where the
scaling factor RDSCAL (see below) has been factored out.
On exit, the corresponding sum of squares updated with the
contributions from the current sub-system.
If TRANS = 'T' RDSUM is not touched.
NOTE: RDSUM only makes sense when CTGSY2 is called by CTGSYL.
.TP 8
RDSCAL (input/output) REAL
On entry, scaling factor used to prevent overflow in RDSUM.
On exit, RDSCAL is updated w.r.t. the current contributions
in RDSUM.
If TRANS = 'T', RDSCAL is not touched.
NOTE: RDSCAL only makes sense when CTGSY2 is called by
CTGSYL.
.TP 8
IPIV (input) INTEGER array, dimension (N).
The pivot indices; for 1 <= i <= N, row i of the
matrix has been interchanged with row IPIV(i).
.TP 8
JPIV (input) INTEGER array, dimension (N).
The pivot indices; for 1 <= j <= N, column j of the
matrix has been interchanged with column JPIV(j).
.SH FURTHER DETAILS
Based on contributions by
.br
Bo Kagstrom and Peter Poromaa, Department of Computing Science,
Umea University, S-901 87 Umea, Sweden.
.br
This routine is a further developed implementation of algorithm
BSOLVE in [1] using complete pivoting in the LU factorization.
[1] Bo Kagstrom and Lars Westin,
.br
Generalized Schur Methods with Condition Estimators for
Solving the Generalized Sylvester Equation, IEEE Transactions
on Automatic Control, Vol. 34, No. 7, July 1989, pp 745-751.
[2] Peter Poromaa,
.br
On Efficient and Robust Estimators for the Separation
between two Regular Matrix Pairs with Applications in
Condition Estimation. Report UMINF-95.05, Department of
Computing Science, Umea University, S-901 87 Umea, Sweden,
1995.
.br
|
