Abstract
Let Φ be a linear and consistent but not necessarily convergent iteration (in the following it will also be called the basic iteration) with an iteration matrix M. Assume that for a starting iterate x0, the iterates
are computed. Up to now, the last computed iterate xm has been regarded as the result of an iteration Φ. The previously calculated xj (0 ≤ j ≤ m − 1) are forgotten.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Hackbusch, W. (1994). Semi-Iterative Methods. In: Iterative Solution of Large Sparse Systems of Equations. Applied Mathematical Sciences, vol 95. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4288-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4288-8_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8724-7
Online ISBN: 978-1-4612-4288-8
eBook Packages: Springer Book Archive