Skip Navigation

The Computer Journal 1976 19(4):353-359; doi:10.1093/comjnl/19.4.353
© 1976 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Shacham, M.
Right arrow Articles by Kehat, E.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A direct method for the solution of large sparse systems of linear equations

M. Shacham * and E. Kehat

Department of Chemical Engineering, Ben Gurion University of the Negev, Beer-Sheva, Israel

A new method for the solution of large sparse systems of linear equations that offers considerable savings of computation time and storage is presented. The proposed method is easily programmable for linear systems with a band type matrix of coefficients and can be used for large sparse systems, where the non-zero elements in the matrix of coefficients are randomly spaced.

The system is restructured by tearing and the whole system is solved as a smaller linear system of the tear variables, using a modification of the Newton method, for which the derivatives are calculated directly from the equations.


Received March 1974. Revised April 1975.

* Present Address: Department of Chemical Engineering, Ben Gurion University of the Negev, Beer-Sheva 84-120, Israel.

§ Department of Chemical Engineering, Terchnion—Israel Institute of Technology, Haifa, Israel


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.