Lines Matching refs:sparse

24 Manipulating and solving sparse problems involves various modules which are summarized below:
28 …eMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse t…
29 … <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve…
36 …ized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
40 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers…
59 and one of its possible sparse, \b column \b major representation:
82 The results of %Eigen's operations always produces \b compressed sparse matrices.
111 In this example, we start by defining a column-major sparse matrix type of double \c SparseMatrix<d…
140 … mat(1000,2000);         // declares a 1000x2000 column-major compressed sparse matrix of complex<…
141 …> mat(1000,2000);              // declares a 1000x2000 row-major compressed sparse matrix of double
142 SparseVector<std::complex<float> > vec(1000);              // declares a column sparse vector of co…
143 SparseVector<double,RowMajor> vec(1000);                   // declares a row sparse vector of doubl…
146 In the rest of the tutorial, \c mat and \c vec represent any sparse-matrix and sparse-vector object…
170 Random access to the elements of a sparse object can be done through the \c coeffRef(i,j) function.
199 If the type of the sparse matrix or vector depends on a template parameter, then the \c typename ke…
203 \section TutorialSparseFilling Filling a sparse matrix
208 The simplest way to create a sparse matrix while guaranteeing good performance is thus to first bui…
257     <td>Recommended for very sparse and not too large problems (e.g., 2D Poisson eq.)</td></tr>
270 …<td>Requires the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">SuiteSparse</a> pa…
273 …<td>Requires the <a href="http://www.cise.ufl.edu/research/sparse/SuiteSparse/">SuiteSparse</a> pa…
339 Because of their special storage format, sparse matrices cannot offer the same level of flexbility …
340 In Eigen's sparse module we chose to expose only the subset of the dense matrix API which can be ef…
341 In the following \em sm denotes a sparse matrix, \em sv a sparse vector, \em dm a dense matrix, and…
362 Binary coefficient wise operators can also mix sparse and dense expressions:
379 %Eigen supports various kind of sparse matrix products which are summarize below:
380   - \b sparse-dense:
386 …- \b symmetric \b sparse-dense. The product of a sparse symmetric matrix with a dense matrix (or v…
392 …- \b sparse-sparse. For sparse-sparse products, two different algorithms are available. The defaul…
404   - \b permutations. Finally, permutations can be applied to sparse matrices too:
422  - optimized sparse-dense matrix products: