File: gee_its_simple_forwardsolve.m

package info (click to toggle)
suitesparse 1%3A5.8.1%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 152,716 kB
  • sloc: ansic: 774,385; cpp: 24,213; makefile: 6,310; fortran: 1,927; java: 1,826; csh: 1,686; ruby: 725; sh: 535; perl: 225; python: 209; sed: 164; awk: 60
file content (38 lines) | stat: -rw-r--r-- 1,333 bytes parent folder | download | duplicates (5)
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
function b = gee_its_simple_forwardsolve (L, b)
%GEE_ITS_SIMPLE_FORWARDSOLVE computes x=L\b where L is unit lower triangular
% Perform forward substitution to solve x=L\b.  L must be square.  The diagonal
% and upper triangular part of L is ignored (this allows L and U to be packed
% into a single matrix).
%
% Example:
%
%   x = gee_its_simple_forwardsolve (L,b) ;
%
%   % which is the same as:
%   L2 = tril (L,-1) + eye (size (L,1)) ;
%   x = L2\b ;
%
% See also: mldivide, gee_its_simple, gee_its_short, gee_its_simple_backsolve

% Copyright 2007, Timothy A. Davis, http://www.suitesparse.com

%-------------------------------------------------------------------------------
% check inputs
%-------------------------------------------------------------------------------

if (nargin ~= 2 | nargout > 1)                                              %#ok
    error ('Usage: x = ge_its_simple_forwardsolve (L,b)') ;
end

% ensure L is square, and that L and b have the same number of rows
gee_its_simple_check (L, 'L', b) ;

%-------------------------------------------------------------------------------
% forward solve, overwriting b with the solution L\b
%-------------------------------------------------------------------------------

n = size (L,1) ;
for k = 1:n
    b (k+1:n,:) = b (k+1:n,:) - L (k+1:n,k) * b (k,:) ;
end