246 research outputs found

    Semilocal analysis of equations with smooth operators

    Get PDF
    Recent work on semilocal analysis of nonlinear operator equations is informally reviewed. A refined version of the Kantorovich theorem for Newton's method, with new error bounds, is presented. Related topics are briefly surveyed

    Majorizing sequences for Newton’s method from initial value problems

    Get PDF
    AbstractThe most restrictive condition used by Kantorovich for proving the semilocal convergence of Newton’s method in Banach spaces is relaxed in this paper, providing we can guarantee the semilocal convergence in situations that Kantorovich cannot. To achieve this, we use Kantorovich’s technique based on majorizing sequences, but our majorizing sequences are obtained differently, by solving initial value problems

    Semilocal convergence of a continuation method with Hölder continuous second derivative in Banach spaces

    Get PDF
    AbstractIn this paper, the semilocal convergence of a continuation method combining the Chebyshev method and the convex acceleration of Newton’s method used for solving nonlinear equations in Banach spaces is established by using recurrence relations under the assumption that the second Frëchet derivative satisfies the Hölder continuity condition. This condition is mild and works for problems in which the second Frëchet derivative fails to satisfy Lipschitz continuity condition. A new family of recurrence relations are defined based on two constants which depend on the operator. The existence and uniqueness regions along with a closed form of the error bounds in terms of a real parameter α∈[0,1] for the solution x∗ is given. Two numerical examples are worked out to demonstrate the efficacy of our approach. On comparing the existence and uniqueness regions for the solution obtained by our analysis with those obtained by using majorizing sequences under Hölder continuity condition on F″, it is found that our analysis gives improved results. Further, we have observed that for particular values of the α, our analysis reduces to those for the Chebyshev method (α=0) and the convex acceleration of Newton’s method (α=1) respectively with improved results

    On the semilocal convergence of inexact Newton methods in Banach spaces

    Get PDF
    AbstractWe provide two types of semilocal convergence theorems for approximating a solution of an equation in a Banach space setting using an inexact Newton method [I.K. Argyros, Relation between forcing sequences and inexact Newton iterates in Banach spaces, Computing 63 (2) (1999) 134–144; I.K. Argyros, A new convergence theorem for the inexact Newton method based on assumptions involving the second Fréchet-derivative, Comput. Appl. Math. 37 (7) (1999) 109–115; I.K. Argyros, Forcing sequences and inexact Newton iterates in Banach space, Appl. Math. Lett. 13 (1) (2000) 77–80; I.K. Argyros, Local convergence of inexact Newton-like iterative methods and applications, Comput. Math. Appl. 39 (2000) 69–75; I.K. Argyros, Computational Theory of Iterative Methods, in: C.K. Chui, L. Wuytack (Eds.), in: Studies in Computational Mathematics, vol. 15, Elsevier Publ. Co., New York, USA, 2007; X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242]. By using more precise majorizing sequences than before [X. Guo, On semilocal convergence of inexact Newton methods, J. Comput. Math. 25 (2) (2007) 231–242; Z.D. Huang, On the convergence of inexact Newton method, J. Zheijiang University, Nat. Sci. Ed. 30 (4) (2003) 393–396; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; X.H. Wang, Convergence on the iteration of Halley family in weak condition, Chinese Sci. Bull. 42 (7) (1997) 552–555; T.J. Ypma, Local convergence of inexact Newton methods, SIAM J. Numer. Anal. 21 (3) (1984) 583–590], we provide (under the same computational cost) under the same or weaker hypotheses: finer error bounds on the distances involved; an at least as precise information on the location of the solution. Moreover if the splitting method is used, we show that a smaller number of inner/outer iterations can be obtained
    • …
    corecore