HomeSort by relevance Sort by last modified time
    Searched full:sparse (Results 126 - 150 of 507) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/eigen/bench/
sparse_product.cpp 153 // eigen sparse matrices
155 std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * "
186 // eigen dyn-sparse matrices
189 std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/(float(m1.rows())*float(m1.cols()))*100 << "% * "
266 std::cout << "GMM++ sparse\t" << nnzPerCol << "%\n";
sparse_trisolver.cpp 96 // eigen sparse matrices
98 std::cout << "Eigen sparse\t" << density*100 << "%\n";
137 std::cout << "GMM++ sparse\t" << density*100 << "%\n";
sparse_transpose.cpp 61 // eigen sparse matrices
  /external/ceres-solver/docs/
build.tex 22 \item{\suitesparse~\footnote{\url{http://www.cise.ufl.edu/research/sparse/SuiteSparse/}}} is used for sparse matrix analysis,
27 \item{\texttt{CXSparse}~\footnote{\url{http://www.cise.ufl.edu/research/sparse/CXSparse/}}} is used for sparse matrix analysis, ordering and factorization. While it is similar to \texttt{SuiteSparse} in scope, its performance is a bit worse but is a much simpler library to build and does not have any other dependencies. This is an optional dependency.
169 brew install suite-sparse
282 to large scale problems due to the lack of a sparse Cholesky solver. This will reduce Ceres' dependencies down to
293 This saves on binary size, but the resulting version of Ceres is not suited to large scale problems due to the lack of a sparse Cholesky solver. This will reduce Ceres' dependencies down to
  /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_6/Array/
regress-290592.js 177 sparsestrings[2] = 'sparse';
268 // map on sparse arrays
269 expect = ',,SPARSE';
276 reportCompare(expect, actual, 'Array.map: uppercase on sparse array');
361 // test forEach on sparse arrays
363 expect = 'sparse,';
371 reportCompare(expect, actual, 'Array.forEach on sparse array');
  /system/core/libsparse/
output_file.c 553 int64_t len, bool sparse, int chunks, bool crc)
577 if (sparse) {
583 if (sparse) {
642 void *priv, unsigned int block_size, int64_t len, int gz, int sparse,
658 ret = output_file_init(&outc->out, block_size, len, sparse, chunks, crc);
668 int gz, int sparse, int chunks, int crc)
681 ret = output_file_init(out, block_size, len, sparse, chunks, crc);
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 167 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
434 * \brief Sparse direct LU solver based on PaStiX library
440 * The vectors or matrices X and B can be either dense or sparse.
442 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
549 * \brief A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library
554 * The vectors or matrices X and B can be either dense or sparse
556 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
630 * \brief A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library
635 * The vectors or matrices X and B can be either dense or sparse
637 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<
    [all...]
  /external/eigen/Eigen/src/Core/
Matrix.h 75 * <dt><b>\anchor dense Dense versus sparse:</b></dt>
76 * <dd>This %Matrix class handles dense, not sparse matrices and vectors. For sparse matrices and vectors, see the Sparse module.
79 * This is unlike Sparse matrices and vectors where the coefficients are stored as a list of nonzero coefficients.</dd>
90 * If you want this behavior, see the Sparse module.</dd>
  /external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h 111 * \brief A sparse LU factorization and solver based on UmfPack
113 * This class allows to solve for A.X = B sparse linear problems via a LU factorization
114 * using the UmfPack library. The sparse matrix A must be squared and full rank.
115 * The vectors or matrices X and B can be either dense or sparse.
119 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
191 /** Computes the sparse Cholesky decomposition of \a matrix
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
GMRES.h 43 * Iterative Methods for Sparse Linear Systems.
219 * \brief A GMRES solver for sparse square problems
221 * This class allows to solve for A.x = b sparse linear problems using a generalized minimal
222 * residual method. The vectors x and b can be either dense or sparse.
224 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
ConstrainedConjGrad.h 56 // FIXME use sparse vectors ?
88 // FIXME add a generic "prune/filter" expression for both dense and sparse object to sparse
  /external/llvm/include/llvm/Analysis/
SparsePropagation.h 1 //===- SparsePropagation.h - Sparse Conditional Property Propagation ------===//
10 // This file implements an abstract sparse conditional propagation algorithm,
112 /// SparseSolver - This class is a general purpose solver for Sparse Conditional
  /external/smali/smali/src/test/resources/LexerTest/
RealSmaliFileTest.smali 119 sparse-switch p1, :sswitch_data_c
139 .sparse-switch
143 .end sparse-switch
  /external/ceres-solver/include/ceres/
crs_matrix.h 39 // A compressed row sparse matrix used primarily for communicating the
  /external/ceres-solver/internal/ceres/
block_evaluate_preparer.cc 49 // Point the jacobian blocks directly into the block sparse matrix.
compressed_row_jacobian_writer.h 31 // A jacobian writer that directly writes to compressed row sparse matrices.
schur_complement_solver.cc 255 LOG(FATAL) << "Unknown sparse linear algebra library : "
259 LOG(FATAL) << "Unknown sparse linear algebra library : "
267 // CHOLMOD's sparse cholesky factorization routines.
348 // CXSparse's sparse cholesky factorization routines.
suitesparse.h 62 // Functions for building cholmod_sparse objects from sparse
158 // doing sparse direct factorization of these matrices the
190 // Extract the block sparsity pattern of the scalar sparse matrix
193 // correspond to the row and column arrays in a compressed column sparse
  /external/chromium/net/disk_cache/
net_log_parameters.cc 42 // NetLog parameters logged when non-sparse reads and writes complete.
sparse_control.cc 24 // Stream of the sparse data index.
27 // Stream of the sparse data.
50 // This class deletes the children of a sparse entry.
207 // We should not have sparse data for the exposed entry.
238 // We don't support simultaneous IO for sparse data.
287 // We don't support simultaneous IO for sparse data.
357 // We are going to start using this entry to store sparse data, so we have to
550 DLOG(ERROR) << "Unable to save sparse map";
732 // finished doing sparse stuff.
  /external/eigen/Eigen/src/SparseCore/
SparseView.h 22 typedef Sparse StorageKind;
  /external/eigen/doc/
B01_Experimental.dox 29 \li Sparse
  /external/eigen/test/eigen2/
eigen2_sparse_vector.cpp 10 #include "sparse.h"
  /external/linux-tools-perf/util/include/linux/added/
hash.h 12 * These primes are chosen to be bit-sparse, that is operations on
  /external/skia/legacy/src/core/
SkAntiRun.h 15 /** Sparse array of run-length-encoded alpha (supersampling coverage) values.

Completed in 1249 milliseconds

1 2 3 4 56 7 8 91011>>