Searched refs:factorizations (Results 1 – 8 of 8) sorted by relevance
| /petsc/doc/manualpages/MANSECHeaders/ |
| H A D | MatGraphOperations | 3 These tools compute reorderings (`MatOrdering`) (for sparse matrix factorizations), colorings (`Mat…
|
| /petsc/src/mat/impls/aij/seq/lusol/ |
| H A D | lusol.c | 221 int factorizations; in MatLUFactorNumeric_LUSOL() local 229 factorizations = 0; in MatLUFactorNumeric_LUSOL() 241 } else if ((factorizations > 0) && (lusol->luroom < 6)) { in MatLUFactorNumeric_LUSOL() 292 factorizations++; in MatLUFactorNumeric_LUSOL()
|
| /petsc/doc/manual/ |
| H A D | advanced.md | 77 The ILU, LU, ICC, Cholesky, and QR matrix factorizations are split into two or three 141 numerical factorizations for symmetric and nonsymmetric matrices: 188 factorizations, one simply calls the numerical factorization with a new 251 Some of the factorizations also support solves with multiple right-hand sides stored in a `Mat` usi… 263 …MATSOLVERMUMPS`, provides access to Schur complements obtained after partial factorizations as well
|
| H A D | mat.md | 1366 reduce fill in sparse matrix factorizations.
|
| H A D | ksp.md | 800 in the first factorization to be reused for later factorizations.
|
| /petsc/doc/changes/ |
| H A D | 315.md | 136 `MatQRFactorNumeric()` for QR factorizations. Currently the only
|
| /petsc/doc/tutorials/physics/ |
| H A D | guide_to_stokes.md | 194 However, the test needs an accurate linear solver. Sparse LU factorizations do not, in general, do …
|
| /petsc/doc/ |
| H A D | petsc.bib | 434 title = {Approximate and incomplete factorizations}, 627 title = {Communication-optimal parallel and sequential {QR} and {LU} factorizations}, 17876 title = {Communication-optimal parallel and sequential {QR} and {LU} factorizations},
|