Recursive algorithms for solving systems of nonlinear equations
Aplikace matematiky (1989)
- Volume: 34, Issue: 1, page 33-45
- ISSN: 0862-7940
Access Full Article
top
Abstract
topHow to cite
topJan, Jiří. "Recursive algorithms for solving systems of nonlinear equations." Aplikace matematiky 34.1 (1989): 33-45. <http://eudml.org/doc/15562>.
@article{Jan1989,
abstract = {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.},
author = {Jan, Jiří},
journal = {Aplikace matematiky},
keywords = {recursive algorithms; root-finding algorithms; comparison; Newton-Raphson iteration; iteration by components; nonlinear equations; recursive algorithms; root-finding algorithms; comparison; Newton-Raphson iteration; iteration by components},
language = {eng},
number = {1},
pages = {33-45},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Recursive algorithms for solving systems of nonlinear equations},
url = {http://eudml.org/doc/15562},
volume = {34},
year = {1989},
}
TY - JOUR
AU - Jan, Jiří
TI - Recursive algorithms for solving systems of nonlinear equations
JO - Aplikace matematiky
PY - 1989
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 34
IS - 1
SP - 33
EP - 45
AB - 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.
LA - eng
KW - recursive algorithms; root-finding algorithms; comparison; Newton-Raphson iteration; iteration by components; nonlinear equations; recursive algorithms; root-finding algorithms; comparison; Newton-Raphson iteration; iteration by components
UR - http://eudml.org/doc/15562
ER -
References
top- 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. (1975)
- 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. (1975)
- 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. (1976)
- 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. (1976)
- J. Jan O. Gotfrýd J. Holčík J. Kozumplík, Recursive analysis of nonlinear circuits, (in Czech). Slaboproudý obzor 39, 1978, no. 1. (1978)
- J. Jan, Recursive algorithms to solve systems of nonlinear equations, Proc. of the 7-th European Conference on Circuit Theory and Design, Prague 1985. (1985) Zbl0585.65041
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.