Newton Homotopy Solution for Nonlinear Equations Using Maple14

Many numerical approaches have been suggested to solve nonlinear problems. Some of the methods utilize successive approximation procedure to ensure every step of computing will converge to the desired root and one of the most common problems is the improper initial values for the iterative methods. This study evaluates Palancz et.al’s. (2010) paper on solving nonlinear equations using linear homotopy method in Mathematica. In this paper, the Newton-homotopy method using start-system is implemented in Maple14, to solve several nonlinear problems. Comparisons of results obtained in terms of number of iterations and convergence rates show promising application of the Newton-homotopy method for nonlinear problems

Determination of multiple roots of nonlinear equations and applications

The final publication is available at Springer via https://dx.doi.org/10.1007/s10910-014-0460-8[EN] In this work we focus on the problem of approximating multiple roots of nonlinear equations. Multiple roots appear in some applications such as the compression of band-limited signals and the multipactor effect in electronic devices. We present a new family of iterative methods for multiple roots whose multiplicity is known. The methods are optimal in Kung-Traub's sense (Kung and Traub in J Assoc Comput Mach 21:643-651, [1]), because only three functional values per iteration are computed. By adding just one more function evaluation we make this family derivative free while preserving the convergence order. To check the theoretical results, we codify the new algorithms and apply them to different numerical examples.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia PAID-SP-2012-0474.Hueso Pagoaga, JL.; Martínez Molada, E.; Teruel Ferragud, C. (2015). Determination of multiple roots of nonlinear equations and applications. Journal of Mathematical Chemistry. 53(3):880-892. https://doi.org/10.1007/s10910-014-0460-8S880892533H.T. Kung, J.F. Traub, Optimal order of one-point and multi-point iteration. J. Assoc. Comput. Mach. 21, 643–651 (1974)W. Bi, H. Ren, Q. Wu, Three-step iterative methods with eighth-order convergence for solving nonlinear equations. J. Comput. Appl. Math. 255, 105–112 (2009)W. Bi, Q. Wu, H. Ren, A new family of eighth-order iterative methods for solving nonlinear equations. Appl. Math. Comput. 214, 236–245 (2009)A. Cordero, J.L. Hueso, E. Martínez, J.R. Torregrosa, New modifications of Potra-Pták’s method with optimal fourth and eighth order of convergence. J. Comput. Appl. Math. 234, 2969–2976 (2010)E. Schröder, Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann. 2, 317–365 (1870)C. Chun, B. Neta, A third-order modification of Newtons method for multiple roots. Appl. Math. Comput. 211, 474–479 (2009)Y.I. Kim, S.D. Lee, A third-order variant of NewtonSecant method finding a multiple zero. J. Chungcheong Math. Soc. 23(4), 845–852 (2010)B. Neta, Extension of Murakamis high-order nonlinear solver to multiple roots. Int. J. Comput. Math. 8, 1023–1031 (2010)H. Ren, Q. Wu, W. Bi, A class of two-step Steffensen type methods with fourth-order convergence. Appl. Math. Comput. 209, 206–210 (2009)Q. Zheng, J. Wang, P. Zhao, L. Zhang, A Steffensen-like method and its higher-order variants. Appl. Math. Comput. 214, 10–16 (2009)S. Amat, S. Busquier, On a Steffensen’s type method and its behavior for semismooth equations. Appl. Math. Comput. 177, 819–823 (2006)X. Feng, Y. He, High order iterative methods without derivatives for solving nonlinear equations. Appl. Math. Comput. 186, 1617–1623 (2007)A. Cordero, J.R. Torregrosa, A class of Steffensen type methods with optimal order of convergence. Appl. Math. Comput. doi: 10.1016/j.amc.2011.02.067F. Marvasti, A. Jain, Zero crossings, bandwidth compression, and restoration of nonlinearly distorted band-limited signals. J. Opt. Soc. Am. A 3, 651–654 (1986)S. Anza, C. Vicente, B. Gimeno, V.E. Boria, J. Armendáriz, Long-term multipactor discharge in multicarrier systems. Physics of Plasmas 14(8), 082–112 (2007)J.L. Hueso, E. Martínez, C. Teruel, New families of iterative methods with fourth and sixth order of convergence and their dynamics, in Proceedings of the 13th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2013, 24–27 June 2013A. Cordero, J.R. Torregrosa, Low-complexity root-finding iteration functions with no derivatives of any order of convergence. J. Comput. Appl. Math. doi: 10.10016/j.cam.2014.01.024 (2014)J.R. Sharma, R. Sharma, Modified Jarratt method for computing multiple roots. Appl. Math. Comput. 217, 878–881 (2010

Computing the first eigenvalue of the p-Laplacian via the inverse power method.

In this paper, we discuss a new method for computing the first Dirichlet eigenvalue of the p-Laplacian inspired by the inverse power method in finite dimensional linear algebra. The iterative technique is independent of the particular method used in solving the p-Laplacian equation and therefore can be made as efficient as the latter. The method is validated theoretically for any ball in Rn if p >1 and for any bounded domain in the particular case p = 2. For p >2 the method is validated numerically for the square

Computing the first eigenvalue of the p-Laplacian via the inverse power method.

In this paper, we discuss a new method for computing the first Dirichlet eigenvalue of the p-Laplacian inspired by the inverse power method in finite dimensional linear algebra. The iterative technique is independent of the particular method used in solving the p-Laplacian equation and therefore can be made as efficient as the latter. The method is validated theoretically for any ball in Rn if p >1 and for any bounded domain in the particular case p = 2. For p >2 the method is validated numerically for the square