Implementation of Nested Dissection Method Using Block Elimination
نویسندگان
چکیده
In this paper, we consider the problem of solving an 2 2 n n sparse positive definite system b AU , arising from the use of finite difference methods to solve an elliptic boundary value problem on an n n mesh where 1 2 k n where k is a positive integer. The large sparse linear system can be solved directly in an efficient way using nested dissection method, originally proposed by Alan George. This paper demonstrates two algorithms for finding orderings using a version of the nested dissection method which leads to block Gaussian elimination of the matrix A. Implementation of these algorithms is pursued and the issue of storage and execution time tradeoffs is discussed.
منابع مشابه
Tradeoos between Parallelism and Fill in Nested Dissection
In this paper we demonstrate that tradeoos can be made between parallelism and ll in nested dissection algorithms for Gaussian elimination, both in theory and in practice. We present a new \less parallel nested dissection" algorithm (LPND), and prove that, unlike the standard nested dissection algorithm, when applied to a chordal graph LPND nds a zero-ll elimination order. We have also implemen...
متن کاملAn Organization of Sparse Gauss Elimination for Solving PDEs on Distributed Memory Machines
A computational arrangement of Gauss elimination is presented for solving sparse, nonsymmetric linear systems arising from partial differential equation (PDE) problems. It is particularly targeted for use on distributed memory message passing (DMMP) multiprocessor computers and it is presented and analyzed in this context. The objective of the algorithm is to exploit the sparsity (i.e., reducin...
متن کاملSuperfast Multifrontal Method for Structured Linear Systems of Equations
In this paper we develop a fast direct solver for discretized linear systems using the multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations such as elliptic equations we discover that during the Gaussian elimination of the matrices with proper ordering, the fill-in has a low-rank property: all off-diagonal blocks have ...
متن کاملAn O(N) algorithm for constructing the solution operator to 2D elliptic boundary value problems in the absence of body loads
The large sparse linear systems arising from the finite element or finite difference discretization of elliptic PDEs can be solved directly via, e.g., nested dissection or multifrontal methods. Such techniques reorder the nodes in the grid to reduce the asymptotic complexity of Gaussian elimination from O(N) to O(N) for typical problems in two dimensions. It has recently been demonstrated that ...
متن کاملSuperfast Multifrontal Method for Large Structured Linear Systems of Equations
In this paper we develop a fast direct solver for large discretized linear systems using the supernodal multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations such as elliptic equations, during the Gaussian elimination of the matrices with proper ordering, the fill-in has a low-rank property: all off-diagonal blocks have...
متن کامل