Home | History | Annotate | Download | only in ceres

Lines Matching full:symbolic_factorization

59                              cs_dis* symbolic_factorization,
72 csn* numeric_factorization = cs_di_chol(A, symbolic_factorization);
83 cs_di_ipvec(symbolic_factorization->pinv, b, scratch_, A->n);
89 cs_di_pvec(symbolic_factorization->pinv, scratch_, b, A->n);
137 cs_dis* symbolic_factorization =
139 symbolic_factorization->pinv = cs_pinv(&scalar_ordering[0], A->n);
140 cs* permuted_A = cs_symperm(A, symbolic_factorization->pinv, 0);
142 symbolic_factorization->parent = cs_etree(permuted_A, 0);
143 int* postordering = cs_post(symbolic_factorization->parent, A->n);
145 symbolic_factorization->parent,
151 symbolic_factorization->cp = (int*) cs_malloc(A->n+1, sizeof(int));
152 symbolic_factorization->lnz = cs_cumsum(symbolic_factorization->cp,
155 symbolic_factorization->unz = symbolic_factorization->lnz;
159 if (symbolic_factorization->lnz < 0) {
160 cs_sfree(symbolic_factorization);
161 symbolic_factorization = NULL;
164 return symbolic_factorization;
210 void CXSparse::Free(cs_dis* symbolic_factorization) {
211 cs_di_sfree(symbolic_factorization);