Advertisement

BIT Numerical Mathematics

, Volume 8, Issue 1, pp 53–58 | Cite as

Solution of linear equations with coefficient matrix in band form

  • R. P. Tewarson
Article

Abstract

An algorithm is given for the solution of simultaneous linear equations having a band type coefficient matrix. The algorithm utilizes a suitable partitioning of the coefficient matrix. Some particular cases are described in which the use of the algorithm is advisable.

Keywords

Linear Equation Computational Mathematic Coefficient Matrix Band Form Band Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Ralston,A First Course in Numerical Analysis, McGraw-Hill, New York, N.Y. (1965), pp. 399–401.Google Scholar
  2. 2.
    R. P. Tewarson,Solution of a System of Simultaneous Linear Equations with a Sparse Coefficient Matrix by Elimination Methods, BIT 7 (1967), pp. 226–239.Google Scholar
  3. 3.
    R. P. Tewarson,On the Product Form of Inverses of Sparse Matrices, SIAM Rev., 8 (1966), pp. 336–342.Google Scholar
  4. 4.
    J. H. Wilkinson,Rounding Errors in Algebraic Processes, Prentice Hall, Englewood Cliffs, N.J., (1963), pp. 105–106.Google Scholar
  5. 5.
    J. H. Wilkinson,Error Analysis of Direct Methods of Matrix Inversion, J. ACM, 8 (1961), pp. 281–330.CrossRefGoogle Scholar

Copyright information

© BIT Foundations 1968

Authors and Affiliations

  • R. P. Tewarson
    • 1
  1. 1.State University of New YorkStony BrookUSA

Personalised recommendations