Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Algorithmic aspects of the method of summary representations

  • 21 Accesses

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

Literature cited

  1. 1.

    V. L. Makarov, “Difference schemes with exact and explicit spectra,” Preprints 74-12, 74-13, Inst. Mat. Akad. Nauk Ukr. SSR, Kiev (1974), Chap. I, p. 10 and Chap. II, p. 9.

  2. 2.

    I. I. Lyashko and V. L. Makarov, “Basic methods of summary representations,” in: Mathematical Security É. Ts. V. M. [in Russian], Inst. Kibern. Akad. Nauk Ukr. SSR, Kiev (1972), pp. 64–78.

  3. 3.

    A. A. Samarskii and E. S. Nikolaev, Methods of Solving Network Equations [in Russian], Nauka, Moscow (1978).

  4. 4.

    P. N. Schwartztrauber, “A direct method for the discrete solution of separable elliptic equations,” SIAM J. Numer. Anal.,11, No. 6, 1136–1150 (1974).

  5. 5.

    V. P. Makarov, “Orthogonal polynomials and difference schemes with exact and explicit spectra,” Doctoral Dissertation, Phys. Math. Sci., Kiev (1974), p. 30.

  6. 6.

    G. N. Polozhii and V. L. Makarov, “Formulas for summary representations of an axisymmetric potential,” Vestn. Kiev. Univ.,8, 11–20 (1966).

  7. 7.

    G. N. Polozhii and V. L. Makarov, “A generalization of formulas for summary representations of an axisymmetric potential,” Vychisl. Prikl. Mat.,7, 38–56 (1969).

Download references

Author information

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 32, No. 4, pp. 515–522, July–August, 1980.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lyashko, I.I., Makarov, V.L. & Shmanenko, T.L. Algorithmic aspects of the method of summary representations. Ukr Math J 32, 357–362 (1980). https://doi.org/10.1007/BF01091991

Download citation

Keywords

  • Algorithmic Aspect
  • Summary Representation