Abstract
For finding zeros or fixed points of set-valued maps, the fact that the space of convex, compact, nonempty sets of ℝn is not a vector space presents a major disadvantage. Therefore, fixed point iterations or variants of Newton’s method, in which the derivative is applied only to a smooth single-valued part of the set-valued map, are often applied for calculations. We will embed the set-valued map with convex, compact images (i.e. by embedding its images) and shift the problem to the Banach space of directed sets. This Banach space extends the arithmetic operations of convex sets and allows to consider the Fréchet-derivative or divided differences of maps that have embedded convex images. For the transformed problem, Newton’s method and the secant method in Banach spaces are applied via directed sets. The results can be visualized as usual nonconvex sets in ℝn.
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.
References
Aubin, J.-P.: Mutational and Morphological Analysis. Tools for Shape Evolution and Morphogenesis. Systems & Control: Foundations & Applications. Birkhäuser Boston Inc., Boston (1999)
Baier, R., Dellnitz, M., Hessel-von Molo, M., Kevrekidis, I.G., Sertl, S.: The computation of invariant sets via Newton’s method, 21 pages (May 2010) (submitted)
Baier, R., Farkhi, E.: Differences of Convex Compact Sets in the Space of Directed Sets. Part I: The Space of Directed Sets. Set-Valued Anal. 9(3), 217–245 (2001); Part II: Visualization of Directed Sets 9(3), 247–252 (2001)
Baier, R., Perria, G.: Set-valued Hermite interpolation. J. Approx. Theory 163(10), 1349–1372 (2011)
Dontchev, A.L., Hager, W.W., Veliov, V.M.: Uniform convergence and mesh independence of Newton’s method for discretized variational problems. SIAM J. Control Optim. 39(3), 961–980 (2000) (electronic)
Dontchev, A.L., Veliov, V.M.: Metric regularity under approximations. Control Cybernet. 38(4B), 1283–1303 (2009)
Li, C., Zhang, W.H., Jin, X.Q.: Convergence and uniqueness properties of Gauss-Newton’s method. Comput. Math. Appl. 47(6-7), 1057–1067 (2004)
Perria, G.: Set-valued interpolation. Bayreuth. Math. Schr. 79, 154 pages (2007)
Potra, F.-A.: An error analysis for the secant method. Numer. Math. 38(3), 427–445 (1981/1982)
Saint-Pierre, P.: Newton and other continuation methods for multivalued inclusions. Set-Valued Anal. 3(2), 143–156 (1995)
Schmidt, J.W.: Eine Übertragung der Regula Falsi auf Gleichungen in Banachräumen. II. Nichtlineare Gleichungssysteme. Z. Angew. Math. Mech. 43(3), 97–110 (1963)
Yamamoto, T.: A method for finding sharp error bounds for Newton’s method under the Kantorovich assumptions. Numer. Math. 49(2-3), 203–220 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baier, R., Molo, M.Hv. (2012). Newton’s Method and Secant Method for Set-Valued Mappings. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2011. Lecture Notes in Computer Science, vol 7116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29843-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-29843-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29842-4
Online ISBN: 978-3-642-29843-1
eBook Packages: Computer ScienceComputer Science (R0)