Access the full text.
Sign up today, get DeepDyve free for 14 days.
PR Amestoy, IS Duff, J-Y l’Excellent, J Koster (2001)
A fully asynchronous multifrontal solver using distributed dynamic schedulingSIAM J. Matrix Anal. Appl., 23
PR Amestoy, IS Duff, J-Y l’Excellent (2000)
Multifrontal parallel distributed symmetric and unsymmetric solversComput. Methods Appl. Mech. Eng., 184
S Zohar (1974)
The solution of a Toeplitz set of linear equations.J. ACM, 21
HS Stone (1973)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of EquationsJ. Assoc. Comput. Mach., 20
JW Demmel, JR Gilbert, XS Li (1999)
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian EliminationSIAM J. Matrix Anal. Appl., 20
J Mandel (1993)
Balancing domain decompositionComm. Numer. Methods Engrg., 9
PR Amestoy, A Guermouche, J-Y l’Excellent, S Pralet (2006)
Hybrid scheduling for the parallel solution of linear systemsParallel Comput., 32
I Duff, J Reid (1983)
The Multifrontal Solution of Indefinite Sparse Symmetric Linear EquationsACM Trans. Math. Softw., 9
J Liu (1992)
The Multifrontal Method for Sparse Matrix SolutionTheory and Practice, SIAM Review, 34
A Ruffa (2011)
A solution approach for lower Hessenberg linear systemsISRN Applied Mathematics, 2011
O Schenk, A Waechter, M Hagemann (2007)
Matching-based Preprocessing Algorithms to the Solution of Saddle-Point Problems in Large-Scale Nonconvex Interior-Point OptimizationJournal of Computational Optimization and Applications, 36
DS Meek (1983)
The Inverses of Toeplitz Band MatricesLinear Algebra Appl., 49
B Irons (1970)
A Frontal Solution Program for Finite Element AnalysisssInt. J. Numer. Methods Eng., 2
O Schenk, M Bollhoefer, R Roemer (2008)
On large-scale diagonalization techniques for the Anderson model of localization. Featured SIGEST paper in the SIAM Review selected on the basis of its exceptional interest to the entire SIAM communitySIAM Rev., 50
Banded linear systems occur frequently in mathematics and physics. However, direct solvers for large systems cannot be performed in parallel without communication. The aim of this paper is to develop a general asymmetric banded solver with a direct approach that scales across many processors efficiently. The key mechanism behind this is that reduction to a row-echelon form is not required by the solver. The method requires more floating point calculations than a standard solver such as LU decomposition, but by leveraging multiple processors the overall solution time is reduced. We present a solver using a superposition approach that decomposes the original linear system into q subsystems, where q is the number of superdiagonals. These methods show optimal computational cost when q processors are available because each system can be solved in parallel asynchronously. This is followed by a q×q dense constraint matrix problem that is solved before a final vectorized superposition is performed. Reduction to row echelon form is not required by the solver, and hence the method avoids fill-in. The algorithm is first developed for tridiagonal systems followed by an extension to arbitrary banded systems. Accuracy and performance is compared with existing solvers and software is provided in the supplementary material.
Numerical Algorithms – Springer Journals
Published: Jan 4, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.