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
|
function test_qr
%TEST_QR test various QR factorization methods
%
% Example:
% test_qr
% See also: testall
% Copyright 2006-2007, Timothy A. Davis.
% http://www.cise.ufl.edu/research/sparse
index = UFget ;
[ignore f] = sort (max (index.nrows,index.ncols)) ;
% f = 276
% f = 706
f = f (1:100) ;
for i = f
% Prob = UFget (i,index)
Prob = UFget (i) ;
disp (Prob) ;
A = Prob.A ;
[m n] = size (A) ;
if (m < n)
A = A' ;
end
[m n] = size (A) ;
if (sprank (A) < n | ~isreal (A)) %#ok
continue ;
end
[V,beta,p,R1,q] = cs_qr(A) ;
A = A (p,q) ;
parent = etree (A, 'col') ; %#ok
R0 = qr (A) ;
R2 = qr_givens (full (A)) ;
R3 = qr_givens_full (full (A)) ;
subplot (2,2,1) ; cspy (R0) ; title ('matlab') ;
subplot (2,2,2) ; cspy (R3) ; title ('qr-full') ;
subplot (2,2,3) ; cspy (R2) ; title ('qr-givens') ;
subplot (2,2,4) ; cspy (R1) ; title ('cs-qr') ;
e0 = norm (A'*A-R0'*R0,1) / norm (A,1) ;
e1 = norm (A'*A-R1'*R1,1) / norm (A,1) ;
e2 = norm (A'*A-R2'*R2,1) / norm (A,1) ;
e3 = norm (A'*A-R3'*R3,1) / norm (A,1) ;
fprintf ('error %6.2e %6.2e %6.2e %6.2e\n', e0, e1, e2, e3) ;
drawnow
if (e1 > e0*1e3 | e2 > e0*1e3) %#ok
pause
end
end
|
