Skip to main content

Triangular Iterative Methods

  • Chapter
Numerical Methods for Grid Equations

Abstract

In this chapter we study implicit two-level iterative methods whose operators B correspond to triangular matrices. In Section 1 we look at the Gauss-Seidel method and formulate sufficient conditions for its convergence. In Section 2, the successive over-relaxation method is investigated. Here the choice of the iteration parameter is examined, and an estimate is obtained for the spectral radius of the transformation operator. In Section 3 a general matrix iterative scheme is investigated, selection of the iterative parameter is examined, and the method is shown to converge in H A

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

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

© 1989 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Samarskii, A.A., Nikolaev, E.S. (1989). Triangular Iterative Methods. In: Numerical Methods for Grid Equations. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9142-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-9142-4_5

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-9923-9

  • Online ISBN: 978-3-0348-9142-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics