Supernodal Analysis Revisited - Computer Science > Symbolic ComputationReportar como inadecuado

Supernodal Analysis Revisited - Computer Science > Symbolic Computation - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: In this paper we show how to extend the known algorithm of nodal analysis insuch a way that, in the case of circuits without nullors and controlled sourcesbut allowing for both, independent current and voltage sources, the system ofnodal equations describing the circuit is partitioned into one part, where thenodal variables are explicitly given as linear combinations of the voltagesources and the voltages of certain reference nodes, and another, whichcontains the node variables of these reference nodes only and which moreovercan be read off directly from the given circuit. Neither do we needpreparational graph transformations, nor do we need to introduce additionalcurrent variables as in MNA. Thus this algorithm is more accessible tostudents, and consequently more suitable for classroom presentations.

Autor: Eberhard H.-A. Gerbracht


Documentos relacionados