• Aucun résultat trouvé

Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides"

Copied!
190
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Figure

Figure 1.4: Elimination tree (a) and tree with some amalgamation (b) associated with the matrix in Figure 1.3(a), with the frontal matrices shown at each node
Table 1.1: Set of matrices used for the experiments. Those marked with ( ) are publicly available on gridtlse.org
Table 3.1: Total size of the solution space for matrix AUDI with a block size equal to 128 and different numbers of processes.
Figure 4.2 illustrates the computation of the lower bound. Entries a −1 11 , a −1 33 , and a −1 44 are requested, and the elimination tree of Figure 4.1 is modified accordingly to have leaves (with zero weights) corresponding to these entries
+7

Références

Télécharger maintenant ( PDF - 190 Page - 2.23 MB )

Documents relatifs