Searched refs:nnz (Results 1 - 15 of 15) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dlinear_least_squares_problems.cc196 int nnz = 0; local
200 rows[nnz] = 0;
201 cols[nnz] = 0;
202 values[nnz++] = 1;
204 rows[nnz] = 0;
205 cols[nnz] = 2;
206 values[nnz++] = 2;
211 rows[nnz] = 1;
212 cols[nnz] = 0;
213 values[nnz
304 int nnz = 0; local
438 int nnz = 0; local
[all...]
H A Dsuitesparse.cc61 triplet.nnz = A->num_nonzeros();
70 return cholmod_triplet_to_sparse(&triplet, triplet.nnz, &cc_);
81 triplet.nnz = A->num_nonzeros();
92 return cholmod_triplet_to_sparse(&triplet, triplet.nnz, &cc_);
H A Dtriplet_sparse_matrix_test.cc300 int nnz = 0; local
303 m.mutable_rows()[nnz] = i;
304 m.mutable_cols()[nnz] = j;
305 m.mutable_values()[nnz++] = i+j;
308 m.set_num_nonzeros(nnz);
H A Dcompressed_row_sparse_matrix.cc451 int nnz = 0; local
454 (*program)[product[0].index] = nnz;
461 crsm_cols[++nnz] = current.col;
467 (*program)[current.index] = nnz;
/external/eigen/Eigen/src/OrderingMethods/
H A DOrdering.h131 Index nnz = mat.nonZeros(); local
133 Index Alen = internal::colamd_recommended(nnz, m, n);
141 for(Index i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i];
H A DEigen_Colamd.h196 the COLAMD_RECOMMENDED (nnz, n_row, n_col) macro. It returns -1 if any
197 argument is negative. 2*nnz space is required for the row and column
201 and nnz/5 more space is recommended for run time efficiency.
258 * \param nnz nonzeros in A
264 inline Index colamd_recommended ( Index nnz, Index n_row, Index n_col) argument
266 if ((nnz) < 0 || (n_row) < 0 || (n_col) < 0)
269 return (2 * (nnz) + colamd_c (n_col) + colamd_r (n_row) + (n_col) + ((nnz) / 5));
334 Index nnz ; /* nonzeros in A */ local
392 nnz
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseBlock.h135 Index nnz = tmp.nonZeros(); local
145 if(nnz>free_size)
148 typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz);
153 std::memcpy(&newdata.value(start), &tmp.data().value(0), nnz*sizeof(Scalar));
154 std::memcpy(&newdata.index(start), &tmp.data().index(0), nnz*sizeof(Index));
156 std::memcpy(&newdata.value(start+nnz), &matrix.data().value(end), tail_size*sizeof(Scalar));
157 std::memcpy(&newdata.index(start+nnz), &matrix.data().index(end), tail_size*sizeof(Index));
159 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
166 matrix.data().resize(start + nnz + tail_size);
168 std::memmove(&matrix.data().value(start+nnz),
[all...]
H A DConservativeSparseSparseProduct.h37 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
47 Index nnz = 0; local
60 indices[nnz] = i;
61 ++nnz;
69 for(Index k=0; k<nnz; ++k)
82 // FIXME reserve nnz non zeros
83 // FIXME implement fast sort algorithms for very small nnz
88 //if((nnz<20
[all...]
H A DMappedSparseMatrix.h108 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr) argument
109 : m_outerSize(IsRowMajor?rows:cols), m_innerSize(IsRowMajor?cols:rows), m_nnz(nnz), m_outerIndex(outerIndexPtr),
H A DSparseSelfAdjointView.h351 Index nnz = count.sum(); local
354 dest.resizeNonZeros(nnz);
/external/eigen/bench/
H A Dsparse_setter.cpp107 std::cout << "nnz = " << coords.size() << "\n";
302 const int nnz,
312 for (int n = 0; n < nnz; n++){
316 //cumsum the nnz per row to get Bp[]
322 Bp[n_row] = nnz;
325 for(int n = 0; n < nnz; n++){
384 I nnz = 0; local
397 Aj[nnz] = j;
398 Ax[nnz] = x;
399 nnz
300 coo_tocsr(const int n_row, const int n_col, const int nnz, const Coordinates Aij, const Values Ax, int Bp[], int Bj[], T Bx[]) argument
[all...]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteCholesky.h147 Index nnz = m_L.nonZeros(); local
148 Map<ScalarType> vals(m_L.valuePtr(), nnz); //values
149 Map<IndexType> rowIdx(m_L.innerIndexPtr(), nnz); //Row indices
/external/eigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h114 union {int nnz;int lda;}; member in union:Eigen::SluMatrix::__anon21001::__anon21002
186 res.storage.nnz = mat.nonZeros();
245 res.storage.nnz = mat.nonZeros();
704 m_l.resizeNonZeros(Lstore->nnz);
706 m_u.resizeNonZeros(Ustore->nnz);
/external/eigen/Eigen/src/SparseLU/
H A DSparseLU.h493 Index nnz = m_mat.nonZeros(); local
497 Index info = Base::memInit(m, n, nnz, lwork, m_perfv.fillfactor, m_perfv.panel_size, m_glu);
/external/chromium_org/third_party/libjingle/source/talk/media/testdata/
H A Dvoice.rtpdump16 ��pj�|����rfi��kolkjagi_a_jksj_`g���rmiw������������{��������tkkn�upg`hy{|xhefuvi`y���~�����u{�������������{kj��okolluk`^_irnllo���to}����������������w|��xeelljgg����9��4Ϫ��pjsul_\_nzmq����ln�������������������������~}n]Z]cc_aqyf[[ao�h\^m�yeo����x~����uo~���~kk�rhhj{wf[]m�pdcl�v��������������������������wy��~]^l���nc_ihjo}}ken�����t�� �9��4�J��pjqy�����nnz���v{u��rn���uf\filjz�ls��}eiq{y�����qu~����{�������y����ot���qllu~xqhnm|{{qoz�~�yv����giy�}}�����ojos~|������~xpoomt�����|jp��tjn������wppny���{��xn���9��4���pj���zn������������oi{������zns��}�{ypw~��vpnw�yofo��vgkr��xpgj|��qy������}�����������}���ngs}��vojj~~reflz~�ry����kv����vm|�����������zmr��{fhh}{~rk~��qkf�������3�9��4ъ��pj}x��}rv���uqx��mr{�����zw��������|�~�|z{~wji���onn{��yls}�����|������qnt�}kjy}yxnw{ytkqw��zyo{�������vl��������ty�������tin����z�����wvsy��y��z�����uhk���rr��G�9��4�*��pj}�vknlw����zpqzynir���~pqoohkx�{x~��{ot|������w~x�~}���y���~{���wm�����oot��xon|�������r}������y|~��mgn|��~��zmv���plu{��|{���{���������z�}��wlo��ynljkmu|�|�y��[�9��4�ʎ�pjxv}|rmxy|�{touwty���xyuu����������������|���������x����}~����}pozyy}��usvr}�xv~�������|���������x{��}kiw���}��}sx����sw��~lvz�����x{ux�~~sx}~w}|�~}xury��~txnux��o�9��4�j��pj~|{z����ztt���}|�~~~����z||��|���zwr|~���}~}�ysns���������v���|us����xzxx|�}~����skoq{zz|z{xny����z����|ps|�{vw{����~~����vw||����xttry�����������������|ysw�����9��4�

Completed in 4051 milliseconds