File: cs_lsolve.m

package info (click to toggle)
suitesparse 1%3A5.12.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 176,720 kB
  • sloc: ansic: 1,193,914; cpp: 31,704; makefile: 6,638; fortran: 1,927; java: 1,826; csh: 765; ruby: 725; sh: 529; python: 333; perl: 225; sed: 164; awk: 35
file content (16 lines) | stat: -rw-r--r-- 736 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
function x = cs_lsolve (L,b)                                                %#ok
%CS_LSOLVE solve a sparse lower triangular system L*x=b.
%   x = cs_lsolve(L,b) computes x = L\b, L must be lower triangular with a
%   zero-free diagonal.  b must be a column vector.  x is full if b is full.
%   If b is sparse, x is sparse but the nonzero pattern of x is NOT sorted (it
%   is returned in topological order).
%
%   Example:
%       Prob = ssget ('HB/bcsstk01') ; L = cs_chol (Prob.A) ; n = size (L,1) ;
%       b = rand (n,1) ; x = cs_lsolve (L,b) ; norm (L*x-b)
%
%   See also CS_LTSOLVE, CS_USOLVE, CS_UTSOLVE, MLDIVIDE.

% Copyright 2006-2012, Timothy A. Davis, http://www.suitesparse.com

error ('cs_lsolve mexFunction not found') ;