Author:
Chueca-Díez Fernando,Gañán-Calvo Alfonso M.
Abstract
AbstractA highly recurrent traditional bottleneck in applied mathematics, for which the most popular codes (Mathematica, Matlab, and Python as examples) do not offer a solution, is to find all the real solutions of a system of n nonlinear equations in a certain finite domain of the n-dimensional space of variables. We present two similar algorithms of minimum length and computational weight to solve this problem, in which one resembles a graphical tool of edge detection in an image extended to n dimensions. To do this, we discretize the n-dimensional space sector in which the solutions are sought. Once the discretized hypersurfaces (edges) defined by each nonlinear equation of the n-dimensional system have been identified in a single, simultaneous step, the coincidence of the hypersurfaces in each n-dimensional tile or cell containing at least one solution marks the approximate locations of all the hyperpoints that constitute the solutions. This makes the final Newton-Raphson step rapidly convergent to all the existent solutions in the predefined space sector with the desired degree of accuracy.
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Alolyan, I.: An algorithm for finding all zeros of vector functions. Bull. Austral. Math. Soc. 77, 353–363 (2008)
2. Broyden, C.G.: A class of methods for solving nonlinear simultaneous equations. Math. Comp. 19, 577–593 (1965)
3. Chen, K., Giblin, P., Irving, A.: Mathematical explorations with matlab. Cambridge University Press, Cambridge (1999)
4. Effati, S., Nazemi, A.R.: A new method for solving a system of nonlinear equations. Science Direct 168, 877–894 (2005)
5. Floudas, C.: Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions. Elsevier, Amsterdam (1999)