The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We propose solving nonlinear systems of equations by function optimization and we give an optimal algorithm which relies on a special canonical form of gradient descent. The algorithm can be applied under certain assumptions on the function to be optimized, that is, an upper bound must exist for the norm of the Hessian, whereas the norm of the gradient must be lower bounded. Due to its intrinsic structure, the algorithm looks particularly appealing for a parallel implementation. As a particular case, more specific results are given for linear systems. We prove that reaching a solution with a degree of precision <tmath>$\varepsilon$</tmath> takes <tmath>$\Theta(n^2 k^2 \log {\frac{k}{\varepsilon}})$</tmath>, <tmath>$k$</tmath> being the condition number of <tmath>${{\schmi A}}$</tmath> and <tmath>$n$</tmath> the problem dimension. Related results hold for systems of quadratic equations for which an estimation for the requested bounds can be devised. Finally, we report numerical results in order to establish the actual computational burden of the proposed method and to assess its performances with respect to classical algorithms for solving linear and quadratic equations.</p>
Computational complexity, nonlinear systems of equations, parallel processing, terminal attraction dynamics.
Marco Gori, Monica Bianchini, Stefano Fanelli, "Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations", IEEE Transactions on Computers, vol. 50, no. , pp. 689-698, July 2001, doi:10.1109/12.936235
98 ms
(Ver 3.3 (11022016))