38,756 research outputs found

    Memory in a new variant of King's family for solving nonlinear systems

    Full text link
    [EN] In the recent literature, very few high-order Jacobian-free methods with memory for solving nonlinear systems appear. In this paper, we introduce a new variant of King's family with order four to solve nonlinear systems along with its convergence analysis. The proposed family requires two divided difference operators and to compute only one inverse of a matrix per iteration. Furthermore, we have extended the proposed scheme up to the sixth-order of convergence with two additional functional evaluations. In addition, these schemes are further extended to methods with memory. We illustrate their applicability by performing numerical experiments on a wide variety of practical problems, even big-sized. It is observed that these methods produce approximations of greater accuracy and are more efficient in practice, compared with the existing methods.This research was supported by PGC2018-095896-B-C22 (MCIU/AEI/FEDER, UE).Kansal, M.; Cordero Barbero, A.; Bhalla, S.; Torregrosa Sánchez, JR. (2020). Memory in a new variant of King's family for solving nonlinear systems. Mathematics. 8(8):1-15. https://doi.org/10.3390/math8081251S11588Cordero, A., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2009). A modified Newton-Jarratt’s composition. Numerical Algorithms, 55(1), 87-99. doi:10.1007/s11075-009-9359-zCordero, A., Hueso, J. L., Martínez, E., & Torregrosa, J. R. (2011). Efficient high-order methods based on golden ratio for nonlinear systems. Applied Mathematics and Computation, 217(9), 4548-4556. doi:10.1016/j.amc.2010.11.006Babajee, D. K. R., Cordero, A., Soleymani, F., & Torregrosa, J. R. (2012). On a Novel Fourth-Order Algorithm for Solving Systems of Nonlinear Equations. Journal of Applied Mathematics, 2012, 1-12. doi:10.1155/2012/165452Zheng, Q., Zhao, P., & Huang, F. (2011). A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs. Applied Mathematics and Computation, 217(21), 8196-8203. doi:10.1016/j.amc.2011.01.095Sharma, J., & Arora, H. (2013). An efficient derivative free iterative method for solving systems of nonlinear equations. Applicable Analysis and Discrete Mathematics, 7(2), 390-403. doi:10.2298/aadm130725016sSharma, J. R., Arora, H., & Petković, M. S. (2014). An efficient derivative free family of fourth order methods for solving systems of nonlinear equations. Applied Mathematics and Computation, 235, 383-393. doi:10.1016/j.amc.2014.02.103Wang, X., Zhang, T., Qian, W., & Teng, M. (2015). Seventh-order derivative-free iterative method for solving nonlinear systems. Numerical Algorithms, 70(3), 545-558. doi:10.1007/s11075-015-9960-2Chicharro, F. I., Cordero, A., Garrido, N., & Torregrosa, J. R. (2020). On the improvement of the order of convergence of iterative methods for solving nonlinear systems by means of memory. Applied Mathematics Letters, 104, 106277. doi:10.1016/j.aml.2020.106277Petković, M. S., & Sharma, J. R. (2015). On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations. Numerical Algorithms, 71(2), 457-474. doi:10.1007/s11075-015-0003-9Narang, M., Bhatia, S., Alshomrani, A. S., & Kanwar, V. (2019). General efficient class of Steffensen type methods with memory for solving systems of nonlinear equations. Journal of Computational and Applied Mathematics, 352, 23-39. doi:10.1016/j.cam.2018.10.048King, R. F. (1973). A Family of Fourth Order Methods for Nonlinear Equations. SIAM Journal on Numerical Analysis, 10(5), 876-879. doi:10.1137/0710072Hermite, M. C., & Borchardt, M. (1878). Sur la formule d’interpolation de Lagrange. Journal für die reine und angewandte Mathematik (Crelles Journal), 1878(84), 70-79. doi:10.1515/crelle-1878-18788405Petkovic, M., Dzunic, J., & Petkovic, L. (2011). A family of two-point methods with memory for solving nonlinear equations. Applicable Analysis and Discrete Mathematics, 5(2), 298-317. doi:10.2298/aadm110905021pCordero, 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.062Awawdeh, F. (2009). On new iterative method for solving systems of nonlinear equations. Numerical Algorithms, 54(3), 395-409. doi:10.1007/s11075-009-9342-8Noor, M. A., Waseem, M., & Noor, K. I. (2015). New iterative technique for solving a system of nonlinear equations. Applied Mathematics and Computation, 271, 446-466. doi:10.1016/j.amc.2015.08.125Pramanik, S. (2002). Kinematic Synthesis of a Six-Member Mechanism for Automotive Steering. Journal of Mechanical Design, 124(4), 642-645. doi:10.1115/1.150337

    Composing Scalable Nonlinear Algebraic Solvers

    Get PDF
    Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.Comment: 29 pages, 14 figures, 13 table

    A rational deferred correction approach to parabolic optimal control problems

    Get PDF
    The accurate and efficient solution of time-dependent PDE-constrained optimization problems is a challenging task, in large part due to the very high dimension of the matrix systems that need to be solved. We devise a new deferred correction method for coupled systems of time-dependent PDEs, allowing one to iteratively improve the accuracy of low-order time stepping schemes. We consider two variants of our method, a splitting and a coupling version, and analyze their convergence properties. We then test our approach on a number of PDE-constrained optimization problems. We obtain solution accuracies far superior to that achieved when solving a single discretized problem, in particular in cases where the accuracy is limited by the time discretization. Our approach allows for the direct reuse of existing solvers for the resulting matrix systems, as well as state-of-the-art preconditioning strategies
    • …
    corecore