Add to ORKGThe goal of this study is to extend the applicability of a homotopy method for locating an approximate zero using Newton’s method. The improvements are obtained using more precise Lipschitz-type functions than in earlier works and our new idea of restricted convergence regions. Moreover, these improvements are found under the same computational effort. 
In recent work on the area of approximation methods for the solution of nonlinear differential equat...
http://deepblue.lib.umich.edu/bitstream/2027.42/8202/5/bam6921.0001.001.pdfhttp://deepblue.lib.umich...
We propose a new algorithm for the classical and still practically important problem of approximatin...
This paper deals with the enlargement of the region of convergence of Newton's method for solving no...
Abstract. We describe, for the first time, a completely rigorous homotopy (path–following) algo-rith...
The basic theory for probability one globally convergent homotopy algorithms was developed in 1976, ...
AbstractWe present new results concerning the convergence of secant type methods with only condition...
This chapter describes the global homotopies and Newton methods. A key to devising global methods is...
Probability-one homotopy methods are a class of algorithms for solving nonlinear systems of equation...
Globally convergent iterative methods for polynomial equations f(z)=0 are obtained. They are derived...
AbstractA method to compute an accurate approximation for a zero cluster of a complex univariate pol...
The homotopy method for the solution of nonlinear equations is revisited in the present study. An an...
In this note, we consider the solution of a linear program, using suitably adapted homotopy techniq...
There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are gl...
Fundamental insight into the solution of systems of nonlinear equations was provided by Powell. It w...
In recent work on the area of approximation methods for the solution of nonlinear differential equat...
http://deepblue.lib.umich.edu/bitstream/2027.42/8202/5/bam6921.0001.001.pdfhttp://deepblue.lib.umich...
We propose a new algorithm for the classical and still practically important problem of approximatin...
This paper deals with the enlargement of the region of convergence of Newton's method for solving no...
Abstract. We describe, for the first time, a completely rigorous homotopy (path–following) algo-rith...
The basic theory for probability one globally convergent homotopy algorithms was developed in 1976, ...
AbstractWe present new results concerning the convergence of secant type methods with only condition...
This chapter describes the global homotopies and Newton methods. A key to devising global methods is...
Probability-one homotopy methods are a class of algorithms for solving nonlinear systems of equation...
Globally convergent iterative methods for polynomial equations f(z)=0 are obtained. They are derived...
AbstractA method to compute an accurate approximation for a zero cluster of a complex univariate pol...
The homotopy method for the solution of nonlinear equations is revisited in the present study. An an...
In this note, we consider the solution of a linear program, using suitably adapted homotopy techniq...
There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are gl...
Fundamental insight into the solution of systems of nonlinear equations was provided by Powell. It w...
In recent work on the area of approximation methods for the solution of nonlinear differential equat...
http://deepblue.lib.umich.edu/bitstream/2027.42/8202/5/bam6921.0001.001.pdfhttp://deepblue.lib.umich...
We propose a new algorithm for the classical and still practically important problem of approximatin...