comparison src/DLD-FUNCTIONS/ccolamd.cc @ 5506:b4cfbb0ec8c4

[project @ 2005-10-23 19:09:32 by dbateman]
author dbateman
date Sun, 23 Oct 2005 19:09:33 +0000
parents ed08548b9054
children 2857357f9d3c
comparison
equal deleted inserted replaced
5505:17682e3fba2a 5506:b4cfbb0ec8c4
69 value of @code{[0 10 10 1 0]} if not present or empty. Entries not present\n\ 69 value of @code{[0 10 10 1 0]} if not present or empty. Entries not present\n\
70 are set to their defaults.\n\ 70 are set to their defaults.\n\
71 \n\ 71 \n\
72 @table @code\n\ 72 @table @code\n\
73 @item @var{knobs}(1)\n\ 73 @item @var{knobs}(1)\n\
74 if nonzero, the ordering is optimized for @code{lu(S(:,p)). It will be a\n\ 74 if nonzero, the ordering is optimized for @code{lu(S(:,p))}. It will be a\n\
75 poor ordering for @code{chol(@var{s}(:,@var{p})'*@var{s}(:,@var{p}))}. This\n\ 75 poor ordering for @code{chol(@var{s}(:,@var{p})'*@var{s}(:,@var{p}))}. This\n\
76 is the most important knob for ccolamd.\n\ 76 is the most important knob for ccolamd.\n\
77 \n\ 77 \n\
78 @item @var{knob}(2)\n\ 78 @item @var{knob}(2)\n\
79 if @var{s} is m-by-n, rows with more than @code{max(16,@var{knobs}(2)*\n\ 79 if @var{s} is m-by-n, rows with more than @code{max(16,@var{knobs}(2)*\n\
98 the output permutation @var{p}, all columns in set 1 appear first, followed\n\ 98 the output permutation @var{p}, all columns in set 1 appear first, followed\n\
99 by all columns in set 2, and so on. @code{@var{cmember} = ones(1,n)} if\n\ 99 by all columns in set 2, and so on. @code{@var{cmember} = ones(1,n)} if\n\
100 not present or empty. @code{ccolamd (@var{s},[],1:n)} returns @code{1:n}\n\ 100 not present or empty. @code{ccolamd (@var{s},[],1:n)} returns @code{1:n}\n\
101 \n\ 101 \n\
102 @code{@var{p} = ccolamd(@var{s})} is about the same as @code{@var{p} =\n\ 102 @code{@var{p} = ccolamd(@var{s})} is about the same as @code{@var{p} =\n\
103 colamd(@var{s}). @var{knobs} and its default values differ. @code{colamd}\n\ 103 colamd(@var{s})}. @var{knobs} and its default values differ. @code{colamd}\n\
104 always does aggressive absorption, and it finds an ordering suitable for\n\ 104 always does aggressive absorption, and it finds an ordering suitable for\n\
105 both @code{lu(@var{s}(:,@var{p}))} and @code{chol(@var{S}(:,@var{p})'*\n\ 105 both @code{lu(@var{s}(:,@var{p}))} and @code{chol(@var{S}(:,@var{p})'*\n\
106 @var{s}(:,@var{p}))}; it cannot optimize its ordering for @code{lu(@var{s}\n\ 106 @var{s}(:,@var{p}))}; it cannot optimize its ordering for @code{lu(@var{s}\n\
107 (:,@var{p}))} to the extent that @code{ccolamd(@var{s},1)} can.\n\ 107 (:,@var{p}))} to the extent that @code{ccolamd(@var{s},1)} can.\n\
108 \n\ 108 \n\