Searched defs:Aj (Results 1 - 3 of 3) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | symmetric_linear_solver_test.cc | 92 int* Aj = A->mutable_cols(); local 98 Aj[counter] = j;
|
H A D | linear_least_squares_problems.cc | 94 int* Aj = A->mutable_cols(); local 101 Aj[counter]=j;
|
/external/eigen/bench/ |
H A D | sparse_setter.cpp | 324 //write Aj,Ax into Bj,Bx 353 I Aj[], 365 temp.push_back(std::make_pair(Aj[jj],Ax[jj])); 371 Aj[jj] = temp[n].first; 381 I Aj[], 390 I j = Aj[jj]; 393 while( jj < row_end && Aj[jj] == j ){ 397 Aj[nnz] = j; 351 csr_sort_indices(const I n_row, const I Ap[], I Aj[], T Ax[]) argument 378 csr_sum_duplicates(const I n_row, const I n_col, I Ap[], I Aj[], T Ax[]) argument
|
Completed in 2881 milliseconds