On Quadratic Convergence of the Katzenelson-Like Algorithm for Solving Nonlinear Resistive Networks
Summary :
A globally and quadratically convergent algorithm is presented for solving nonlinear resistive networks containing transistors modeled by the Gummel-Poon model or the Shichman-Hodges model. This algorithm is based on the Katzenelson algorithm that is globally convergent for a broad class of piecewise-linear resistive networks. An effective restart technique is introduced, by which the algorithm converges to the solutions of the nonlinear resistive networks quadratically. The quadratic convergence is proved and also verified by numerical examples.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.10 pp.1700-1706
- Publication Date
- 1994/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Nonlinear Circuits and Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiyotaka YAMAMURA, "On Quadratic Convergence of the Katzenelson-Like Algorithm for Solving Nonlinear Resistive Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 10, pp. 1700-1706, October 1994, doi: .
Abstract: A globally and quadratically convergent algorithm is presented for solving nonlinear resistive networks containing transistors modeled by the Gummel-Poon model or the Shichman-Hodges model. This algorithm is based on the Katzenelson algorithm that is globally convergent for a broad class of piecewise-linear resistive networks. An effective restart technique is introduced, by which the algorithm converges to the solutions of the nonlinear resistive networks quadratically. The quadratic convergence is proved and also verified by numerical examples.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_10_1700/_p
Copy
@ARTICLE{e77-a_10_1700,
author={Kiyotaka YAMAMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Quadratic Convergence of the Katzenelson-Like Algorithm for Solving Nonlinear Resistive Networks},
year={1994},
volume={E77-A},
number={10},
pages={1700-1706},
abstract={A globally and quadratically convergent algorithm is presented for solving nonlinear resistive networks containing transistors modeled by the Gummel-Poon model or the Shichman-Hodges model. This algorithm is based on the Katzenelson algorithm that is globally convergent for a broad class of piecewise-linear resistive networks. An effective restart technique is introduced, by which the algorithm converges to the solutions of the nonlinear resistive networks quadratically. The quadratic convergence is proved and also verified by numerical examples.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - On Quadratic Convergence of the Katzenelson-Like Algorithm for Solving Nonlinear Resistive Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1700
EP - 1706
AU - Kiyotaka YAMAMURA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1994
AB - A globally and quadratically convergent algorithm is presented for solving nonlinear resistive networks containing transistors modeled by the Gummel-Poon model or the Shichman-Hodges model. This algorithm is based on the Katzenelson algorithm that is globally convergent for a broad class of piecewise-linear resistive networks. An effective restart technique is introduced, by which the algorithm converges to the solutions of the nonlinear resistive networks quadratically. The quadratic convergence is proved and also verified by numerical examples.
ER -
English
