A family of semi-analytical recursive algorithms of convolution calculations as a convenient tool for electronic circuit simulation is described. The formulas defining these algorithms are presented and their numerical performance - accuracy, numerical complexity and stability are analyzed. The main purpose of this paper is to compare the recursive convolution algorithms with the known algorithms of differential equation integration in application to time-domain circuit simulation. In addition, simple examples of simulation are presented. The main advantage of the proposed approach results from the excellent stability performance of recursive convolution algorithms.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.