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
|
.TH CLAIC1 l "15 June 2000" "LAPACK version 3.0" ")"
.SH NAME
CLAIC1 - applie one step of incremental condition estimation in its simplest version
.SH SYNOPSIS
.TP 19
SUBROUTINE CLAIC1(
JOB, J, X, SEST, W, GAMMA, SESTPR, S, C )
.TP 19
.ti +4
INTEGER
J, JOB
.TP 19
.ti +4
REAL
SEST, SESTPR
.TP 19
.ti +4
COMPLEX
C, GAMMA, S
.TP 19
.ti +4
COMPLEX
W( J ), X( J )
.SH PURPOSE
CLAIC1 applies one step of incremental condition estimation in its simplest version:
Let x, twonorm(x) = 1, be an approximate singular vector of an j-by-j
lower triangular matrix L, such that
.br
twonorm(L*x) = sest
.br
Then CLAIC1 computes sestpr, s, c such that
.br
the vector
.br
[ s*x ]
.br
xhat = [ c ]
.br
is an approximate singular vector of
.br
[ L 0 ]
.br
Lhat = [ w' gamma ]
.br
in the sense that
.br
twonorm(Lhat*xhat) = sestpr.
.br
Depending on JOB, an estimate for the largest or smallest singular
value is computed.
.br
Note that [s c]' and sestpr**2 is an eigenpair of the system
diag(sest*sest, 0) + [alpha gamma] * [ conjg(alpha) ]
[ conjg(gamma) ]
where alpha = conjg(x)'*w.
.br
.SH ARGUMENTS
.TP 8
JOB (input) INTEGER
= 1: an estimate for the largest singular value is computed.
.br
= 2: an estimate for the smallest singular value is computed.
.TP 8
J (input) INTEGER
Length of X and W
.TP 8
X (input) COMPLEX array, dimension (J)
The j-vector x.
.TP 8
SEST (input) REAL
Estimated singular value of j by j matrix L
.TP 8
W (input) COMPLEX array, dimension (J)
The j-vector w.
.TP 8
GAMMA (input) COMPLEX
The diagonal element gamma.
.TP 8
SESTPR (output) REAL
Estimated singular value of (j+1) by (j+1) matrix Lhat.
.TP 8
S (output) COMPLEX
Sine needed in forming xhat.
.TP 8
C (output) COMPLEX
Cosine needed in forming xhat.
|
