AbstractLet f:X→Rk be a Lipschitz continuous function on a compact subset X⊂Rd. Subdivision algorithms are described that can be used to find all solutions of the equation f(x)=0 that lie in X. Convergence is shown and numerical examples are presented. Modifications of the basic algorithm which speed convergence are given for the case of nondegenerate zeros of a vector field
The method of analytic continuation has been used to obtain numerical solutions of nonlinear initial...
This paper is dedicated to the study of continuous Newton’s method, which is a generic differential ...
AbstractSpace filling curves provide a means of finding solutions of sets of nonlinear equations by ...
AbstractLet f:X→Rk be a Lipschitz continuous function on a compact subset X⊂Rd. Subdivision algorith...
AbstractA nongradient algorithm for nonlinear nonconvex Lipschitzian optimization problems is propos...
In this paper we survey numerical methods for solving nonlinear systems of equations F (x) = 0, whe...
AbstractThis paper presents a new algorithm for solving a system of polynomials, in a domain of Rn. ...
AbstractWe survey recent worst-case complexity results for the solution of nonlinear equations. Note...
In this paper an improved root location method has been suggested for nonlinear equations f(x)=0. Th...
The applications of nonlinear equations arise in science and engineering. A new continuation method ...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hi...
A numerical algorithm for continuation of stationary solutions to nonlinear evolution problems repre...
Newton’s iteration is arguably the most important and fundamental method for solving systems of nonl...
Solving systems of nonlinear equations is a relatively complicated problem for which a number of dif...
The method of analytic continuation has been used to obtain numerical solutions of nonlinear initial...
This paper is dedicated to the study of continuous Newton’s method, which is a generic differential ...
AbstractSpace filling curves provide a means of finding solutions of sets of nonlinear equations by ...
AbstractLet f:X→Rk be a Lipschitz continuous function on a compact subset X⊂Rd. Subdivision algorith...
AbstractA nongradient algorithm for nonlinear nonconvex Lipschitzian optimization problems is propos...
In this paper we survey numerical methods for solving nonlinear systems of equations F (x) = 0, whe...
AbstractThis paper presents a new algorithm for solving a system of polynomials, in a domain of Rn. ...
AbstractWe survey recent worst-case complexity results for the solution of nonlinear equations. Note...
In this paper an improved root location method has been suggested for nonlinear equations f(x)=0. Th...
The applications of nonlinear equations arise in science and engineering. A new continuation method ...
In this thesis, we present four algorithms for solving sparse nonlinear systems of equations: the pa...
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hi...
A numerical algorithm for continuation of stationary solutions to nonlinear evolution problems repre...
Newton’s iteration is arguably the most important and fundamental method for solving systems of nonl...
Solving systems of nonlinear equations is a relatively complicated problem for which a number of dif...
The method of analytic continuation has been used to obtain numerical solutions of nonlinear initial...
This paper is dedicated to the study of continuous Newton’s method, which is a generic differential ...
AbstractSpace filling curves provide a means of finding solutions of sets of nonlinear equations by ...