Saïd Hilout

According to our database1, Saïd Hilout authored at least 43 papers between 2008 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
The majorant method in the theory of Newton-Kantorovich approximations and generalized Lipschitz conditions.
J. Comput. Appl. Math., 2016

2015
Directional Chebyshev-type methods for solving equations.
Math. Comput., 2015

2014
Expanding the Applicability of High-Order Traub-Type Iterative Procedures.
J. Optim. Theory Appl., 2014

Expanding the applicability of Newton's method using Smale's α-theory.
J. Comput. Appl. Math., 2014

Weaker convergence for Newton's method under Hölder differentiability.
Int. J. Comput. Math., 2014

Robust semi-local convergence analysis for inexact Newton method.
Appl. Math. Comput., 2014

Newton-type methods on Riemannian manifolds under Kantorovich-type conditions.
Appl. Math. Comput., 2014

2013
Estimating upper bounds on the limit points of majorizing sequences for Newton's method.
Numer. Algorithms, 2013

Directional Secant-Type Methods for Solving Equations.
J. Optim. Theory Appl., 2013

Improved local convergence analysis of inexact Gauss-Newton like methods under the majorant condition in Banach spaces.
J. Frankl. Inst., 2013

On the local convergence of fast two-step Newton-like methods for solving nonlinear equations.
J. Comput. Appl. Math., 2013

Expanding the applicability of Inexact Newton Methods under Smale's (α, γ)-theory.
Appl. Math. Comput., 2013

On an improved convergence analysis of Newton's method.
Appl. Math. Comput., 2013

Extending the applicability of Newton's method on Lie groups.
Appl. Math. Comput., 2013

On a bilinear operator free third order method on Riemannian manifolds.
Appl. Math. Comput., 2013

2012
Secant-type methods and nondiscrete induction.
Numer. Algorithms, 2012

Majorizing sequences for iterative methods.
J. Comput. Appl. Math., 2012

Improved local convergence of Newton's method under weak majorant condition.
J. Comput. Appl. Math., 2012

Majorizing sequences for iterative procedures in Banach spaces.
J. Complex., 2012

Weaker conditions for the convergence of Newton's method.
J. Complex., 2012

New conditions for the convergence of Newton-like methods and applications.
Appl. Math. Comput., 2012

On the semilocal convergence of damped Newton's method.
Appl. Math. Comput., 2012

2011
A derivative free iterative method for solving least squares problems.
Numer. Algorithms, 2011

Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions.
Numer. Algorithms, 2011

On the solution of systems of equations with constant rank derivatives.
Numer. Algorithms, 2011

On the semilocal convergence of efficient Chebyshev-Secant-type methods.
J. Comput. Appl. Math., 2011

A unifying theorem for Newton's method on spaces with a convergence structure.
J. Complex., 2011

Extended sufficient semilocal convergence for the Secant method.
Comput. Math. Appl., 2011

Extending the applicability of Secant methods and nondiscrete induction.
Appl. Math. Comput., 2011

Weak convergence conditions for Inexact Newton-type methods.
Appl. Math. Comput., 2011

Convergence of Directional Methods under mild differentiability and applications.
Appl. Math. Comput., 2011

2010
A convergence analysis for directional two-step Newton methods.
Numer. Algorithms, 2010

A Kantorovich-type convergence analysis of the Newton-Josephy method for solving variational inequalities.
Numer. Algorithms, 2010

Extending the Newton-Kantorovich hypothesis for solving equations.
J. Comput. Appl. Math., 2010

Inexact Newton-type methods.
J. Complex., 2010

Improved generalized differentiability conditions for Newton-like methods.
J. Complex., 2010

On the convergence of Newton-type methods using recurrent functions.
Int. J. Comput. Math., 2010

A unified approach for the convergence of certain numerical algorithms, using recurrent functions.
Computing, 2010

On the midpoint method for solving equations.
Appl. Math. Comput., 2010

2009
On the convergence of Newton-type methods under mild differentiability conditions.
Numer. Algorithms, 2009

On the weakening of the convergence of Newton's method using recurrent functions.
J. Complex., 2009

2008
A Fréchet derivative-free cubically convergent method for set-valued maps.
Numer. Algorithms, 2008

Local convergence of Newton-like methods for generalized equations.
Appl. Math. Comput., 2008


  Loading...