Abstract
We will now conclude our sight-seeing tour of the behaviour of discrete iterations by defining and analyzing a discrete Newton method. The usual Newton method (for a mapping F of ℝn → ℝn) is based on the concept of a derivative. Since we introduced a discrete derivative in the previous chapter, it seems very natural to try to carry over the ideas behind Newton’s method in the continuous setting into the discrete context.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robert, F. (1986). A Discrete Newton Method. In: Discrete Iterations. Springer Series in Computational Mathematics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61607-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-61607-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64882-3
Online ISBN: 978-3-642-61607-5
eBook Packages: Springer Book Archive