1function [L,p] = cs_chol (A,drop) %#ok 2%CS_CHOL sparse Cholesky factorization. 3% L = cs_chol(A) is the same as L = chol(A)', using triu(A). 4% [L,p] = cs_chol(A) first orders A with p=cs_amd(A), so that L*L' = A(p,p). 5% A second optional input argument controls whether or not numerically zero 6% entries are removed from L. cs_chol(A) and cs_chol(A,1) drop them; 7% cs_chol(A,0) keeps them. They must be kept for cs_updown to work properly. 8% 9% Example: 10% Prob = ssget ('HB/bcsstk01') ; A = Prob.A ; [L,p] = cs_chol (A) ; 11% cspy (A (p,p)) ; 12% cspy (L) ; 13% 14% See also CS_AMD, CS_UPDOWN, CHOL, AMD, SYMAMD. 15 16% Copyright 2006-2012, Timothy A. Davis, http://www.suitesparse.com 17 18error ('cs_chol mexFunction not found') ; 19