共查询到20条相似文献,搜索用时 31 毫秒
1.
The present paper is concerned with the semilocal convergence problems of Halley’s method for solving nonlinear operator equation in Banach space. Under some so-called majorant conditions, a new semilocal convergence analysis for Halley’s method is presented. This analysis enables us to drop out the assumption of existence of a second root for the majorizing function, but still guarantee Q-cubic convergence rate. Moreover, a new error estimate based on a directional derivative of the twice derivative of the majorizing function is also obtained. This analysis also allows us to obtain two important special cases about the convergence results based on the premises of Kantorovich and Smale types. 相似文献
2.
The present paper is concerned with theoretical properties of the modified Newton-HSS method for large sparse non-Hermitian positive definite systems of nonlinear equations. Assuming that the nonlinear operator satisfies the Hölder continuity condition, a new semilocal convergence theorem for the modified Newton-HSS method is established. The Hölder continuity condition is milder than the usual Lipschitz condition. The semilocal convergence theorem is established by using the majorizing principle, which is based on the concept of majorizing sequence given by Kantorovich. Two real valued functions and two real sequences are used to establish the convergence criterion. Furthermore, a numerical example is given to show application of our theorem. 相似文献
3.
We provide local convergence results for Halley??s method in order to approximate a locally unique zero of an operator in a Banach space setting using convex majorants. Kantorovich-type and Smale-type results are considered as applications and special cases. 相似文献
4.
This paper concerns variational inclusions of the form where f is a single locally Lipschitz subanalytic function and F is a set-valued map acting in Banach spaces. We prove the existence and the convergence of a sequence (x
k
) satisfying where lies to which is the Clarke Jacobian of f at the point x
k
.
相似文献
5.
Ioannis K. Argyros 《Journal of Applied Mathematics and Computing》1999,6(3):451-462
We present local and semilocal convergence results for Newton’s method in a Banach space setting. In particular, using Lipschitz-type assumptions on the second Fréchet-derivative we find results concerning the radius of convergence of Newton’s method. Such results are useful in the context of predictor-corrector continuation procedures. Finally, we provide numerical examples to show that our results can apply where earlier ones using Lipschitz assumption on the first Fréchet-derivative fail. 相似文献
6.
On convergence of the method of fundamental solutions for solving the Dirichlet problem of Poisson’s equation 总被引:1,自引:0,他引:1
In this paper the convergence of using the method of fundamental solutions for solving the boundary value problem of Laplaces equation in R2 is established, where the boundaries of the domain and fictitious domain are assumed to be concentric circles. Fourier series is then used to find the particular solutions of Poissons equation, which the derivatives of particular solutions are estimated under the L2 norm. The convergent order of solving the Dirichlet problem of Poissons equation by the method of particular solution and method of fundamental solution is derived.
Dedicated to Charles A. Micchelli with esteem on the occasion of his 60th birthdayAMS subject classification 35J05, 31A99 相似文献
7.
In this paper, for a monotone operator T, we shall show strong convergence of the regularization method for Rockafellar’s proximal point algorithm under more relaxed conditions on the sequences {r k } and {t k }, $$\lim\limits_{k\to\infty}t_k = 0;\quad \sum\limits_{k=0}^{+\infty}t_k = \infty;\quad\ \liminf\limits_{k\to\infty}r_k > 0.$$ Our results unify and improve some existing results. 相似文献
8.
《Optimization》2012,61(4):957-980
Sufficient conditions for a weak local minimizer in the classical calculus of variations can be expressed without reference to conjugate points. The local quadratic convergence of Newton’s method follows from these sufficient conditions. Newton’s method is applied in the minimization form; that is, the step is generated by minimizing the local quadratic approximation. This allows the extension to a globally convergent line search based algorithm (which will be presented in a future paper). 相似文献
9.
Sadao Ikeda 《Annals of the Institute of Statistical Mathematics》1962,14(1):107-118
Summary Two types of necessary conditions are given for the convergence of Kullback-Leibler’s mean information, one of which is connected
with an asymptotic equivalence of two sequences of probability measures, and in special cases, with convergence of a sequence
of probability distributions. The other is given in terms of the generalized probability density functions. 相似文献
10.
11.
Ioannis K. Argyros Ángel Alberto Magreñán Ruiz 《Journal of Applied Mathematics and Computing》2013,43(1-2):491-506
We present a local as well as a semilocal convergence analysis for Newton’s method for approximating a locally unique solution of a nonlinear equation in a Banach space setting. Our hypotheses involve m-Fréchet-differentiable operators and general Lipschitz-type hypotheses, where m≥2 is a positive integer. The new convergence analysis unifies earlier results; it is more flexible and provides a finer convergence analysis than in earlier studies such as Argyros in J. Comput. Appl. Math. 131:149–159, 2001, Argyros and Hilout in J. Appl. Math. Comput. 29:391–400, 2009, Argyros and Hilout in J. Complex. 28:364–387, 2012, Argyros et al. Numerical Methods for Equations and Its Applications, CRC Press/Taylor & Francis, New York, 2012, Gutiérrez in J. Comput. Appl. Math. 79:131–145, 1997, Ren and Argyros in Appl. Math. Comput. 217:612–621, 2010, Traub and Wozniakowski in J. Assoc. Comput. Mech. 26:250–258, 1979. Numerical examples are presented further validating the theoretical results. 相似文献
12.
In this paper, by using the two-variable Taylor expansion formula, we introduce some new variants of Jarratt’s method with
sixth-order convergence for solving univariate nonlinear equations. The proposed methods contain some recent improvements
of Jarratt’s method. Furthermore, a new variant of Jarratt’s method with sixth-order convergence for solving systems of nonlinear
equations is proposed only with an additional evaluation for the involved function, and not requiring the computation of new
inverse. Numerical comparisons are made to show the performance of the presented methods. 相似文献
13.
The solution of an equation f(x)= given by an increasing function f on an interval I and right-hand side , can be approximated by a sequence calculated according to Newtons method. In this article, global convergence of the method is considered in the strong sense of convergence for any initial value in I and any feasible right-hand side. The class of functions for which the method converges globally is characterized. This class contains all increasing convex and increasing concave functions as well as sums of such functions on the given interval. The characterization is applied to Keplers equation and to calculation of the internal rate of return of an investment project.An earlier version was presented at the Joint National Meeting of TIMS and ORSA, Las Vegas, May 7–9, 1990. Financial support from Økonomisk Forskningsfond, Bodø, Norway, is gratefully acknowledged. The author thanks an anonymous referee for helpful comments and suggestions. 相似文献
14.
Following an idea similar to that given by Dennis and Schnabel (1996) in [2], we prove a local convergence result for Newton’s method under generalized conditions of Kantorovich type. 相似文献
15.
We prove Kantorovich’s theorem on Newton’s method using a convergence analysis which makes clear, with respect to Newton’s
method, the relationship of the majorant function and the non-linear operator under consideration. This approach enables us
to drop out the assumption of existence of a second root for the majorant function, still guaranteeing Q-quadratic convergence rate and to obtain a new estimate of this rate based on a directional derivative of the derivative of the majorant function. Moreover, the majorant function does not have to be defined beyond its first root for obtaining
convergence rate results.
The research of O.P. Ferreira was supported in part by FUNAPE/UFG, CNPq Grant 475647/2006-8, CNPq Grant 302618/2005-8, PRONEX–Optimization(FAPERJ/CNPq)
and IMPA.
The research of B.F. Svaiter was supported in part by CNPq Grant 301200/93-9(RN) and by PRONEX–Optimization(FAPERJ/CNPq). 相似文献
16.
17.
Roberto Cominetti Walter F. Mascarenhas Paulo J. S. Silva 《Mathematical Programming Computation》2014,6(2):151-169
We introduce a new efficient method to solve the continuous quadratic knapsack problem. This is a highly structured quadratic program that appears in different contexts. The method converges after $O(n)$ iterations with overall arithmetic complexity $O(n^2)$ . Numerical experiments show that in practice the method converges in a small number of iterations with overall linear complexity, and is faster than the state-of-the-art algorithms based on median finding, variable fixing, and secant techniques. 相似文献
18.
Study of the performance of the Galerkin method using sinc basis functions for solving Bratu’s problem is presented. Error analysis of the presented method is given. The method is applied to two test examples. By considering the maximum absolute errors in the solutions at the sinc grid points are tabulated in tables for different choices of step size. We conclude that the Sinc-Galerkin method converges to the exact solution rapidly, with order, $O(\exp{(-c \sqrt{n}}))$ accuracy, where c is independent of n. 相似文献
19.
We extend Rump’s verified method (S.Oishi, K.Tanabe, T.Ogita, S.M.Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for computing the Moore-Penrose inverse. 相似文献