- ...
![% latex2html id marker 3237
\setcounter{footnote}{1}\fnsymbol{footnote}](img42.png)
-
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... \\
![% latex2html id marker 3238
\setcounter{footnote}{2}\fnsymbol{footnote}](img43.png)
-
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... \\
![% latex2html id marker 3239
\setcounter{footnote}{3}\fnsymbol{footnote}](img44.png)
-
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... \\
![% latex2html id marker 3240
\setcounter{footnote}{4}\fnsymbol{footnote}](img45.png)
-
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ... preconditioner.
![% latex2html id marker 3333
\setcounter{footnote}{5}\fnsymbol{footnote}](img78.png)
- In fact, they are the
starting points of both classes of sweeping preconditioners.
The
-matrix approach essentially executes these algorithms with
-matrix arithmetic.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ....
![% latex2html id marker 3377
\setcounter{footnote}{6}\fnsymbol{footnote}](img83.png)
- In all of the experiments
in this paper,
was either 5 or 6, and the subdomain depth
never exceeded 10.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ....
![% latex2html id marker 3465
\setcounter{footnote}{7}\fnsymbol{footnote}](img111.png)
- Note that increasing the number of planes
per panel provides a mechanism for interpolating between the sweeping
preconditioner and a full multifrontal factorization.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
sequentially.
![% latex2html id marker 3518
\setcounter{footnote}{8}\fnsymbol{footnote}](img124.png)
- While
it is tempting to try to expose more parallelism with techniques like cyclic
reduction (which is a special case of a multifrontal algorithm), their
straightforward application destroys the Schur complement properties that we
exploit for our fast algorithm.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...Schreiber-scalability.
![% latex2html id marker 3529
\setcounter{footnote}{9}\fnsymbol{footnote}](img126.png)
- Cf. (1), which
advocates for only distributing the root frontal matrix two-dimensionally and
using a one-dimensional distribution for all other fronts.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
processes.
- In cases where the available solve parallelism has been
exhausted but the problem cannot be solved on less processes due to memory
constraints, it would be preferable to solve with subdomains stored on subsets
of processes.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
frequency.
- A similar observation is also made
in (37).
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...
implemented.
- Other than Clique, the only other implementation appears
to be in DSCPACK (31).
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.