199 research outputs found

    Increasing the order of convergence of iterative schemes for solving nonlinear systems

    Full text link
    [EN] A set of multistep iterative methods with increasing order of convergence is presented, for solving systems of nonlinear equations. One of the main advantages of these schemes is to achieve high order of convergence with few Jacobian and functional evaluations, joint with the use of the same matrix of coefficients in the most of the linear systems involved in the process. Indeed, the application of the pseudocomposition technique on these proposed schemes allows us to increase their order of convergence, obtaining new high-order, efficient methods. Finally, some numerical tests are performed in order to check their practical behavior. (C) 2012 Elsevier B.V. All rights reserved.This research was supported by Ministerio de Ciencia y Tecnología MTM2011-28636-C02-02 and FONDOCYT 2011-1-B1-33 República DominicanaCordero Barbero, A.; Torregrosa Sánchez, JR.; Penkova Vassileva, M. (2013). Increasing the order of convergence of iterative schemes for solving nonlinear systems. Journal of Computational and Applied Mathematics. 252:86-94. https://doi.org/10.1016/j.cam.2012.11.024S869425

    Dark Energy Survey Year 3 results: Marginalization over redshift distribution uncertainties using ranking of discrete realizations

    Full text link
    Artículo escrito por un elevado número de autores, solo se referencian el que aparece en primer lugar, los autores pertenecientes a la UAM y el nombre del grupo de colaboración, si lo hubiereCosmological information from weak lensing surveys is maximized by sorting source galaxies into tomographic redshift subsamples. Any uncertainties on these redshift distributions must be correctly propagated into the cosmological results. We present hyperrank, a new method for marginalizing over redshift distribution uncertainties, using discrete samples from the space of all possible redshift distributions, improving over simple parametrized models. In hyperrank, the set of proposed redshift distributions is ranked according to a small (between one and four) number of summary values, which are then sampled, along with other nuisance parameters and cosmological parameters in the Monte Carlo chain used for inference. This approach can be regarded as a general method for marginalizing over discrete realizations of data vector variation with nuisance parameters, which can consequently be sampled separately from the main parameters of interest, allowing for increased computational efficiency. We focus on the case of weak lensing cosmic shear analyses and demonstrate our method using simulations made for the Dark Energy Survey (DES). We show that the method can correctly and efficiently marginalize over a wide range of models for the redshift distribution uncertainty. Finally, we compare hyperrank to the common mean-shifting method of marginalizing over redshift uncertainty, validating that this simpler model is sufficient for use in the DES Year 3 cosmology results presented in companion paper

    Design, Analysis, and Applications of Iterative Methods for Solving Nonlinear Systems

    Get PDF
    In this chapter, we present an overview of some multipoint iterative methods for solving nonlinear systems obtained by using different techniques such as composition of known methods, weight function procedure, and pseudo-composition, etc. The dynamical study of these iterative schemes provides us valuable information about their stability and reliability. A numerical test on a specific problem coming from chemistry is performed to compare the described methods with classical ones and to confirm the theoretical results

    A family of parametric schemes of arbitrary even order for solving nonlinear models

    Full text link
    [EN] Many problems related to gas dynamics, heat transfer or chemical reactions are modeled by means of partial differential equations that usually are solved by using approximation techniques. When they are transformed in nonlinear systems of equations via a discretization process, this system is big-sized and high-order iterative methods are specially useful. In this paper, we construct a new family of parametric iterative methods with arbitrary even order, based on the extension of Ostrowski' and Chun's methods for solving nonlinear systems. Some elements of the proposed class are known methods meanwhile others are new schemes with good properties. Some numerical tests confirm the theoretical results and allow us to compare the numerical results obtained by applying new methods and known ones on academical examples. In addition, we apply one of our methods for approximating the solution of a heat conduction problem described by a parabolic partial differential equation.This research was partially supported by Ministerio de Economia y Competitividad MTM2014-52016-C02-2-P and FONDOCYT 2014-1C1-088 Republica Dominicana.Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vassileva, MP. (2017). A family of parametric schemes of arbitrary even order for solving nonlinear models. Journal of Mathematical Chemistry. 55(7):1443-1460. https://doi.org/10.1007/s10910-016-0723-7S14431460557R. Escobedo, L.L. Bonilla, Numerical methods for quantum drift-diffusion equation in semiconductor phisics. Math. Chem. 40(1), 3–13 (2006)S.J. Preece, J. Villingham, A.C. King, Chemical clock reactions: the effect of precursor consumtion. Math. Chem. 26, 47–73 (1999)H. Montazeri, F. Soleymani, S. Shateyi, S.S. Motsa, On a new method for computing the numerical solution of systems of nonlinear equations. J. Appl. Math. 2012 ID. 751975, 15 pages (2012)J.L. Hueso, E. Martínez, C. Teruel, Convergence, effiency and dinamimics of new fourth and sixth order families of iterative methods for nonlinear systems. J. Comput. Appl. Math. 275, 412–420 (2015)J.R. Sharma, H. Arora, Efficient Jarratt-like methods for solving systems of nonlinear equations. Calcolo 51, 193–210 (2014)X. Wang, T. Zhang, W. Qian, M. Teng, Seventh-order derivative-free iterative method for solving nonlinear systems. Numer. Algor. 70, 545–558 (2015)J.R. Sharma, H. Arora, On efficient weighted-Newton methods for solving systems of nonlinear equations. Appl. Math. Comput. 222, 497–506 (2013)A. Cordero, J.G. Maimó, J.R. Torregrosa, M.P. Vassileva, Solving nonlinear problems by Ostrowski-Chun type parametric families. J. Math. Chem. 53, 430–449 (2015)A.M. Ostrowski, Solution of equations and systems of equations (Prentice-Hall, Englewood Cliffs, New York, 1964)C. Chun, Construction of Newton-like iterative methods for solving nonlinear equations. Numer. Math. 104, 297–315 (2006)A. Cordero, J.L. Hueso, E. Martínez, J.R. Torregrosa, A modified Newton-Jarratt’s composition. Numer. Algor. 55, 87–99 (2010)J.M. Ortega, W.C. Rheinboldt, Iterative solution of nonlinear equations in several variables (Academic, New York, 1970)C. Hermite, Sur la formule dinterpolation de Lagrange. Reine Angew. Math. 84, 70–79 (1878)A. Cordero, J.R. Torregrosa, Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686–698 (2007

    Behavior of fixed and critical points of the (alpha,c)-family of iterative methods

    Get PDF
    In this paper we study the dynamical behavior of the -family of iterative methods for solving nonlinear equations, when we apply the fixed point operator associated to this family on quadratic polynomials. This is a family of third-order iterative root-finding methods depending on two parameters; so, as we show throughout this paper, its dynamics is really interesting, but complicated. In fact, we have found in the real -plane a line in which the corresponding elements of the family have a lower number of free critical points. As this number is directly related with the quantity of basins of attraction, it is probable to find more stable behavior between the elements of the family in this region.Supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02. The first and fourth authors were also partially supported by P11B2011-30 (Universitat Jaume I), the second and third authors were also partially supported by Vicerrectorado de Investigacion, Universitat Politecnica de Valencia SP20120474.Campos, B.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; P. Vindel (2015). Behavior of fixed and critical points of the (alpha,c)-family of iterative methods. Journal of Mathematical Chemistry. 53(3):807-827. https://doi.org/10.1007/s10910-014-0465-3S807827533A.F. Beardon, Iteration of Rational Functions, Graduate Texts in Mathematics, vol. 132 (Springer, New York, 1991)B. Campos, A. Cordero, A. Magreñan, J.R. Torregrosa, P. Vindel, Study of a bi-parametric family of iterative methods, Abstra. Appl. Anal. (2014). doi: 10.1155/2014/141643B. Campos, A. Cordero, A. Magreñan, J.R. Torregrosa, P. Vindel, Bifurcations of the roots of a 6-degree symmetric polynomial coming from the fixed point operator of a class of iterative methods. in Proceedings of the 14th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE, ed. by J. Vigo-Aguiar (2014), pp. 253–264B. Campos, A. Cordero, J.R. Torregrosa, P. Vindel, Dynamics of the family of c-iterative methods. Int. J. Compt. Math. (2014). doi: 10.1080/00207160.2014.893608F. Chicharro, A. Cordero, J.R. Torregrosa, Drawing dynamical and parameter planes of iterative families and methods. Sci. World J. (2013). doi: 10.1155/2013/780153A. Cordero, J. García-Maimó, J.R. Torregrosa, M.P. Vassileva, P. Vindel, Chaos in King’s iterative family. Appl. Math. Lett. 26, 842–848 (2013)A. Cordero, J.R. Torregrosa, P. Vindel, Dynamics of a family of Chebyshev–Halley type method. Appl. Math. Comput. 219, 8568–8583 (2013)C.G. Jesudason, I. Numerical nonlinear analysis: differential methods and optimization applied to chemical reaction rate determination. J. Math. Chem. 49(7), 1384–1415 (2011)P.G. Logrado, J.D.M. Vianna, Partitioning technique procedure revisited: formalism and first applications to atomic problems. J. Math. Chem. 22, 107–116 (1997)M. Mahalakshmi, G. Hariharan, K. Kannan, The wavelet methods to linear and nonlinear reaction-diffusion model arising in mathematical chemistry. J. Math. Chem. 51(9), 2361–2385 (2013)K. Maleknejad, M. Alizadeh, An efficient numerical sheme for solving Hammerstein integral equation arisen in chemical phenomenon. Proc. Comput. Sci. 3, 361–364 (2011)J. Milnor, Dynamics in One Complex Variable (Princeton University Press, New Jersey, 2006

    An efficient two-parametric family with memory for nonlinear equations

    Full text link
    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

    Solving Nonlinear Transcendental Equations by Iterative Methods with Conformable Derivatives: A General Approach

    Get PDF
    [EN] In recent years, some Newton-type schemes with noninteger derivatives have been proposed for solving nonlinear transcendental equations by using fractional derivatives (Caputo and Riemann-Liouville) and conformable derivatives. It has also been shown that the methods with conformable derivatives improve the performance of classical schemes. In this manuscript, we design point-to-point higher-order conformable Newton-type and multipoint procedures for solving nonlinear equations and propose a general technique to deduce the conformable version of any classical iterative method with integer derivatives. A convergence analysis is given and the expected orders of convergence are obtained. As far as we know, these are the first optimal conformable schemes, beyond the conformable Newton procedure, that have been developed. The numerical results support the theory and show that the new schemes improve the performance of the original methods in some aspects. Additionally, the dependence on initial guesses is analyzed, and these schemes show good stability properties.Candelario, G.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vassileva, MP. (2023). Solving Nonlinear Transcendental Equations by Iterative Methods with Conformable Derivatives: A General Approach. Mathematics. 11(11). https://doi.org/10.3390/math11112568111

    Design and multidimensional extension of iterative methods for solving nonlinear problems

    Full text link
    [EN] In this paper, a three-step iterative method with sixth-order local convergence for approximating the solution of a nonlinear system is presented. From Ostrowski¿s scheme adding one step of Newton with ¿frozen¿ derivative and by using a divided difference operator we construct an iterative scheme of order six for solving nonlinear systems. The computational efficiency of the new method is compared with some known ones, obtaining good conclusions. Numerical comparisons are made with other existing methods, on standard nonlinear systems and the classical 1D-Bratu problem by transforming it in a nonlinear system by using finite differences. From this numerical examples, we confirm the theoretical results and show the performance of the presented scheme.This research was partially supported by Ministerio de Economia y Competitividad MTM2014-52016-C2-2-P and FONDOCYT 2014-1C1-088 Republica Dominicana.Artidiello, S.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vassileva, MP. (2017). Design and multidimensional extension of iterative methods for solving nonlinear problems. Applied Mathematics and Computation. 293:194-203. https://doi.org/10.1016/j.amc.2016.08.034S19420329

    Two weighted-order classes of iterative root-finding methods

    Full text link
    In this paper we design, by using the weight function technique, two families of iterative schemes with order of convergence eight. These weight functions depend on one, two and three variables and they are used in the second and third step of the iterative expression. Dynamics on polynomial and non-polynomial functions is analysed and they are applied on the problem of preliminary orbit determination by using a modified Gauss method. Finally, some standard test functions are to check the reliability of the proposed schemes and allow us to compare them with other known methods.This research was supported by Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and FONDOCYT 2011-1-B1-33 Republica Dominicana.Artidiello Moreno, SDJ.; Cordero Barbero, A.; Torregrosa Sánchez, JR.; Vassileva, M. (2015). Two weighted-order classes of iterative root-finding methods. International Journal of Computer Mathematics. 92(9):1790-1805. https://doi.org/10.1080/00207160.2014.887201S1790180592
    • …
    corecore