


Paper's Title:
TraubPotraType Method for SetValued Maps
Author(s):
Ioannis K. Argyros and Saïd Hilout
Cameron University,
Department of Mathematics Sciences,
Lawton, OK 73505,
USA
URL: http://www.cameron.edu/~ioannisa/
Poitiers University,
Laboratoire de Mathematiques et Applications,
Bd. Pierre et Marie Curie, Teleport 2, B.P. 30179,
86962 Futuroscope Chasseneuil Cedex,
France
said.hilout@math.univpoitiers.fr
http://wwwmath.univpoitiers.fr/~hilout/
Abstract:
We introduce a new iterative method for approximating a locally unique solution of variational inclusions in Banach spaces by using generalized divided differences of the first order. This method extends a method considered by Traub (in the scalar case) and by Potra (in the Banach spaces case) for solving nonlinear equations to variational inclusions. An existenceconvergence theorem and a radius of convergence are given under some conditions on divided differences operator and Lipschitzlike continuity property of setvalued mappings. The Rorder of the method is equal to the unique positive root of a certain cubic equation, which is $1.839..., and as such it compares favorably to related methods such as the Secant method which is only of order $1.618....
Paper's Title:
An Improved Mesh Independence Principle for Solving Equations and their Discretizations using Newton's Method
Author(s):
Ioannis K. Argyros
Cameron university,
Department of Mathematics Sciences,
Lawton, OK 73505,
USA
iargyros@cameron.edu
Abstract:
We improve the mesh independence principle [1] which states that when Newton's method is applied to an equation on a Banach space as well as to their finitedimensional discretization there is a difference of at most one between the number of steps required by the two processes to converge to within a given error tolerance. Here using a combination of Lipschitz and center Lipschitz continuity assumptions instead of just Lipschitz conditions we show that the minimum number of steps required can be at least as small as in earlier works. Some numerical examples are provided whereas our results compare favorably with earlier ones.
Search and serve lasted 1 second(s).