Domain of Existence and Uniqueness for Nonlinear Hammerstein Integral Equations

[EN] In this work, we performed an study about the domain of existence and uniqueness for an efficient fifth order iterative method for solving nonlinear problems treated in their infinite dimensional form. The hypotheses for the operator and starting guess are weaker than in the previous studies. We assume omega continuity condition on second order Frechet derivative. This fact it is motivated by showing different problems where the nonlinear operators that define the equation do not verify Lipschitz and Holder condition; however, these operators verify the omega condition established. Then, the semilocal convergence balls are obtained and the R-order of convergence and error bounds can be obtained by following thee main theorem. Finally, we perform a numerical experience by solving a nonlinear Hammerstein integral equations in order to show the applicability of the theoretical results by obtaining the existence and uniqueness balls.This research was partially supported by Ministerio de Economia y Competitividad under grant PGC2018-095896-B-C22.Singh, S.; Martínez Molada, E.; Kumar, A.; Gupta, DK. (2020). Domain of Existence and Uniqueness for Nonlinear Hammerstein Integral Equations. Mathematics. 8(3):1-11. https://doi.org/10.3390/math8030384S11183Hernández, M. A. (2001). Chebyshev’s approximation algorithms and applications. Computers & Mathematics with Applications, 41(3-4), 433-445. doi:10.1016/s0898-1221(00)00286-8Amat, S., Hernández, M. A., & Romero, N. (2008). A modified Chebyshev’s iterative method with at least sixth order of convergence. Applied Mathematics and Computation, 206(1), 164-174. doi:10.1016/j.amc.2008.08.050Argyros, I. K., Ezquerro, J. A., Gutiérrez, J. M., Hernández, M. A., & Hilout, S. (2011). On the semilocal convergence of efficient Chebyshev–Secant-type methods. Journal of Computational and Applied Mathematics, 235(10), 3195-3206. doi:10.1016/j.cam.2011.01.005Hueso, J. L., & Martínez, E. (2013). Semilocal convergence of a family of iterative methods in Banach spaces. Numerical Algorithms, 67(2), 365-384. doi:10.1007/s11075-013-9795-7Zhao, Y., & Wu, Q. (2008). Newton–Kantorovich theorem for a family of modified Halley’s method under Hölder continuity conditions in Banach space. Applied Mathematics and Computation, 202(1), 243-251. doi:10.1016/j.amc.2008.02.004Parida, P. K., & Gupta, D. K. (2007). Recurrence relations for a Newton-like method in Banach spaces. Journal of Computational and Applied Mathematics, 206(2), 873-887. doi:10.1016/j.cam.2006.08.027Parida, P. K., & Gupta, D. K. (2008). Recurrence relations for semilocal convergence of a Newton-like method in Banach spaces. Journal of Mathematical Analysis and Applications, 345(1), 350-361. doi:10.1016/j.jmaa.2008.03.064Cordero, A., Ezquerro, J. A., Hernández-Verón, M. A., & Torregrosa, J. R. (2015). On the local convergence of a fifth-order iterative method in Banach spaces. Applied Mathematics and Computation, 251, 396-403. doi:10.1016/j.amc.2014.11.084Argyros, I. K., & Hilout, S. (2013). On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. Journal of Computational and Applied Mathematics, 245, 1-9. doi:10.1016/j.cam.2012.12.002Argyros, I. K., George, S., & Magreñán, Á. A. (2015). Local convergence for multi-point-parametric Chebyshev–Halley-type methods of high convergence order. Journal of Computational and Applied Mathematics, 282, 215-224. doi:10.1016/j.cam.2014.12.023Wang, X., Kou, J., & Gu, C. (2012). Semilocal Convergence of a Class of Modified Super-Halley Methods in Banach Spaces. Journal of Optimization Theory and Applications, 153(3), 779-793. doi:10.1007/s10957-012-9985-9Argyros, I. K., & Magreñán, Á. A. (2015). A study on the local convergence and the dynamics of Chebyshev–Halley–type methods free from second derivative. Numerical Algorithms, 71(1), 1-23. doi:10.1007/s11075-015-9981-xWu, Q., & Zhao, Y. (2007). Newton–Kantorovich type convergence theorem for a family of new deformed Chebyshev method. Applied Mathematics and Computation, 192(2), 405-412. doi:10.1016/j.amc.2007.03.018Martínez, E., Singh, S., Hueso, J. L., & Gupta, D. K. (2016). Enlarging the convergence domain in local convergence studies for iterative methods in Banach spaces. Applied Mathematics and Computation, 281, 252-265. doi:10.1016/j.amc.2016.01.036Kumar, A., Gupta, D. K., Martínez, E., & Singh, S. (2018). Semilocal convergence of a Secant-type method under weak Lipschitz conditions in Banach spaces. Journal of Computational and Applied Mathematics, 330, 732-741. doi:10.1016/j.cam.2017.02.042Singh, S., Gupta, D. K., Martínez, E., & Hueso, J. L. (2016). Semilocal Convergence Analysis of an Iteration of Order Five Using Recurrence Relations in Banach Spaces. Mediterranean Journal of Mathematics, 13(6), 4219-4235. doi:10.1007/s00009-016-0741-

Semilocal Convergence Analysis of an Iteration of Order Five Using Recurrence Relations in Banach Spaces

[EN] Semilocal convergence for an iteration of order five for solving nonlinear equations in Banach spaces is established under second-order Fr,chet derivative satisfying the Lipschitz condition. It is done by deriving a number of recurrence relations. A theorem for the existence-uniqueness along with the estimation of error bounds of the solution is established. Its R-order is shown to be equal to five. Both efficiency and computational efficiency indices are given. A variety of examples are worked out to show its applicability. In comparison to existing methods having similar R-orders, improved results in terms of computational efficiency index and error bounds are found using our methodology.The authors thank the referees for their valuable comments which have improved the presentation of the paper. The authors thankfully acknowledge the financial assistance provided by Council of Scientific and Industrial Research (CSIR), New Delhi, India.Singh, S.; Gupta, D.; Martínez Molada, E.; Hueso Pagoaga, JL. (2016). Semilocal Convergence Analysis of an Iteration of Order Five Using Recurrence Relations in Banach Spaces. Mediterranean Journal of Mathematics. 13(6):4219-4235. doi:10.1007/s00009-016-0741-5S42194235136Cordero A., Hueso J.L., Martinez E., Torregrosa J.R.: Increasing the convergence order of an iterative method for nonlinear systems. Appl. Math. Lett. 25, 2369–2374 (2012)Chen, L., Gu, C., Ma Y.: Semilocal convergence for a fifth order Newton’s method using Recurrence relations in Banach spaces. J. Appl. Math. 2011, 1–15 (2011)Wang X., Kou J., Gu C.: Semilocal convergence of a sixth order Jarrat method in Banach spaces. Numer. Algorithms 57, 441–456 (2011)Zheng L., Gu C.: Semilocal convergence of a sixth order method in Banach spaces. Numer. Algorithms 61, 413–427 (2012)Zheng L., Gu C.: Recurrence relations for semilocal convergence of a fifth order method in Banach spaces. Numer. Algorithms 59, 623–638 (2012)Proinov P.D., Ivanov S.I.: On the convergence of Halley’s method for multiple polynomial zeros. Mediterr. J. Math. 12, 555–572 (2015)Ezquerro, J.A., Hernández-Verón M.A.: On the domain of starting points of Newton’s method under center lipschitz conditions. Mediterr. J. Math. (2015). doi: 10.1007/s00009-015-0596-1Cordero A., Hernández-Verón M.A., Romero N., Torregrosa J.R.: Semilocal convergence by using recurrence relations for a fifth-order method in Banach spaces. J. Comput. Appl. Math. 273, 205–213 (2015)Parida P.K., Gupta D.K.: Recurrence relations for a Newton-like method in Banach spaces. J. Comput. Appl. Math. 206, 873–887 (2007)Hueso J.L., Martínez E.: Semilocal convergence of a family of iterative methods in Banach spaces. Numer. Algorithms 67, 365–384 (2014)Argyros, I.K., Hilout S.: Numerical methods in nonlinear analysis. World Scientific Publ. Comp., New Jersey (2013)Argyros, I.K., Hilout, S., Tabatabai, M.A.: Mathematical modelling with applications in biosciences and engineering. Nova Publishers, New York (2011)Argyros I.K., Khattri S.K.: Local convergence for a family of third order methods in Banach spaces. J. Math. 46, 53–62 (2004)Argyros I.K., Hilout A.S.: On the local convergence of fast two-step Newton-like methods for solving nonlinear equations. J. Comput. Appl. Math. 245, 1–9 (2013)Kantorovich, L.V., Akilov G.P.: Functional analysis. Pergamon Press, Oxford (1982)Argyros I.K., George S., Magreñán A.A.: Local convergence for multi-point-parametric Chebyshev-Halley-type methods of higher convergence order. J. Comput. Appl. Math. 282, 215–224 (2015)Argyros I.K., Magreñán A.A.: A study on the local convergence and the dynamics of Chebyshev-Halley-type methods free from second derivative. Numer. Algorithms 71, 1–23 (2015)Amat S., Hernández M.A., Romero N.: A modified Chebyshev’s iterative method with at least sixth order of convergence. Appl. Math. Comput. 206, 164–174 (2008)Chun, C., St $${\breve{a}}$$ a ˘ nic $${\breve{a}}$$ a ˘ , P., Neta, B.: Third-order family of methods in Banach spaces. Comput. Math. Appl. 61, 1665–1675 (2011)Ostrowski, A.M.: Solution of equations in Euclidean and Banach spaces, 3rd edn. Academic Press, New-York (1977)Jaiswal J.P.: Semilocal convergence of an eighth-order method in Banach spaces and its computational efficiency. Numer. Algorithms 71, 933–951 (2015)Traub, J.F.: Iterative methods for the solution of equations. Prentice-Hall, Englewood Cliffs (1964

Convergence Theorem for a Family of New Modified Halley’s Method in Banach Space

We establish convergence theorems of Newton-Kantorovich type for a family of new modified Halley’s method in Banach space to solve nonlinear operator equations. We present the corresponding error estimate. To show the application of our theorems, two numerical examples are given

Third-Order Newton-Type Methods Combined with Vector Extrapolation for Solving Nonlinear Systems

We present a third-order method for solving the systems of nonlinear equations. This method is a Newton-type scheme with the vector extrapolation. We establish the local and semilocal convergence of this method. Numerical results show that the composite method is more robust and efficient than a number of Newton-type methods with the other vector extrapolations

Estudio sobre convergencia y dinámica de los métodos de Newton, Stirling y alto orden

Las matemáticas, desde el origen de esta ciencia, han estado al servicio de la sociedad tratando de dar respuesta a los problemas que surgían. Hoy en día sigue siendo así, el desarrollo de las matemáticas está ligado a la demanda de otras ciencias que necesitan dar solución a situaciones concretas y reales. La mayoría de los problemas de ciencia e ingeniería no pueden resolverse usando ecuaciones lineales, es por tanto que hay que recurrir a las ecuaciones no lineales para modelizar dichos problemas (Amat, 2008; véase también Argyros y Magreñán, 2017, 2018), entre otros. El conflicto que presentan las ecuaciones no lineales es que solo en unos pocos casos es posible encontrar una solución única, por tanto, en la mayor parte de los casos, para resolverlas hay que recurrir a los métodos iterativos. Los métodos iterativos generan, a partir de un punto inicial, una sucesión que puede converger o no a la solución

On an iterative algorithm of Ulm-type for solving equations

We provide a semilocal convergence analysis of an iterative algorithm for solving nonlinear operator equations in a Banach space setting. This algorithm is of order $1.839\ldots$, and has already been studied in [3, 8, 18, 20]. Using our new idea of recurrent functions we show that a finer analysis is possible with sufficient convergence conditions that can be weaker than before, and under the same computational cost. Numerical examples are also provided in this study

A Higher Order Chebyshev-Halley-Type Family of Iterative Methods for Multiple Roots

[EN] The aim of this paper is to introduce new high order iterative methods for multiple roots of the nonlinear scalar equation; this is a demanding task in the area of computational mathematics and numerical analysis. Specifically, we present a new Chebyshev¿Halley-type iteration function having at least sixth-order convergence and eighth-order convergence for a particular value in the case of multiple roots. With regard to computational cost, each member of our scheme needs four functional evaluations each step. Therefore, the maximum efficiency index of our scheme is 1.6818 for ¿ = 2,which corresponds to an optimal method in the sense of Kung and Traub¿s conjecture. We obtain the theoretical convergence order by using Taylor developments. Finally, we consider some real-life situations for establishing some numerical experiments to corroborate the theoretical results.This research was partially supported by Ministerio de Economia y Competitividad under Grant MTM2014-52016-C2-1-2-P and by the project of Generalitat Valenciana Prometeo/2016/089Behl, R.; Martínez Molada, E.; Cevallos-Alarcon, FA.; Alarcon-Correa, D. (2019). A Higher Order Chebyshev-Halley-Type Family of Iterative Methods for Multiple Roots. Mathematics. 7(4):1-12. https://doi.org/10.3390/math7040339S11274Gutiérrez, J. M., & Hernández, M. A. (1997). A family of Chebyshev-Halley type methods in Banach spaces. Bulletin of the Australian Mathematical Society, 55(1), 113-130. doi:10.1017/s0004972700030586Kanwar, V., Singh, S., & Bakshi, S. (2008). Simple geometric constructions of quadratically and cubically convergent iterative functions to solve nonlinear equations. Numerical Algorithms, 47(1), 95-107. doi:10.1007/s11075-007-9149-4Argyros, I. K., Ezquerro, J. A., Gutiérrez, J. M., Hernández, M. A., & Hilout, S. (2011). On the semilocal convergence of efficient Chebyshev–Secant-type methods. Journal of Computational and Applied Mathematics, 235(10), 3195-3206. doi:10.1016/j.cam.2011.01.005Xiaojian, Z. (2008). Modified Chebyshev–Halley methods free from second derivative. Applied Mathematics and Computation, 203(2), 824-827. doi:10.1016/j.amc.2008.05.092Amat, S., Hernández, M. A., & Romero, N. (2008). A modified Chebyshev’s iterative method with at least sixth order of convergence. Applied Mathematics and Computation, 206(1), 164-174. doi:10.1016/j.amc.2008.08.050Kou, J., & Li, Y. (2007). Modified Chebyshev–Halley methods with sixth-order convergence. Applied Mathematics and Computation, 188(1), 681-685. doi:10.1016/j.amc.2006.10.018Li, D., Liu, P., & Kou, J. (2014). An improvement of Chebyshev–Halley methods free from second derivative. Applied Mathematics and Computation, 235, 221-225. doi:10.1016/j.amc.2014.02.083Sharma, J. R. (2015). Improved Chebyshev–Halley methods with sixth and eighth order convergence. Applied Mathematics and Computation, 256, 119-124. doi:10.1016/j.amc.2015.01.002Neta, B. (2010). Extension of Murakami’s high-order non-linear solver to multiple roots. International Journal of Computer Mathematics, 87(5), 1023-1031. doi:10.1080/00207160802272263Zhou, X., Chen, X., & Song, Y. (2011). Constructing higher-order methods for obtaining the multiple roots of nonlinear equations. Journal of Computational and Applied Mathematics, 235(14), 4199-4206. doi:10.1016/j.cam.2011.03.014Hueso, J. L., Martínez, E., & Teruel, C. (2014). Determination of multiple roots of nonlinear equations and applications. Journal of Mathematical Chemistry, 53(3), 880-892. doi:10.1007/s10910-014-0460-8Behl, R., Cordero, A., Motsa, S. S., & Torregrosa, J. R. (2015). On developing fourth-order optimal families of methods for multiple roots and their dynamics. Applied Mathematics and Computation, 265, 520-532. doi:10.1016/j.amc.2015.05.004Behl, R., Cordero, A., Motsa, S. S., Torregrosa, J. R., & Kanwar, V. (2015). An optimal fourth-order family of methods for multiple roots and its dynamics. Numerical Algorithms, 71(4), 775-796. doi:10.1007/s11075-015-0023-5Geum, Y. H., Kim, Y. I., & Neta, B. (2015). A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics. Applied Mathematics and Computation, 270, 387-400. doi:10.1016/j.amc.2015.08.039Geum, Y. H., Kim, Y. I., & Neta, B. (2016). A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points. Applied Mathematics and Computation, 283, 120-140. doi:10.1016/j.amc.2016.02.029Behl, R., Alshomrani, A. S., & Motsa, S. S. (2018). An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence. Journal of Mathematical Chemistry, 56(7), 2069-2084. doi:10.1007/s10910-018-0857-xMcNamee, J. M. (1998). A comparison of methods for accelerating convergence of Newton’s method for multiple polynomial roots. ACM SIGNUM Newsletter, 33(2), 17-22. doi:10.1145/290590.290592Cordero, A., & Torregrosa, J. R. (2007). Variants of Newton’s Method using fifth-order quadrature formulas. Applied Mathematics and Computation, 190(1), 686-698. doi:10.1016/j.amc.2007.01.06

Extended domain for fifth convergence order schemes

We provide a local as well as a semi-local analysis of a fifth convergence order scheme involving operators valued on Banach space for solving nonlinear equations. The convergence domain is extended resulting a finer convergence analysis for both types. This is achieved by locating a smaller domain included in the older domain leading this way to tighter Lipschitz type functions. These extensions are obtained without additional hypotheses. Numerical examples are used to test the convergence criteria and also to show the superiority for our results over earlier ones. Our idea can be utilized to extend other schemes using inverses in a similar way

Aproximación de ecuaciones diferenciales mediante una nueva técnica variacional y aplicaciones

[SPA] En esta Tesis presentamos el estudio teórico y numérico de sistemas de ecuaciones diferenciales basado en el análisis de un funcional asociado de forma natural al problema original. Probamos que cuando se utiliza métodos del descenso para minimizar dicho funcional, el algoritmo decrece el error hasta obtener la convergencia dada la no existencia de mínimos locales diferentes a la solución original. En cierto sentido el algoritmo puede considerarse un método tipo Newton globalmente convergente al estar basado en una linearización del problema. Se han estudiado la aproximación de ecuaciones diferenciales rígidas, de ecuaciones rígidas con retardo, de ecuaciones algebraico‐diferenciales y de problemas hamiltonianos. Esperamos que esta nueva técnica variacional pueda usarse en otro tipo de problemas diferenciales. [ENG] This thesis is devoted to the study and approximation of systems of differential equations based on an analysis of a certain error functional associated, in a natural way, with the original problem. We prove that in seeking to minimize the error by using standard descent schemes, the procedure can never get stuck in local minima, but will always and steadily decrease the error until getting to the original solution. One main step in the procedure relies on a very particular linearization of the problem, in some sense it is like a globally convergent Newton type method. We concentrate on the approximation of stiff systems of ODEs, DDEs, DAEs and Hamiltonian systems. In all these problems we need to use implicit schemes. We believe that this approach can be used in a systematic way to examine other situations and other types of equations.Universidad Politécnica de Cartagen

Second order strategies for complementarity problems

Orientadores: Sandra Augusta Santos, Roberto AndreaniTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação CientificaResumo: Neste trabalho reformulamos o problema de complementaridade não linear generalizado (GNCP) em cones poliedrais como um sistema não linear com restrição de não negatividade em algumas variáveis, e trabalhamos na resolução de tal reformulação por meio de estratégias de pontos interiores. Em particular, definimos dois algoritmos e provamos a convergência local de tais algoritmos sob hipóteses usuais. O primeiro algoritmo é baseado no método de Newton, e o segundo, no método tensorial de Chebyshev. O algoritmo baseado no método de Chebyshev pode ser visto como um método do tipo preditor-corretor. Tal algoritmo, quando aplicado a problemas em que as funções envolvidas são afins, e com escolhas adequadas dos parâmetros, torna-se o bem conhecido algoritmo preditor-corretor de Mehrotra. Também apresentamos resultados numéricos que ilustram a competitividade de ambas as propostas.Abstract: In this work we reformulate the generalized nonlinear complementarity problem (GNCP) in polyhedral cones as a nonlinear system with nonnegativity in some variables and propose the resolution of such reformulation through interior-point methods. In particular we define two algorithms and prove the local convergence of these algorithms under standard assumptions. The first algorithm is based on Newton's method and the second, on the Chebyshev's tensorial method. The algorithm based on Chebyshev's method may be considered a predictor-corrector one. Such algorithm, when applied to problems for which the functions are affine, and the parameters are properly chosen, turns into the well-known Mehrotra's predictor corrector algorithm. We also present numerical results that illustrate the competitiveness of both proposals.DoutoradoOtimizaçãoDoutor em Matemática Aplicad