Home
last modified time | relevance | path

Searched refs:symbolic_factorization (Results 1 – 2 of 2) sorted by relevance

/external/ceres-solver/internal/ceres/
Dcxsparse.cc59 cs_dis* symbolic_factorization, in SolveCholesky() argument
72 csn* numeric_factorization = cs_di_chol(A, symbolic_factorization); in SolveCholesky()
83 cs_di_ipvec(symbolic_factorization->pinv, b, scratch_, A->n); in SolveCholesky()
89 cs_di_pvec(symbolic_factorization->pinv, scratch_, b, A->n); in SolveCholesky()
137 cs_dis* symbolic_factorization = in BlockAnalyzeCholesky() local
139 symbolic_factorization->pinv = cs_pinv(&scalar_ordering[0], A->n); in BlockAnalyzeCholesky()
140 cs* permuted_A = cs_symperm(A, symbolic_factorization->pinv, 0); in BlockAnalyzeCholesky()
142 symbolic_factorization->parent = cs_etree(permuted_A, 0); in BlockAnalyzeCholesky()
143 int* postordering = cs_post(symbolic_factorization->parent, A->n); in BlockAnalyzeCholesky()
145 symbolic_factorization->parent, in BlockAnalyzeCholesky()
[all …]
Dcxsparse.h64 bool SolveCholesky(cs_di* A, cs_dis* symbolic_factorization, double* b);
119 void Free(cs_dis* symbolic_factorization);