File: cholupdown.m

package info (click to toggle)
suitesparse-metis 3.1.0-2
  • links: PTS, VCS
  • area: contrib
  • in suites: jessie, jessie-kfreebsd, wheezy
  • size: 36,560 kB
  • ctags: 7,484
  • sloc: ansic: 104,515; makefile: 5,984; fortran: 4,591; sh: 1,397; csh: 739; ruby: 603; perl: 219; sed: 164; awk: 18
file content (58 lines) | stat: -rw-r--r-- 1,140 bytes parent folder | download | duplicates (3)
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
function L = cholupdown (Lold, sigma, w)
%CHOLUPDOWN Cholesky update/downdate (Bischof, Pan, and Tang method)
% Example:
%   L = cholupdown (Lold, sigma, w)
% See also: cs_demo

%   Copyright 2006-2007, Timothy A. Davis.
%   http://www.cise.ufl.edu/research/sparse


beta = 1 ;
n = size (Lold,1) ;
L = Lold ;
% x = weros (n,1) ;
worig = w ;

for k = 1:n

    alpha = w(k) / L(k,k) ;
    beta_new = sqrt (beta^2 + sigma*alpha^2) ;
    gamma = alpha / (beta_new * beta) ;

    if (sigma < 0)

	% downdate
	bratio = beta_new / beta ;
	w (k+1:n) = w (k+1:n) - alpha * L (k+1:n,k) ;
	L (k,k) = bratio * L (k,k) ;
	L (k+1:n,k) = bratio * L (k+1:n,k) - gamma*w(k+1:n) ;

    else

	% update
	bratio = beta / beta_new ;

%	wold = w (k+1:n) ;
%	w (k+1:n) = w (k+1:n) - alpha * L (k+1:n,k) ;
%	L (k    ,k) = bratio * L (k    ,k) + gamma*w(k) ;
%	L (k+1:n,k) = bratio * L (k+1:n,k) + gamma*wold ;

	L (k,k) = bratio * L (k,k) + gamma*w(k) ;
	for i = k+1:n 

	    wold = w (i) ;
	    w (i) = w (i) - alpha * L (i,k) ;
	    L (i,k) = bratio * L (i,k) + gamma*wold ;

	end

    end

    w (k) = alpha ;

    beta = beta_new ;

end

norm (w-(Lold\worig))