Skip to main content
Log in

Parallel algorithm for the solution of boundary-value problems for systems of differential equations

  • Published:
Cybernetics Aims and scope

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. V. N. Faddeeva and D. K. Faddeev, “Parallel computations in linear algebra,” Kibernetika, No. 6, 28–39 (1977).

    Google Scholar 

  2. Yu. M. Danilin, “Minimization methods that do not require the solution of one-dimensional minimization problems,” Dokl. Akad. Nauk SSSR,218, No. 3, 513–516 (1974).

    Google Scholar 

  3. A. P. Bulanyi and Yu. M. Danilin, “Quasi-Newtonian minimization algorithms based on the construction of systems of conjugate vectors,” Zh. Vychisl. Mat. Mat. Fiz.,18, No. 4, 877–885 (1978).

    Google Scholar 

  4. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  5. P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE Trans. Comput.,C-22, No. 8, 786–792 (1973).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 68–71, November–December, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glushkov, V.M., Pshenichnyi, B.N. & Bulanyi, A.P. Parallel algorithm for the solution of boundary-value problems for systems of differential equations. Cybern Syst Anal 16, 868–872 (1980). https://doi.org/10.1007/BF01069060

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation