Skip to main content
Log in

On solving problems with sparse matrices

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature cited

  1. R. K. Brayton, F. G. Gustavson, and R. A. Willoughby, “Some results on sparse matrices,” Math. Comput.,24, No. 112, 937–954 (1970).

    Google Scholar 

  2. K. Zollenkopf, “Bifactorization-basic computational algorithm and programming techniques,” in: Large Sparse Sets of Linear Equations, London-New York (1971), pp.75–95; Discussion: p. 96.

  3. R. P. Tewarson, “On the product form of inverse of sparse matrices,” SLAM Rev.,8, 336–342 (1966).

    Google Scholar 

  4. G. E. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems, Prentice-Hall, Englewood Cliffs, New Jersey (1967).

    Google Scholar 

  5. D. R. Fulkerson and P. Wolfe, “An algorithm for scaling matrices,” SLAM Rev.,4, 142–146 (1962).

    Google Scholar 

  6. F. L. Bauer, “Optimally spaced scaled matrices,” Num. Math.,5, 73–87 (1963).

    Google Scholar 

  7. J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford Univ. Press, London (1965).

    Google Scholar 

  8. W. F. Tinney and J. W. Walker, “Direct solutions of sparse network equations by optimally ordered triangular factorization,” Proc. IEEE,55, 1801–1809 (1967).

    Google Scholar 

  9. R. P. Tewarson, “Computations with sparse matrices,” SIAM Rev.,12, 527–543 (1970).

    Google Scholar 

  10. R. P. Tewarson, “Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods,” BIT,7, 226–239 (1967).

    Google Scholar 

  11. H. M. Markowitz, “The elimination form of the inverse and its application to linear programming,” Management Sci.,3, 255–269 (1957).

    Google Scholar 

  12. W. R. Spillers and N. Hickerson, “Optimal elimination for sparse symmetric systems as a graph problem,” Quart. Appl. Math.,26, 425–432 (1968).

    Google Scholar 

  13. T. N. Smirnova, Polynomial Calculations Using PRORABs on a Type M-20 Electronic Computer [in Russian], Nauka, Leningrad (1967).

    Google Scholar 

  14. T. N. Smirnova, A. A. Aleksandrova, Yu. V. Rybakova, and N. A. Solov'eva, “The PRORAB computer II1 (P, v)M-20,” Zap. Nauchn. Seminarov LOMI Akad. Nauk SSSR,18, 31–75 (1970).

    Google Scholar 

  15. T. N. Smirnova, E. M. Kostometova, and Yu. V. Rybakova, “On carrying out calculations in the PRORAB mode,” Zap. Nauchn. Seminarov LOMI Akad. Nauk SSSR,23, 132–137 (1971).

    Google Scholar 

  16. T. N. Smirnova and N. B. Malyshev, “On a certain approach to the problem orientation of electronic computers,” J. Sov. Math.,7, No. 1, 96–105 (1977).

    Google Scholar 

Download references

Authors

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 35, pp. 75–94, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kublanovskaya, V.N., Savinov, G.V. & Smirnova, T.N. On solving problems with sparse matrices. J Math Sci 7, 56–71 (1977). https://doi.org/10.1007/BF01846072

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01846072

Keywords

Navigation