Skip to search formSkip to main contentSkip to account menu

Nested dissection

Known as: Nested dissection algorithm 
In numerical analysis, nested dissection is a divide and conquer heuristic for the solution of sparse symmetric systems of linear equations based on… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen during the analyse phase. In the… 
2000
2000
We present an approach for the efficient parallel solution of convection diffusion equations. Based on iterative nested… 
1992
1992
This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix… 
Review
1992
Review
1992
Methods for solving sparse linear systems of equations can be categorized under two broad classes - direct and iterative. Direct… 
1992
1992
We describe a spectral nested dissection algorithm for computing orderings appropriate for parallel factorization of sparse… 
1991
1991
The elimination tree is a rooted tree that is computed from the adjacency graph of a symmetric matrix A. The height of the… 
1986
1986
This paper extends the author's parallel nested dissection algorithm of [PR] originally devised for solving sparse linear systems… 
1985
1985
Abstract : We present a parallel implementation of Gaussian elimination without pivoting using the nested dissection ordering for…