Abstract
In this paper we introduce a monotone Newton-like method for the computations of fixed points of a class of nonlinear operators in ordered Banach spaces. We use a Lakshmikantham’s fixed point theorem [4, Theorem 1.2] and the classical Banach fixed point theorem to prove the convergence of this method. We prove also that under a suitable condition, the rate of convergence of the proposed method is superlinear. As an application we consider a class of nonlinear matrix equations.
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
Guo, D., Cho, Y.J., Zhu, J.: Partial ordering methods in nonlinear problems. Nova Science Publishers (2004)
Guo, D., Lakshmikantham, V.: Nonlinear Problems in Abstract Cones. Academic Press, New York (1988)
Krasnoselskii, M.: Positive Solutions of Operator Equations. Noordhoff, Groningen (1964)
Lakshmikantham, V., Carl, S., Heikkilä, S.: Fixed point theorems in ordered Banach spaces via quasilinearization. Nonlinear Analysis: Theory, Methods & Applications, 3448–3458 (2009)
Long, J.H.: On the Hermitian positive definite solution of the nonlinear matrix equation X + A ∗ X − 1 A + B ∗ X − 1 B = I. Bull. Braz. Math. Soc., New Series. Sociedade Brasileira de Matematica 39(3), 371–386 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mouhadjer, L., Benahmed, B. (2015). A Monotone Newton-Like Method for the Computation of Fixed Points. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham. https://doi.org/10.1007/978-3-319-18161-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-18161-5_29
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18160-8
Online ISBN: 978-3-319-18161-5
eBook Packages: EngineeringEngineering (R0)