DocumentCode :
1707473
Title :
Solving Linear Systems through Nested Dissection
Author :
Alon, Noga ; Yuster, Raphael
Author_Institution :
Schools of Math. & Comput. Sci., Tel Aviv Univ., Tel Aviv, Israel
fYear :
2010
Firstpage :
225
Lastpage :
234
Abstract :
The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax=b where A is a symmetric positive definite matrix. The method runs extremely fast whenever A is a well-separable matrix (such as matrices whose underlying support is planar or avoids a fixed minor). In this work we extend the nested dissection method to apply to any non-singular well-separable matrix over any field. The running times we obtain essentially match those of the nested dissection method.
Keywords :
matrix algebra; linear systems; nested dissection method; nonsingular well separable matrix; symmetric positive definite matrix; Complexity theory; Gallium; Linear systems; Particle separators; Sparse matrices; Symmetric matrices; Transmission line matrix methods; Gaussian elimination; linear system; nested dissection;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on
Conference_Location :
Las Vegas, NV
ISSN :
0272-5428
Print_ISBN :
978-1-4244-8525-3
Type :
conf
DOI :
10.1109/FOCS.2010.28
Filename :
5671172
Link To Document :
بازگشت