Skip to main content
  • 586 Accesses

Abstract

Method of successive approximation for linear equations of the second kind, necessary and sufficient conditions for convergence, error estimate, sufficient conditions for convergence. Iteration methods for solution of linear equations of the first kind. Definition of multistep, one-step, cyclic linear iteration methods. General form of one-step linear iteration methods. Convergence rate.

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

Access this chapter

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 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Birkhäuser Boston

About this chapter

Cite this chapter

Lebedev, V.I. (1997). Iteration Methods for the Solution of Operator Equations. In: An Introduction to Functional Analysis in Computational Mathematics. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4128-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4128-7_3

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8666-0

  • Online ISBN: 978-1-4612-4128-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics