| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 110 if (tmp!=Scalar(0)) // optimization when other is actually sparse
142 if (tmp!=Scalar(0)) // optimization when other is actually sparse
193 // pure sparse path
|
| /external/opencv3/modules/cudaoptflow/src/ |
| pyrlk.cpp | 76 void sparse(const GpuMat& prevImg, const GpuMat& nextImg, const GpuMat& prevPts, GpuMat& nextPts,
116 void PyrLKOpticalFlowBase::sparse(const GpuMat& prevImg, const GpuMat& nextImg, const GpuMat& prevPts, GpuMat& nextPts, GpuMat& status, GpuMat* err, Stream& stream)
299 sparse(prevImg, nextImg, prevPts, nextPts, status, err, stream);
|
| /external/squashfs-tools/squashfs-tools/ |
| unsquash-4.c | 158 i.sparse = 0;
178 i.sparse = inode->sparse != 0;
|
| /external/v8/test/mjsunit/ |
| array-indexing.js | 30 // Sparse arrays with length 42000.
79 // Find in sparse array.
146 // Find in sparse array.
|
| /system/extras/verity/ |
| VerityVerifier.java | 138 * Unsparses a sparse image into a temporary file and returns a
140 * @param fname Path to a sparse image file
402 System.err.println("Usage: VerityVerifier <sparse.img> <certificate.x509.pem> | -mincrypt <mincrypt_key>");
|
| /external/ceres-solver/docs/source/ |
| solving.rst | 467 Large non-linear least square problems are usually sparse. In such
483 factorization -- sparse and dense.
489 ``SPARSE_NORMAL_CHOLESKY``, as the name implies performs a sparse
491 substantial savings in time and memory for large sparse
492 problems. Ceres uses the sparse Cholesky factorization routines in
494 or the sparse Cholesky factorization algorithm in ``Eigen`` (which
524 where, :math:`B \in \mathbb{R}^{pc\times pc}` is a block sparse matrix
528 general block sparse matrix, with a block of size :math:`c\times s`
568 and matrix-vector multiplies, and the solution of block sparse
586 But, :math:`S` is typically a fairly sparse matrix, as most image
[all...] |
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sparse_switch/ |
| Test_sparse_switch.java | 152 * @title sparse-switch-data pseudo-instructions must not be reachable by control flow
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| LabeledList.java | 27 * Sparse array indexed by label to FixedSizeList index.
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SetFactory.java | 32 * like the CFG itself, very sparse at large sizes.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldLUDecomposition.java | 66 * <p>P is a sparse matrix with exactly one element set to 1.0 in
|
| LUDecomposition.java | 64 * <p>P is a sparse matrix with exactly one element set to 1.0 in
|
| /external/autotest/client/samples/ |
| control.kbuild_and_tests | 63 job.run_test('sparse')
|
| /external/ceres-solver/include/ceres/ |
| types.h | 74 // Solve the normal equations using a sparse cholesky solver; requires
85 // Solves the reduced linear system using a sparse Cholesky solver;
149 // High performance sparse Cholesky factorization and approximate
158 // Eigen's sparse linear algebra routines. In particular Ceres uses
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_sparse_matrix.h | 50 // A thread safe square block sparse implementation of
|
| block_structure.h | 32 // dense block structure of sparse matrices. The BlockSparseMatrix
|
| compressed_row_jacobian_writer.h | 31 // A jacobian writer that directly writes to compressed row sparse matrices.
|
| iterative_schur_complement_solver.h | 69 // "Iterative Methods for Sparse Linear Systems".
|
| schur_complement_solver.cc | 261 LOG(FATAL) << "Unknown sparse linear algebra library : "
270 // CHOLMOD's sparse cholesky factorization routines.
377 // CXSparse's sparse cholesky factorization routines.
433 // Eigen's sparse cholesky factorization routines.
|
| visibility.h | 33 // structure of sparse matrices.
|
| /external/chromium-trace/catapult/tracing/tracing/ui/base/ |
| bar_chart.html | 54 // Allow for sparse data
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SetFactory.java | 32 * like the CFG itself, very sparse at large sizes.
|
| /external/eigen/Eigen/src/misc/ |
| SparseSolve.h | 53 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
|
| /external/eigen/bench/ |
| sparse_lu.cpp | 6 #include <Eigen/Sparse>
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| BlockOfDynamicSparseMatrix.h | 101 // template<typename Sparse>
|
| /external/guava/guava/src/com/google/common/collect/ |
| SparseImmutableTable.java | 25 * A {@code RegularImmutableTable} optimized for sparse data.
|
