Premium
Computer program for solution of large, sparse, unsymmetric systems of linear equations
Author(s) -
Gupta S. K.,
Tanji K. K.
Publication year - 1977
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/nme.1620110806
Subject(s) - system of linear equations , computer program , finite element method , zero (linguistics) , galerkin method , linear equation , element (criminal law) , computer science , linear system , stability (learning theory) , algorithm , instability , porous medium , field (mathematics) , mathematics , mathematical optimization , mathematical analysis , porosity , engineering , structural engineering , mechanics , physics , linguistics , philosophy , geotechnical engineering , machine learning , pure mathematics , law , political science , operating system
A computer program is presented for in‐core solution of a large, sparse, unsymmetric, unbanded system of linear equations. The program employs two partially packed arrays (one for storing non‐zero elements, and one for column identifications). Used as the pivotal row is the row with the minimum number of non‐zero elements. To avoid instability, the pivot is the largest absolute element in the pivotal row. The method was tested on a system of equations encountered in field application of the three‐dimensional Galerkin finite element solution of flow and mass transport through porous media. Performance is compared with that of available alternatives.