Premium
A block solver for large, unsymmetric, sparse, banded matrices with symmetric profiles
Author(s) -
Manoj K. G.,
Bhattacharyya S. K.
Publication year - 1997
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19970915)40:17<3279::aid-nme212>3.0.co;2-n
Subject(s) - solver , skyline , block (permutation group theory) , computer science , gaussian elimination , sparse matrix , fortran , scheme (mathematics) , parallel computing , factorization , computational science , algorithm , code (set theory) , mathematics , combinatorics , gaussian , mathematical analysis , programming language , physics , quantum mechanics , set (abstract data type) , data mining
A block equation solver for the solution of large, sparse, banded unsymmetric system of linear equations is presented in this paper. The method employs Crout variation of Gauss elimination technique for the solution. The solver ensures the efficient use of the available memory by doing block factorization and storage. It uses a skyline storage scheme which will avoid unnecessary operations on zero elements above the skyline which has found widespread use in banded symmetric solvers. A FORTRAN code with ample comments is provided. © 1997 John Wiley & Sons, Ltd.