Previous |  Up |  Next


recursive algorithms; root-finding algorithms; comparison; Newton-Raphson iteration; iteration by components; nonlinear equations
A way of generalizing onedimensional root-finding algorithms to the multidimensional case by means of recursion is shown and means to make the algorithms robust are discussed. In the second part, the algorithm is modified so as to exploit sparsity of large systems of equations for reducing the recursion depth and consequently decreasing the computational requirements of the method.
[1] J. Jan: Recursive method of numerical analysis of inertialess nonlinear circuits. (in Czech). Library of research and scientific writings, Technical University Brno, B-57, 1975.
[2] J. Jan J. Holčík J. Kozumplík: Recursive method and general purpose program RANG to analyze nonlinear circuits. (in Czech). Research report, project no. III-3-1/1, Technical University Brno, 1975.
[3] J. Jan O. Gotfrýd J. Holčík J. Kozumplík: Analysis of nonlinear circuits by means of the generalized recursive method. Proc. of the II-nd Int. Conference on Electronic Circuits, Prague 1976.
[4] P. Hladký: Use of the recursive method in analysis of transients in nonlinear circuits. (in Czech). Thesis, Dept. of Computers, Technical University of Brno, 1976.
[5] J. Jan O. Gotfrýd J. Holčík J. Kozumplík: Recursive analysis of nonlinear circuits. (in Czech). Slaboproudý obzor 39, 1978, no. 1.
[6] J. Jan: Recursive algorithms to solve systems of nonlinear equations. Proc. of the 7-th European Conference on Circuit Theory and Design, Prague 1985. Zbl 0585.65041
Partner of
EuDML logo