Implicit steepest descent method and its analogy with charge-up method based on virtual capacitors in network analysis

Author

Asai, Hideki

Author_Institution

Dept. of Opt-Electronic & Mech. Eng., Shizuoka Univ., Hamamatsu, Japan

fYear

1988

fDate

7-9 Jun 1988

Firstpage

1115

Abstract

The author describes an implicit steepest-descent method for stable convergent numerical analysis of nonlinear algebraic equations. First, he shows the equivalence between the charge-up method based on the virtual capacitors used in circuit simulation and the homotopic method studied in the field of nonlinear programming. Next, he describes the physical significance of the steepest-descent method in network simulation. Furthermore, he suggests an implicit steepest descent method and shows the analogy with the charge-up method. Finally, he applies this implicit method to nonlinear network analysis and verifies its availability. The applicability of the proposed approach to MOS-circuit simulation is mentioned

Keywords

circuit analysis computing; convergence of numerical methods; nonlinear network analysis; MOS-circuit simulation; applicability; charge-up method; circuit simulation; homotopic method; implicit steepest-descent method; network analysis; network simulation; nonlinear algebraic equations; nonlinear network analysis; nonlinear programming; physical significance; stable convergent numerical analysis; virtual capacitors; Availability; Capacitors; Circuit simulation; Convergence; Intelligent networks; Jacobian matrices; Nonlinear equations; Numerical analysis; Relaxation methods; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1988., IEEE International Symposium on

Conference_Location

Espoo

Type

conf

DOI

10.1109/ISCAS.1988.15121

Filename

15121