Lines Matching defs:program

321 \subsection{KLU Common object}
414 \subsection{KLU Symbolic object}
429 \subsection{KLU Numeric object}
437 \subsection{A sparse matrix in KLU}
485 \subsection{{\tt klu\_defaults}: set default parameters}
509 \subsection{{\tt klu\_analyze}: order and analyze a matrix}
538 \subsection{{\tt klu\_analyze\_given}: order and analyze a matrix}
566 \subsection{{\tt klu\_factor}: numerical factorization}
598 \subsection{{\tt klu\_solve}: solve a linear system}
634 \subsection{{\tt klu\_tsolve}: solve a transposed linear system}
667 \subsection{{\tt klu\_refactor}: numerical refactorization}
705 \subsection{{\tt klu\_free\_symbolic}: destroy the {\tt Symbolic} object}
729 \subsection{{\tt klu\_free\_numeric}: destroy the {\tt Numeric} object}
754 \subsection{{\tt klu\_sort}: sort the columns of L and U}
789 \subsection{{\tt klu\_flops}: determine the flop count}
819 \subsection{{\tt klu\_rgrowth}: determine the pivot growth}
860 \subsection{{\tt klu\_condest}: accurate condition number estimation}
895 \subsection{{\tt klu\_rcond}: cheap reciprocal condition number estimation}
929 \subsection{{\tt klu\_scale}: scale and check a sparse matrix}
972 \subsection{{\tt klu\_extract}: extract the LU factorization}
1022 \subsection{{\tt klu\_malloc}, {\tt klu\_free}, {\tt klu\_realloc}:
1063 \subsection{{\tt btf\_maxtrans}: maximum transversal}
1105 \subsection{{\tt btf\_strongcomp}: strongly connected components}
1131 \subsection{{\tt btf\_order}: permutation to block triangular form}
1161 \subsection{Sample C programs that use KLU}