Summary: Iterative algorithms for solving a nonlinear system of algebraic equations of the type: \(F_i(x_j)=0\), \(i,j=1,\ldots ,n\) date back to the seminal work of Issac Newton. Nowadays a Newton-like algorithm is still the most popular one due to its easy numerical implementation. However, this type of algorithm is sensitive to the initial guess of the solution and is expensive in the computations of the Jacobian matrix \(\partial F_i/\partial x_j\) and its inverse at each iterative step. In a time-integration of a system of nonlinear Ordinary Differential Equations (ODEs) of the type \(B_{ij} \dot{x}_j+F_i=0\) where \(B_{ij}\) are nonlinear functions of \(x_j\), the methods which involve an inverse of the Jacobain matrix \(B_{ij}=\partial F_i/\partial x_j\) are called “implicit”, while those that do not involve an inverse of \(\partial F_i/\partial x_j\) are called “explicit”. In this paper a natural system of explicit ODEs is derived from the given system of nonlinear algebraic equations (NAEs), by introducing a fictitious time, such that it is a mathematically equivalent system in the \(n+1\)-dimensional space as the original algebraic equations system is in the \(n\)-dimensional space. The iterative equations are obtained by applying numerical integrations on the resultant ODEs, which do not need the information of \(\partial F_i/\partial x_j\) and its inverse. The computational cost is thus greatly reduced. Numerical examples given confirm that this fictitious time integration method (FTIM) is highly efficient to find the true solutions with residual errors being much smaller. Also, the FTIM is used to study the attracting sets of fixed points, when multiple roots exist.