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

1 2 34 5 6 7 8 91011>>

  /external/eigen/Eigen/src/IterativeLinearSolvers/
ConjugateGradient.h 96 * \brief A conjugate gradient solver for sparse self-adjoint problems
98 * This class allows to solve for A.x = b sparse linear problems using a conjugate gradient algorithm.
99 * The sparse matrix A must be selfadjoint. The vectors x and b can be either dense or sparse.
101 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
BiCGSTAB.h 106 * \brief A bi conjugate gradient stabilized solver for sparse square problems
108 * This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient
109 * stabilized algorithm. The vectors x and b can be either dense or sparse.
111 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
  /dalvik/dx/tests/045-dex-switch-ops/
expected.txt 33 0003: sparse-switch v2, 0016 // +0013
49 0016: sparse-switch-payload // for switch @ 0003
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRIntArray.h 41 BOOL SPARSE;
72 @property (assign) BOOL SPARSE;
  /external/ceres-solver/internal/ceres/
block_evaluate_preparer.h 32 // directly into their final resting place in an overall block sparse matrix.
57 // Point the jacobian blocks directly into the block sparse matrix, if
  /external/llvm/include/llvm/ADT/
SparseMultiSet.h 1 //===--- llvm/ADT/SparseMultiSet.h - Sparse multiset ------------*- C++ -*-===//
13 // A sparse multiset holds a small number of objects identified by integer keys
14 // from a moderately sized universe. The sparse multiset uses more memory than
47 /// SparseMultiSet contains a dense vector holding all the objects and a sparse
49 /// the sparse array which is the size of the key universe. The SparseT template
53 /// sparse array uses 4 x Universe bytes.
56 /// lines, but the sparse array is 4x smaller. N is the number of elements in
112 SparseT *Sparse;
186 : Sparse(0), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) { }
188 ~SparseMultiSet() { free(Sparse); }
    [all...]
  /external/oprofile/libutil++/
sparse_array.h 3 * Auto-expanding sparse array type
26 * sparse array.
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/
TypefaceUtils.java 31 // This sparse array caches key label text height in pixel indexed by key label text size.
51 // This sparse array caches key label text width in pixel indexed by key label text size.
  /external/e2fsprogs/misc/
e2image.8.in 59 creates the image file as a sparse file.
63 .B \-\-sparse=always
104 created as a sparse file. (Beware of copying or
106 how to create sparse files; the file will become as large as the
e2image.c 411 int sparse = 0; local
437 write_block(fd, buf, sparse, fs->blocksize, blk);
438 sparse = 0;
446 sparse += fs->blocksize;
447 if (sparse >= 1024*1024) {
448 write_block(fd, 0, sparse, 0, 0);
449 sparse = 0;
453 if (sparse)
454 write_block(fd, zero_buf, sparse-1, 1, -1);
  /external/eigen/Eigen/
CholmodSupport 15 * This module provides an interface to the Cholmod library which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suitesparse</a> package.
PaStiXSupport 22 * PaSTiX is a general \b supernodal, \b parallel and \b opensource sparse solver.
UmfPackSupport 15 * This module provides an interface to the UmfPack library which is part of the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">suitesparse</a> package.
  /external/eigen/Eigen/src/PardisoSupport/
PardisoSupport.h 214 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
416 * \brief A sparse direct LU factorization and solver based on the PARDISO library
418 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
419 * using the Intel MKL PARDISO library. The sparse matrix A must be squared and invertible.
420 * The vectors or matrices X and B can be either dense or sparse.
422 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
466 * \brief A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library
468 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization
469 * using the Intel MKL PARDISO library. The sparse matrix A must be selfajoint and positive definite.
470 * The vectors or matrices X and B can be either dense or sparse
    [all...]
  /external/eigen/unsupported/Eigen/
IterativeSolvers 13 #include <Eigen/Sparse>
  /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/sftp/
AttribBits.java 86 * The file is a sparse file; this means that file blocks that have
92 * Some servers may store all files as sparse files, in which case
94 * a mechanism for determining if the file is sparse, and so the file
95 * MAY be stored sparse even if this flag is not set.
  /frameworks/ml/bordeaux/learning/multiclass_pa/java/android/bordeaux/learning/
MulticlassPA.java 22 * version 1 supports indexed sparse feature only.
  /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/state/transforms/
SparseArrayElementRemoveTransform.java 23 * element from a sparse array.
  /external/eigen/test/
sparse_product.cpp 10 #include "sparse.h"
82 // sparse * sparse
101 // sparse * dense
110 // dense * sparse
116 // sparse * dense and dense * sparse outer product
  /system/core/libsparse/
sparse_read.c 30 #include <sparse/sparse.h>
85 sparse_print_verbose("Invalid sparse file format%s%s\n", s, at);
379 error("failed to read sparse file");
410 int sparse_file_read(struct sparse_file *s, int fd, bool sparse, bool crc)
412 if (crc && !sparse) {
416 if (sparse) {
  /external/ceres-solver/docs/
ceres-solver.bib 91 title={MIQR: A multilevel incomplete QR preconditioner for large sparse least-squares problems},
105 Title = {{An Inexact Levenberg-Marquardt Method for Large Sparse Nonlinear Least Squares}},
172 Title = {{Direct methods for sparse linear systems}},
201 Title = {{Iterative methods for sparse linear systems}},
247 Title = {{Algorithm 887: CHOLMOD, Supernodal Sparse {Cholesky} Factorization and Update/Downdate}},
  /external/chromium/net/disk_cache/
disk_format.h 142 PARENT_ENTRY = 1, // This entry has children (sparse) entries.
143 CHILD_ENTRY = 1 << 1 // Child entry that stores sparse data.
195 // Sparse data support:
196 // We keep a two level hierarchy to enable sparse data for an entry: the first
200 // Whenever we need to access a particular sparse offset, we first locate the
209 // that a given sparse entry can have a large number of child entries, and the
217 // the child and the parent entries. For example, a sparse entry with a key of
218 // "sparse entry name", and a signature of 0x052AF76, may have a child entry
224 // read that spans data not written before. The actual sparse data is stored in
  /external/eigen/Eigen/src/SparseCholesky/
SimplicialCholesky.h 61 * \brief A direct sparse Cholesky factorizations
63 * These classes provide LL^T and LDL^T Cholesky factorizations of sparse matrices that are
65 * X and B can be either dense or sparse.
70 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
225 // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix.
243 /** Computes the sparse Cholesky decomposition of \a matrix */
346 * \brief A direct sparse LLT Cholesky factorizations
348 * This class provides a LL^T Cholesky factorizations of sparse matrices that are
350 * X and B can be either dense or sparse.
355 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<
    [all...]
  /external/eigen/Eigen/src/SparseCore/
SparseMatrixBase.h 19 * \brief Base class of any sparse matrices or sparse expressions
333 // sparse * sparse
338 // sparse * diagonal
343 // diagonal * sparse
349 /** dense * sparse (return a dense object unless it is an outer product) */
355 /** sparse * dense (returns a dense object unless it is an outer product) */
  /external/eigen/bench/
sparse_randomsetter.cpp 91 dostuff<RandomSetter<EigenSparseMatrix,GoogleSparseHashMapTraits,Bits> >("google::sparse", sm1);
117 // std::cout << "google::sparse => \t" << t.value()-rtime

Completed in 903 milliseconds

1 2 34 5 6 7 8 91011>>