Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,958,489 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Cholesky decomposition
Cycle rank
Finite element method
Gaussian elimination
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
A study of pivoting strategies for tough sparse indefinite systems
J. Hogg
,
J. Scott
2012
Corpus ID: 17232359
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen during the analyse phase. In the…
Expand
2011
2011
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
J. Aliaga
,
M. Bollhöfer
,
Alberto F. Martín
,
E. Quintana-Ortí
Parallel Computing
2011
Corpus ID: 6162445
2000
2000
A Fast Solver for Convection Diffusion Equations Based on Nested Dissection with Incomplete Elimination
M. Bader
,
C. Zenger
European Conference on Parallel Processing
2000
Corpus ID: 6903723
We present an approach for the efficient parallel solution of convection diffusion equations. Based on iterative nested…
Expand
1995
1995
Sensitivity analysis for large-deflection and postbuckling responses on distributed-memory computers
B. Watson
,
A. Noor
1995
Corpus ID: 121590933
1992
1992
A Cartesian Parallel Nested Dissection Algorithm
M. Heath
,
P. Raghavan
SIAM Journal on Matrix Analysis and Applications
1992
Corpus ID: 40611925
This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix…
Expand
Review
1992
Review
1992
Nested Dissection: A Survey
M. Khaira
,
G. Miller
,
T. Sheffler
1992
Corpus ID: 59883082
Methods for solving sparse linear systems of equations can be categorized under two broad classes - direct and iterative. Direct…
Expand
1992
1992
Spectral Nested Dissection 1
A. Pothen
,
H. Simon
,
+4 authors
Alex Pottten
1992
Corpus ID: 15546626
We describe a spectral nested dissection algorithm for computing orderings appropriate for parallel factorization of sparse…
Expand
1991
1991
An Algorithm for Computing an Elimination Tree of Minimum Height for a Tree
F. Manne
1991
Corpus ID: 11414118
The elimination tree is a rooted tree that is computed from the adjacency graph of a symmetric matrix A. The height of the…
Expand
1986
1986
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems
V. Pan
,
J. Reif
Foundations of Software Technology and…
1986
Corpus ID: 206613540
This paper extends the author's parallel nested dissection algorithm of [PR] originally devised for solving sparse linear systems…
Expand
1985
1985
Nested dissection on a mesh-connected processor array
P. Worley
,
R. Schreiber
1985
Corpus ID: 117894628
Abstract : We present a parallel implementation of Gaussian elimination without pivoting using the nested dissection ordering for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE