Skip to main content
SpringerLink
Log in

Improvement of the two-step Richardson algorithm

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. A. V. Buledza, “Two-step versions of the iterative Richardson method,” Kibernetika, No. 2, 35–40 46 (1987).

    MathSciNet  Google Scholar 

  2. A. V. Buledza, “Modern issues in the development of the theory of iterative methods with Chebyshev acceleration,” Kibern. Sist. Anal., No. 4, 105–116 (1992).

    MATH  MathSciNet  Google Scholar 

  3. D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow-Leningrad (1963).

    Google Scholar 

  4. N. S. Bakhvalov, N. P. Zhidkov, and G. M. Kobel'kov, Numerical Methods [in Russian], Nauka, Moscow (1987).

    Google Scholar 

  5. V. I. Lebedev and S. A. Finogenov, “On the order of selection of iteration parameters in the Chebyshev cyclic iteration method,” Zh. Vychisl. Matem. i Mat. Fiziki,11, No. 2, 425–438 (1971).

    MathSciNet  Google Scholar 

Download references

Authors
  1. A. V. Buledza
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 166–169, November–December, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buledza, A.V. Improvement of the two-step Richardson algorithm. Cybern Syst Anal 31, 927–930 (1995). https://doi.org/10.1007/BF02366632

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation