Skip to main content
SpringerLink
Log in

Analysis of programs of certain computational algorithms realized on a large-block model machine

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

Abstract

A general description of a large-block model machine is presented, and also the results of an analysis of certain linear algebra problems with very sparse quantities realized on this machine.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. L. V. Kantorovich, “Trends of development of automatic programming on the basis of large-block systems,” Tr. Mat. Inst., Akad. Nauk SSSR,96, 5–15 (1968).

    Google Scholar 

  2. L. V. Kantorovich, “Development of hardware for solving large-scale problems of optimal planning and control. Optimization,” Collection of Papers of the Siberian Branch of the Academy of Sciences of the USSR, Inst. of Mathematics,6(23), 5–7 (1972).

    Google Scholar 

  3. L. V. Kantorovich, “Prospects of large-block approach in applied mathematics, programming, and computer technology,” J. Sov. Math.,10, No. 5, 643–647 (1978).

    Google Scholar 

  4. T. N. Smirnova and N. B. Malyshev, “A method of problem orientation of computers,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst., Akad. Nauk SSSR,35, 122–127 (1973).

    Google Scholar 

  5. V. N. Kublanovskaya, G. V. Savinov, and T. N. Smirnova, “On solving problems with sparse matrices,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst., Akad. Nauk SSSR,35, 75–94 (1973).

    Google Scholar 

  6. R. P. Tewarson, “On the product form of inverses of sparse matrices,” SIAM J. Review,8, 336–342 (1966).

    Google Scholar 

  7. K. Zollenkopf, “Bi-factorization — basic computational algorithm and programming techniques,” “Large sparse sets linear equat.” 75–95, Discuss, 96, London-New York (1971).

  8. V. T. Chen and R. P. Tewarson, “On the fill-in when sparse vectors are orthonormalized,” Computing (Arch. Elektron. Rechnen),9, 23–25 (1972).

    Google Scholar 

Download references

Authors
  1. T. N. Smirnova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 48, pp. 189–199, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smirnova, T.N. Analysis of programs of certain computational algorithms realized on a large-block model machine. J Math Sci 10, 788–796 (1978). https://doi.org/10.1007/BF01083969

Download citation

  • Issue Date:

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

Keywords

Search

Navigation