Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734)

A ''nested dissection'' ordering is given for solving any system of linear equations \(A\cdot X=B\) for the family of sparse symmetric positive definite matrices corresponding to the class of graphs of bounded degree whose subgraphs satisfy a \(\sqrt{n}\)-separator theorem, and we prove O(n.log(n)) fill and \(O(n\sqrt{n})\) operation count bounds. Then, the general implementation scheme in the finite element package MODULEF, for two-dimensional finite element problems, is presented, and some numerical results are given.