HomeSort by relevance Sort by last modified time
    Searched refs:symbolic_factorization (Results 1 - 2 of 2) sorted by null

  /external/ceres-solver/internal/ceres/
cxsparse.cc 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 = local
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
    [all...]
cxsparse.h 59 // symbolic_factorization - The symbolic factorization of A. This is obtained
64 bool SolveCholesky(cs_di* A, cs_dis* symbolic_factorization, double* b);
119 void Free(cs_dis* symbolic_factorization);

Completed in 201 milliseconds