| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 21 * \brief A direct sparse Cholesky factorizations
23 * These classes provide LL^T and LDL^T Cholesky factorizations of sparse matrices that are
25 * X and B can be either dense or sparse.
30 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
183 /** Computes the sparse Cholesky decomposition of \a matrix */
289 * \brief A direct sparse LLT Cholesky factorizations
291 * This class provides a LL^T Cholesky factorizations of sparse matrices that are
293 * X and B can be either dense or sparse.
298 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
339 /** Computes the sparse Cholesky decomposition of \a matrix *
[all...] |
| /external/eigen/unsupported/Eigen/ |
| IterativeSolvers | 13 #include <Eigen/Sparse>
|
| /external/opencv3/samples/gpu/ |
| pyrlk_optical_flow.cpp | 86 "{ gray | | use grayscale sources [PyrLK Sparse] }"
127 namedWindow("PyrLK [Sparse]", WINDOW_NORMAL);
149 // Sparse
175 imshow("PyrLK [Sparse]", frame0);
|
| /frameworks/ml/bordeaux/learning/multiclass_pa/java/android/bordeaux/learning/ |
| MulticlassPA.java | 22 * version 1 supports indexed sparse feature only.
|
| /packages/apps/Gallery2/src/com/android/photos/data/ |
| SparseArrayBitmapPool.java | 26 * Bitmap pool backed by a sparse array indexing linked lists of bitmaps
46 // - A bucket-level list for each index of the sparse array, so that
86 // Unlink the node from its sparse array bucket list.
147 // sparse array, and unlink and return the first bitmap that
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/state/transforms/ |
| SparseArrayElementRemoveTransform.java | 23 * element from a sparse array.
|
| /system/bt/ |
| EventLogTags.logtags | 1 # The entries in this file map a sparse set of log tag numbers to tag names.
|
| /system/core/liblog/ |
| event.logtags | 1 # The entries in this file map a sparse set of log tag numbers to tag names.
|
| /system/core/logd/ |
| event.logtags | 1 # The entries in this file map a sparse set of log tag numbers to tag names.
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 88 * algorithm 6.14 in Y. Saad, Iterative Methods ???for Sparse Linear
162 * \brief A minimal residual solver for sparse symmetric problems
164 * This class allows to solve for A.x = b sparse linear problems using the MINRES algorithm
165 * of Paige and Saunders (1975). The sparse matrix A must be symmetric (possibly indefinite).
166 * The vectors x and b can be either dense or sparse.
168 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
|
| /system/core/libsparse/ |
| sparse_read.c | 31 #include <sparse/sparse.h>
88 sparse_print_verbose("Invalid sparse file format%s%s\n", s, at);
376 error("failed to read sparse file");
409 int sparse_file_read(struct sparse_file *s, int fd, bool sparse, bool crc)
411 if (crc && !sparse) {
415 if (sparse) {
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 126 * \brief A bi conjugate gradient stabilized solver for sparse square problems
128 * This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient
129 * stabilized algorithm. The vectors x and b can be either dense or sparse.
131 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
|
| ConjugateGradient.h | 110 * \brief A conjugate gradient solver for sparse self-adjoint problems
112 * This class allows to solve for A.x = b sparse linear problems using a conjugate gradient algorithm.
113 * The sparse matrix A must be selfadjoint. The vectors x and b can be either dense or sparse.
115 * \tparam _MatrixType the type of the matrix A, can be a dense or a sparse matrix.
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 394 * \brief A sparse direct LU factorization and solver based on the PARDISO library
396 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization
397 * using the Intel MKL PARDISO library. The sparse matrix A must be squared and invertible.
398 * The vectors or matrices X and B can be either dense or sparse.
400 * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
444 * \brief A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library
446 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization
447 * using the Intel MKL PARDISO library. The sparse matrix A must be selfajoint and positive definite.
448 * The vectors or matrices X and B can be either dense or sparse.
450 * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<
[all...] |
| /art/test/015-switch/src/ |
| Main.java | 153 // Sparse switch, just leave a gap.
169 // Simple sparse-switch starting at a negative index.
187 // Simple sparse-switch starting above 0.
203 // Simple sparse-switch going up to max_int.
215 // Simple sparse-switch starting at min_int.
227 // Long sparse-switch that might lead to not creating chained-ifs.
313 System.out.println("sparse");
410 case -10: System.out.print("CORRECT big sparse / first\n"); break;
432 case 100: System.out.print("CORRECT big sparse / last\n"); break;
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| vktSparseResourcesImageSparseResidency.cpp | 21 * \brief Sparse partially resident images tests
50 namespace sparse namespace in namespace:vkt
240 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Sparse residency for 2D Image not supported");
246 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "Sparse residency for 3D Image not supported");
254 // Check if the image format supports sparse operations
261 return tcu::TestStatus(QP_TEST_RESULT_NOT_SUPPORTED, "The image format does not support sparse operations");
275 // Create logical device supporting both sparse and compute queues
278 return tcu::TestStatus(QP_TEST_RESULT_FAIL, "Could not create device supporting sparse and compute queue");
286 // Create queue supporting sparse binding operations
325 // Create sparse imag
[all...] |
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 40 // A compressed row sparse matrix used primarily for communicating the
63 // e.g, consider the 3x4 sparse matrix
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 19 * \brief Base class of any sparse matrices or sparse expressions
336 // sparse * sparse
341 // sparse * diagonal
346 // diagonal * sparse
352 /** dense * sparse (return a dense object unless it is an outer product) */
358 /** 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
|
| /external/eigen/bench/spbench/ |
| sp_solver.cpp | 36 /* Fill the matrix with sparse matrix stored in Matrix-Market coordinate column-oriented format */
56 // ====== TESTS FOR SPARSE TUTORIAL ======
|
| /external/regex-re2/util/ |
| sparse_array.h | 39 // Representation for Sparse Sets, ACM Letters on Programming Languages
49 // Briggs & Torczon describe a sparse set implementation. I have
50 // trivially generalized it to create a sparse array (actually the original
56 // size max_size_. At any point, the number of elements in the sparse array is
59 // The vector dense_ contains the size_ elements in the sparse array (with
86 // To make the sparse array as efficient as possible for non-primitive types,
87 // elements may or may not be destroyed when they are deleted from the sparse
154 // Can sort the sparse array so that future iterations
|
| /external/skia/src/sfnt/ |
| SkOTTable_EBLC.h | 120 // Variable metrics glyphs with sparse glyph codes
130 // Constant metrics glyphs with sparse glyph codes
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/utils/ |
| TypefaceUtils.java | 32 // This sparse array caches key label text height in pixel indexed by key label text size.
52 // This sparse array caches key label text width in pixel indexed by key label text size.
|
| /system/extras/verity/fec/ |
| image.h | 43 /* if true, assume input is a sparse file */
44 bool sparse; member in struct:image
|
| /external/deqp/external/vulkancts/modules/vulkan/ |
| CMakeLists.txt | 77 deqp-vk-sparse-resources
|
