Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,843 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.
2018
2018
Incomplete nested dissection
Rasmus Kyng
,
Richard Peng
,
Robert Schwieterman
,
Peng Zhang
Symposium on the Theory of Computing
2018
Corpus ID: 43943587
We present an asymptotically faster algorithm for solving linear systems in well-structured 3-dimensional truss stiffness…
Expand
2017
2017
Sparsify and Sweep: An Efficient Preconditioner for the Lippmann-Schwinger Equation
Fei Liu
,
Lexing Ying
SIAM Journal on Scientific Computing
2017
Corpus ID: 36362835
This paper presents an efficient preconditioner for the Lippmann-Schwinger equation that combines the ideas of the sparsifying…
Expand
Highly Cited
2007
Highly Cited
2007
Parallel Symbolic Factorization for Sparse LU with Static Pivoting
L. Grigori
,
J. Demmel
,
X. Li
SIAM Journal on Scientific Computing
2007
Corpus ID: 1086980
This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general…
Expand
Review
2005
Review
2005
Electromagnetic applications of a new finite-difference calculus
I. Tsukerman
IEEE transactions on magnetics
2005
Corpus ID: 7920983
The accuracy of finite-difference analysis in electromagnetics can be qualitatively improved by employing arbitrary local…
Expand
Highly Cited
2000
Highly Cited
2000
Improved frequency-domain elastic wave modeling using weighted-averaging difference operators
D. Min
,
C. Shin
,
B. Kwon
,
Seung-Hwan Chung
2000
Corpus ID: 85526985
We develop a new finite-difference scheme that reduces the number of grid points per wavelength required in frequency-domain…
Expand
1997
1997
Parallel Ordering Using Edge Contraction
P. Raghavan
Parallel Computing
1997
Corpus ID: 5360262
Highly Cited
1994
Highly Cited
1994
A Cartesian Parallel Nested Dissection Algorithm
G. Miller
,
S. Teng
,
W. Thurston
,
G. Miller
1994
Corpus ID: 14087306
shop on Sparse Matrix Computations: Graph Theory Issues and Algorithms, Institute for Mathematics and Its Applications, Springer…
Expand
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
1989
1989
Fast and Efficient Solution of Path Algebra Problems
V. Pan
,
J. Reif
Journal of computer and system sciences (Print)
1989
Corpus ID: 7990547
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
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