56,742 research outputs found
An efficient two-parametric family with memory for nonlinear equations
A new two-parametric family of derivative-free iterative methods for solving nonlinear equations is presented. First, a new biparametric family without memory of optimal order four is proposed. The improvement of the convergence rate of this family is obtained by using two self-accelerating parameters. These varying parameters are calculated in each iterative step employing only information from the current and the previous iteration. The corresponding R-order is 7 and the efficiency index 7(1/3) = 1.913. Numerical examples and comparison with some existing derivative-free optimal eighth-order schemes are included to confirm the theoretical results. In addition, the dynamical behavior of the designed method is analyzed and shows the stability of the scheme.The second author wishes to thank the Islamic Azad University, Hamedan Branch, where the paper was written as a part of the research plan, for financial support.Cordero Barbero, A.; Lotfi, T.; Bakhtiari, P.; Torregrosa Sánchez, JR. (2015). An efficient two-parametric family with memory for nonlinear equations. Numerical Algorithms. 68(2):323-335. doi:10.1007/s11075-014-9846-8S323335682Kung, H.T., Traub, J.F.: Optimal order of one-point and multi-point iteration. J. Assoc. Comput. Math. 21, 643–651 (1974)Cordero, A., Hueso, J.L., MartÃnez, E., Torregrosa, J.R.: A new technique to obtain derivative-free optimal iterative methods for solving nonlinear equation. J. Comput. Appl. Math. 252, 95–102 (2013)Cordero, A., Torregrosa, J.R., Vassileva, M.P.: Pseudocomposition: a technique to design predictor-corrector methods for systems of nonlinear equations. Appl. Math. Comput. 218, 11496–11508 (2012)Džunić, J.: On efficient two-parameter methods for solving nonlinear equations. Numer. Algorithms. 63(3), 549–569 (2013)Džunić, J., Petković, M.S.: On generalized multipoint root-solvers with memory. J. Comput. Appl. Math. 236, 2909–2920 (2012)Petković, M.S., Neta, B., Petković, L.D., Džunić, J. (ed.).: Multipoint methods for solving nonlinear equations. Elsevier (2013)Sharma, J.R., Sharma, R.: A new family of modified Ostrowski’s methods with accelerated eighth order convergence. Numer. Algorithms 54, 445–458 (2010)Soleymani, F., Shateyi, S.: Two optimal eighth-order derivative-free classes of iterative methods. Abstr. Appl. Anal. 2012(318165), 14 (2012). doi: 10.1155/2012/318165Soleymani, F., Sharma, R., Li, X., Tohidi, E.: An optimized derivative-free form of the Potra-Pták methods. Math. Comput. Model. 56, 97–104 (2012)Thukral, R.: Eighth-order iterative methods without derivatives for solving nonlinear equations. ISRN Appl. Math. 2011(693787), 12 (2011). doi: 10.5402/2011/693787Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, New York (1964)Wang, X., Džunić, J., Zhang, T.: On an efficient family of derivative free three-point methods for solving nonlinear equations. Appl. Math. Comput. 219, 1749–1760 (2012)Zheng, Q., Li, J., Huang, F.: An optimal Steffensen-type family for solving nonlinear equations. Appl. Math. Comput. 217, 9592–9597 (2011)Ortega, J.M., Rheinboldt, W.G. (ed.).: Iterative Solutions of Nonlinear Equations in Several Variables, Ed. Academic Press, New York (1970)Jay, I.O.: A note on Q-order of convergence. BIT Numer. Math. 41, 422–429 (2001)Blanchard, P.: Complex Analytic Dynamics on the Riemann Sphere. Bull. AMS 11(1), 85–141 (1984)Chicharro, F., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameters planes of iterative families and methods. arXiv: 1307.6705 [math.NA
Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters
[EN] In this paper, we propose a family of optimal eighth order convergent iterative methods for multiple roots with known multiplicity with the introduction of two free parameters and three univariate weight functions. Also numerical experiments have applied to a number of academical test functions and chemical problems for different special schemes from this family that satisfies the conditions given in convergence result.This research was partially supported by Ministerio de Economia y Competitividad MTM2014-52016-C02-2-P and Generalitat Valenciana PROMETEO/2016/089.Zafar, F.; Cordero Barbero, A.; Quratulain, R.; Torregrosa Sánchez, JR. (2018). Optimal iterative methods for finding multiple roots of nonlinear equations using free parameters. Journal of Mathematical Chemistry. 56(7):1884-1901. https://doi.org/10.1007/s10910-017-0813-1S18841901567R. Behl, A. Cordero, S.S. Motsa, J.R. Torregrosa, On developing fourth-order optimal families of methods for multiple roots and their dynamics. Appl. Math. Comput. 265(15), 520–532 (2015)R. Behl, A. Cordero, S.S. Motsa, J.R. Torregrosa, V. Kanwar, An optimal fourth-order family of methods for multiple roots and its dynamics. Numer. Algor. 71(4), 775–796 (2016)R. Behl, A. Cordero, S.S. Motsa, J.R. Torregrosa, An eighth-order family of optimal multiple root finders and its dynamics. Numer. Algor. (2017). doi: 10.1007/s11075-017-0361-6F.I. Chicharro, A. Cordero, J. R. Torregrosa, Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. ID 780153 (2013)A. Constantinides, N. Mostoufi, Numerical Methods for Chemical Engineers with MATLAB Applications (Prentice Hall PTR, New Jersey, 1999)J.M. Douglas, Process Dynamics and Control, vol. 2 (Prentice Hall, Englewood Cliffs, 1972)Y.H. Geum, Y.I. Kim, B. Neta, A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics. Appl. Math. Comput. 270, 387–400 (2015)Y.H. Geum, Y.I. Kim, B. Neta, A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points. Appl. Math. Comput. 283, 120–140 (2016)J.L. Hueso, E. Martınez, C. Teruel, Determination of multiple roots of nonlinear equations and applications. J. Math. Chem. 53, 880–892 (2015)L.O. Jay, A note on Q-order of convergence. BIT Numer. Math. 41, 422–429 (2001)S. Li, X. Liao, L. Cheng, A new fourth-order iterative method for finding multiple roots of nonlinear equations. Appl. Math. Comput. 215, 1288–1292 (2009)S.G. Li, L.Z. Cheng, B. Neta, Some fourth-order nonlinear solvers with closed formulae for multiple roots. Comput. Math. Appl. 59, 126–135 (2010)B. Liu, X. Zhou, A new family of fourth-order methods for multiple roots of nonlinear equations. Nonlinear Anal. Model. Control 18(2), 143–152 (2013)M. Shacham, Numerical solution of constrained nonlinear algebraic equations. Int. J. Numer. Method Eng. 23, 1455–1481 (1986)M. Sharifi, D.K.R. Babajee, F. Soleymani, Finding the solution of nonlinear equations by a class of optimal methods. Comput. Math. Appl. 63, 764–774 (2012)J.R. Sharma, R. Sharma, Modified Jarratt method for computing multiple roots. Appl. Math. Comput. 217, 878–881 (2010)F. Soleymani, D.K.R. Babajee, T. Lofti, On a numerical technique forfinding multiple zeros and its dynamic. J. Egypt. Math. Soc. 21, 346–353 (2013)F. Soleymani, D.K.R. Babajee, Computing multiple zeros using a class of quartically convergent methods. Alex. Eng. J. 52, 531–541 (2013)R. Thukral, A new family of fourth-order iterative methods for solving nonlinear equations with multiple roots. J. Numer. Math. Stoch. 6(1), 37–44 (2014)R. Thukral, Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations. J. Math. Article ID 404635 (2013)X. Zhou, X. Chen, Y. Song, Constructing higher-order methods for obtaining the muliplte roots of nonlinear equations. J. Comput. Math. Appl. 235, 4199–4206 (2011)X. Zhou, X. Chen, Y. Song, Families of third and fourth order methods for multiple roots of nonlinear equations. Appl. Math. Comput. 219, 6030–6038 (2013
On improved three-step schemes with high efficiency index and their dynamics
This paper presents an improvement of the sixth-order method of Chun and Neta as a class of three-step iterations with optimal efficiency index, in the sense of Kung-Traub conjecture. Each member of the presented class reaches the highest possible order using four functional evaluations. Error analysis will be studied and numerical examples are also made to support the theoretical results. We then present results which describe the dynamics of the presented optimal methods for complex polynomials. The basins of attraction of the existing optimal methods and our methods are presented and compared to illustrate their performances.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and FONDOCYT Republica Dominicana.Babajee, DKR.; Cordero Barbero, A.; Soleymani, F.; Torregrosa Sánchez, JR. (2014). On improved three-step schemes with high efficiency index and their dynamics. Numerical Algorithms. 65(1):153-169. https://doi.org/10.1007/s11075-013-9699-6S153169651Pang, J.S., Chan, D.: Iterative methods for variational and complementary problems. Math. Program. 24(1), 284–313 (1982)Sun, D.: A class of iterative methods for solving nonlinear projection equations. J. Optim. Theory Appl. 91(1), 123–140 (1996)Chun, C., Neta, B.: A new sixth-order scheme for nonlinear equations. Appl. Math. Lett. 25, 185–189 (2012)Kung, H.T., Traub, J.F.: Optimal order of one-point and multipoint iteration. J. ACM 21, 643–651 (1974)Neta, B.: A new family of high-order methods for solving equations. Int. J. Comput. Math. 14, 191–195 (1983)Neta, B.: On Popovski’s method for nonlinear equations. Appl. Math. Comput. 201, 710–715 (2008)Chun, C., Neta, B.: Some modifications of Newton’s method by the method of undeterminate coefficients. Comput. Math. Appl. 56, 2528–2538 (2008)Chun, C., Lee, M.Y., Neta, B., Dzunic, J.: On optimal fourth-order iterative methods free from second derivative and their dynamics. Appl. Math. Comput. 218, 6427–6438 (2012)Cordero, A., Torregrosa, J.R., Vassileva, M.P.: Three-step iterative methods with optimal eighth-order convergence. J. Comput. Appl. Math. 235, 3189–3194 (2011)Cordero, A., Torregrosa, J.R., Vassileva, M.P.: A family of modified Ostrowski’s methods with optimal eighth order of convergence. Appl. Math. Lett. 24, 2082–2086 (2011)Heydari, M., Hosseini, S.M., Loghmani, G.B.: On two new families of iterative methods for solving nonlinear equations with optimal order. Appl. Anal. Dis. Math. 5, 93–109 (2011)Neta, B., Petkovic, M.S.: Construction of optimal order nonlinear solvers using inverse interpolation. Appl. Math. Comput. 217, 2448–2445 (2010)Sharifi, M., Babajee, D.K.R., Soleymani, F.: Finding the solution of nonlinear equations by a class of optimal methods. Comput. Math. Appl. 63, 764–774 (2012)Soleymani, F., Karimi Vanani, S., Khan, M., Sharifi, M.: Some modifications of King’s family with optimal eighth order of convergence. Math. Comput. Model. 55, 1373–1380 (2012)Soleymani, F., Karimi Vanani, S., Jamali Paghaleh, M.: A class of three-step derivative-free root solvers with optimal convergence order. J. Appl. Math. 2012, Article ID 568740, 15 pp. (2012). doi: 10.1155/2012/568740Soleymani, F., Sharifi, M., Mousavi, B.S.: An improvement of Ostrowski’s and King’s techniques with optimal convergence order eight. J. Optim. Theory Appl. 153, 225–236 (2012)Stewart, B.D.: Attractor basins of various root-finding methods. M.S. Thesis, Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA (2001)Amat, S., Busquier, S., Plaza, S.: Review of some iterative root-finding methods from a dynamical point of view. Scientia 10, 3–35 (2004)Amat, S., Busquier, S., Plaza, S.: Dynamics of the King and Jarratt iterations. Aequ. Math. 69, 212–223 (2005)Amat, S., Busquier, S., Plaza, S.: Chaotic dynamics of a third-order Newton type method. J. Math. Anal. Appl. 366, 24–32 (2010)Neta, B., Chun, C., Scott, M.: A note on the modified super-Halley method. Appl. Math. Comput. 218, 9575–9577 (2012)Scott, M., Neta, B., Chun, C.: Basin attractors for various methods. Appl. Math. Comput. 218, 2584–2599 (2011)Ardelean, G.: A comparison between iterative methods by using the basins of attraction. Appl. Math. Comput. 218, 88–95 (2011)Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, New York (1964)Babajee, D.K.R.: Analysis of higher order variants of Newton’s method and their applications to differential and integral equations and in ocean acidification. Ph.D. Thesis, University of Mauritius (2010
An iterative semi-implicit scheme with robust damping
An efficient, iterative semi-implicit (SI) numerical method for the time
integration of stiff wave systems is presented. Physics-based assumptions are
used to derive a convergent iterative formulation of the SI scheme which
enables the monitoring and control of the error introduced by the SI operator.
This iteration essentially turns a semi-implicit method into a fully implicit
method. Accuracy, rather than stability, determines the timestep. The scheme is
second-order accurate and shown to be equivalent to a simple preconditioning
method. We show how the diffusion operators can be handled so as to yield the
property of robust damping, i.e., dissipating the solution at all values of the
parameter \mathcal D\dt, where is a diffusion operator and \dt
the timestep. The overall scheme remains second-order accurate even if the
advection and diffusion operators do not commute. In the limit of no physical
dissipation, and for a linear test wave problem, the method is shown to be
symplectic. The method is tested on the problem of Kinetic Alfv\'en wave
mediated magnetic reconnection. A Fourier (pseudo-spectral) representation is
used. A 2-field gyrofluid model is used and an efficacious k-space SI operator
for this problem is demonstrated. CPU speed-up factors over a CFL-limited
explicit algorithm ranging from to several hundreds are obtained,
while accurately capturing the results of an explicit integration. Possible
extension of these results to a real-space (grid) discretization is discussed.Comment: Submitted to the Journal of Computational Physics. Clarifications and
caveats in response to referees, numerical demonstration of convergence rate,
generalized symplectic proo
A linear domain decomposition method for partially saturated flow in porous media
The Richards equation is a nonlinear parabolic equation that is commonly used
for modelling saturated/unsaturated flow in porous media. We assume that the
medium occupies a bounded Lipschitz domain partitioned into two disjoint
subdomains separated by a fixed interface . This leads to two problems
defined on the subdomains which are coupled through conditions expressing flux
and pressure continuity at . After an Euler implicit discretisation of
the resulting nonlinear subproblems a linear iterative (-type) domain
decomposition scheme is proposed. The convergence of the scheme is proved
rigorously. In the last part we present numerical results that are in line with
the theoretical finding, in particular the unconditional convergence of the
scheme. We further compare the scheme to other approaches not making use of a
domain decomposition. Namely, we compare to a Newton and a Picard scheme. We
show that the proposed scheme is more stable than the Newton scheme while
remaining comparable in computational time, even if no parallelisation is being
adopted. Finally we present a parametric study that can be used to optimize the
proposed scheme.Comment: 34 pages, 13 figures, 7 table
- …