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 factori
β¦ LIBER β¦
A linear solver for sparse banded matrices
β Scribed by Yehonathan Hazony
- Publisher
- Elsevier Science
- Year
- 1984
- Weight
- 466 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0141-1195
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A block solver for large, unsymmetric, s
β
K. G. Manoj; S. K. Bhattacharyya
π
Article
π
1997
π
John Wiley and Sons
π
English
β 375 KB
A vectorizable eigenvalue solver for spa
β
L.C. Bernard; F.J. Helton
π
Article
π
1982
π
Elsevier Science
π
English
β 500 KB
A normalized sparse linear equations sol
β
Elias A. Lipitakis
π
Article
π
1983
π
Elsevier Science
π
English
β 726 KB
A sparse linear equations solver for 3D-
β
Lipitakis, Elias A. ;Evans, David J.
π
Article
π
1987
π
Wiley (John Wiley & Sons)
π
English
β 582 KB
ARMS: an algebraic recursive multilevel
β
Y. Saad; B. Suchomel
π
Article
π
2002
π
John Wiley and Sons
π
English
β 215 KB
An evaluation of limited-memory sparse l
β
Keita Teranishi; Padma Raghavan; Jun Sun; Panagiotis Michaleris
π
Article
π
2008
π
John Wiley and Sons
π
English
β 388 KB
## Abstract We consider the performance of sparse linear solvers for problems that arise from thermoβmechanical applications. Such problems have been solved using sparse direct schemes that enable robust solution at the expense of memory requirements that grow nonβlinearly with the dimension of the