Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 353-359 |
Number of pages | 7 |
Journal | Computer Journal |
Volume | 19 |
Issue number | 4 |
DOIs | |
State | Published - 1 Jan 1976 |
ASJC Scopus subject areas
- General Computer Science