Skip to main content

Algorithm of Competing Processes for the Richardson Iteration Method with the Chebyshev Parameters

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10187))

Included in the following conference series:

  • 1869 Accesses

Abstract

A method for solving linear systems of equations with sign-definite self-adjoint operator matrix by the Richardson iteration method in case of the absence of information about the lower spectral bound of a problem is presented. The algorithm is based on the simultaneous operation of two competing iterative processes, the effectiveness of which is constantly analyzed. The method is explained on an example of one-dimensional steady-state heat equation.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Strang, G.: Linear Algebra and its Applications, 4th edn. Brooks/Cole/Cengage, Pacific Grove (2006)

    MATH  Google Scholar 

  2. Popov, M.V., Poveschenko, Y., Gasilov, V.A., Koldoba, A.V., Poveschenko, T.S.: Application of the Richardson iteration method with the Chebyshev parameters in case of the absence of information about the lower spectral bound. Math. Models Comput. Simul. 9(4) (2017)

    Google Scholar 

  3. Samarskii, A.A.: The Theory of Difference Schemes. Marcel Dekker Inc., New York City (2001)

    Book  MATH  Google Scholar 

  4. Goncharov, V.L.: The Theory of Interpolation and Approximation of Functions. GosTekhIzdat (1954). (in Russian)

    Google Scholar 

  5. Kantorovich, L.V., Akilov, G.P.: Functional Analysis in Normed Spaces. Pergamon Press, Oxford (1964)

    MATH  Google Scholar 

  6. Samarskii, A.A., Nikolaev, E.S.: Numerical Methods for Grid Equations. Birkhauser Verlag AG, Basel (1988)

    Google Scholar 

  7. Lebedev, V.I., Finogenov, S.A.: Solution of the parameter ordering problem in Chebyshev iterative methods. USSR Comput. Math. Math. Phys. 13, 21–41 (1974)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This project has received funding from Russian Science Foundation (project no. 16-11-00100).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mikhail V. Popov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Popov, M.V., Poveschenko, Y.A., Popov, I.V., Gasilov, V.A., Koldoba, A.V. (2017). Algorithm of Competing Processes for the Richardson Iteration Method with the Chebyshev Parameters. In: Dimov, I., Faragó, I., Vulkov, L. (eds) Numerical Analysis and Its Applications. NAA 2016. Lecture Notes in Computer Science(), vol 10187. Springer, Cham. https://doi.org/10.1007/978-3-319-57099-0_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57099-0_64

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57098-3

  • Online ISBN: 978-3-319-57099-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics