| /external/ceres-solver/internal/ceres/ |
| block_random_access_diagonal_matrix_test.cc | 91 Matrix dense; local
92 tsm->ToDenseMatrix(&dense);
97 EXPECT_NEAR((dense.block(0, 0, 3, 3) - Matrix::Ones(3, 3)).norm(),
102 EXPECT_NEAR((dense.block(3, 3, 4, 4) - 2 * 2 * Matrix::Ones(4, 4)).norm(),
107 EXPECT_NEAR((dense.block(7, 7, 5, 5) - 3 * 3 * Matrix::Ones(5, 5)).norm(),
112 EXPECT_NEAR(dense.norm(), sqrt(9.0 + 16. * 16. + 81.0 * 25.), kTolerance);
|
| block_random_access_sparse_matrix_test.cc | 95 Matrix dense; local
96 tsm->ToDenseMatrix(&dense);
101 EXPECT_NEAR((dense.block(0, 0, 3, 3) - Matrix::Ones(3, 3)).norm(),
105 EXPECT_NEAR((dense.block(3, 3, 4, 4) - 2 * 2 * Matrix::Ones(4, 4)).norm(),
109 EXPECT_NEAR((dense.block(3, 3 + 4, 4, 5) - 2 * 3 * Matrix::Ones(4, 5)).norm(),
113 EXPECT_NEAR((dense.block(3 + 4, 0, 5, 3) - 3 * 1 * Matrix::Ones(5, 3)).norm(),
118 EXPECT_NEAR(dense.norm(), sqrt(9. + 16. * 16. + 36. * 20. + 9. * 15.),
|
| dynamic_compressed_row_sparse_matrix_test.cc | 71 dense.resize(num_rows, num_cols);
72 dense.setZero();
77 dense(r, c) = i + 1;
107 ASSERT_TRUE((dense.array() == dense_from_tsm.array()).all());
112 ASSERT_TRUE((dense.array() == dense_from_crsm.array()).all());
118 const double& v = dense(r, c);
141 EXPECT_TRUE((dense.array() == dense_from_dcrsm.array()).all());
167 Matrix dense; member in class:ceres::internal::DynamicCompressedRowSparseMatrixTest
210 dense.block(1, 0, 2, num_cols).setZero();
|
| compressed_row_sparse_matrix_test.cc | 274 Matrix dense; local
275 matrix->ToDenseMatrix(&dense);
276 EXPECT_EQ((dense.diagonal() - diagonal).norm(), 0.0);
499 // and ComputeOuterProduct. Convert both matrices to dense matrices
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_kernel_bmod.h | 21 * \param[in,out] dense Packed values of the original matrix
34 static EIGEN_DONT_INLINE void run(const int segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
40 EIGEN_DONT_INLINE void LU_kernel_bmod<SegSizeAtCompileTime>::run(const int segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda,
44 // First, copy U[*,j] segment from dense(*) to tempv(*)
46 // The result of matric-vector update is in dense[*]
53 tempv(i) = dense(irow);
56 // Dense triangular solve -- start effective triangle
64 // Dense matrix-vector product y <-- B*x
76 // Scatter tempv[] into SPA dense[] as a temporary storage
81 dense(irow) = tempv(i)
[all...] |
| SparseLU_copy_to_ucol.h | 43 * \param dense Store the full representation of the column
50 Index SparseLUImpl<Scalar,Index>::copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu)
88 glu.ucol(nextu) = dense(irow);
89 dense(irow) = Scalar(0.0);
|
| SparseLUImpl.h | 40 Index snode_bmod (const Index jcol, const Index fsupc, ScalarVector& dense, GlobalLU_t& glu);
47 void panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu);
49 void panel_bmod(const Index m, const Index w, const Index jcol, const Index nseg, ScalarVector& dense, ScalarVector& tempv, IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu);
51 Index column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu);
52 Index copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu);
|
| SparseLU_column_bmod.h | 42 * \param dense Store the full representation of the column
53 Index SparseLUImpl<Scalar,Index>::column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu)
102 // then scatter the result of sup-col update to dense
105 LU_kernel_bmod<1>::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros);
107 LU_kernel_bmod<Dynamic>::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros);
115 // copy the SPA dense into L\U[*,j]
130 glu.lusup(nextlu) = dense(irow);
131 dense(irow) = Scalar(0.0);
|
| SparseLU_panel_bmod.h | 47 * \param dense Store the full representation of the panel
57 const Index nseg, ScalarVector& dense, ScalarVector& tempv,
113 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
160 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
178 // Scatter l into SPA dense[]
195 VectorBlock<ScalarVector> dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here
207 // then scatter the result of sup-col update to dense[]
|
| SparseLU_panel_dfs.h | 206 * \param[out] dense Accumulate the column vectors of the panel
219 void SparseLUImpl<Scalar,Index>::panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu)
235 VectorBlock<ScalarVector> dense_col(dense,nextl_col, m); // Accumulate a column vector here
|
| SparseLU.h | 518 ScalarVector dense; local
519 dense.setZero(maxpanel);
568 Base::panel_dfs(m, panel_size, jcol, m_mat, m_perm_r.indices(), nseg1, dense, panel_lsub, segrep, repfnz, xprune, marker, parent, xplore, m_glu);
571 Base::panel_bmod(m, panel_size, jcol, nseg1, dense, tempv, segrep, repfnz, m_glu);
591 VectorBlock<ScalarVector> dense_k(dense, k, m);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-241344.js | 29 // Parsing that string creates a sparse array that grows dense.
|
| /external/chromium_org/v8/test/webkit/ |
| sparse-array.js | 41 // This tests oscillation between being sparse and dense.
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 96 k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, local
101 dense = std::max<Index> (16, Index(10 * sqrt(double(n)))); /* find dense threshold */
102 dense = std::min<Index> (n-2, dense);
155 else if(d > dense) /* node i is dense */
|
| /external/chromium_org/v8/test/mjsunit/ |
| in.js | 51 // Check dense arrays
|
| /external/opencv/cv/src/ |
| cvhistogram.cpp | 1415 CvMatND dense; local
[all...] |
| /external/chromium_org/tools/win/split_link/viz.js/ |
| viz.js | [all...] |
| /external/chromium_org/v8/tools/profviz/ |
| gnuplot-4.6.3-emscripten.js | [all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| pdfjs.js | [all...] |
