Lines Matching refs:sparse

7 dense storage and compressed sparse row storage (both sequential and
67 the sparse AIJ format, which is discussed in detail in
102 *Warning*: Several of the sparse implementations do *not* currently
111 When using the block compressed sparse row matrix format (`MATSEQBAIJ`
158 In the sparse matrix implementations, once the assembly routines have
218 The default matrix representation within PETSc is the general sparse AIJ
219 format (also called the compressed sparse
237 To create a sequential AIJ sparse matrix, `A`, with `m` rows and
264 preallocate the memory needed for the sparse matrix. The user has two
305 Thus, when assembling a sparse matrix with very different numbers of
312 3. Create the sparse matrix via `MatCreateSeqAIJ()` or alternative.
323 3. Create the sparse matrix via `MatCreateSeqAIJ()` or alternative.
356 Parallel sparse matrices with the AIJ format can be created with the
711 is on sparse iterative solvers.
733 stored, as a single assembled sparse matrix where entries from all
1097 For sparse matrices this removes the data structures for certain rows of
1189 Many sparse matrix operations can be optimized by dividing the computation into two stages: a symbo…
1196 The caller can take advantage of their knowledge of changes in the nonzero structure of the sparse …
1218 PETSc has four families of graph operations that treat sparse `Mat` as representing graphs.
1284 the usual format for parallel compressed sparse row storage, using
1366 reduce fill in sparse matrix factorizations.