A very fast and simple algorithm for finding all equilibrium points of dynamic 1-dimensional (1D) arrays, constituted by resistively-coupled dynamic piecewise-linear cells (for example, oscillators) is presented. This algorithm is based on the recursive construction of a uni-path $v$-$i$ characteristic derived from the associated resistive array, obtained by opening the capacitors and shortening the inductors within dynamic cells. Some examples show the efficiency of the algorithm. About 30,000 equilibrium points of a 100-cell array are determined within a few seconds with a common PC.
A Fast and Simple Method to Find All Equilibrium Points of Dynamic 1D Arrays
PASTORE, STEFANO;
2001-01-01
Abstract
A very fast and simple algorithm for finding all equilibrium points of dynamic 1-dimensional (1D) arrays, constituted by resistively-coupled dynamic piecewise-linear cells (for example, oscillators) is presented. This algorithm is based on the recursive construction of a uni-path $v$-$i$ characteristic derived from the associated resistive array, obtained by opening the capacitors and shortening the inductors within dynamic cells. Some examples show the efficiency of the algorithm. About 30,000 equilibrium points of a 100-cell array are determined within a few seconds with a common PC.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
