Detail publikace

Topological simplification using sparse matrices and Sherman-Morrison formula

Martin Horák, Zdeněk Kolka

Originální název

Topological simplification using sparse matrices and Sherman-Morrison formula

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

This contribution describes an implementation of an algorithm for the approximate symbolic analysis of linearized circuits, known as Simplification Before Generation (SBG). The implementation uses Sherman-Morison formula and sparse matrix techniques for computing an inverse matrix that is required for determining negligible elements in an analyzed circuit. The effectivity of these techniques has been compared on benchmarking and real circuits.

Klíčová slova

topological simplification, approximate symbolic analysis, sparse matrix, Sherman-Morrison formula

Autoři

Martin Horák, Zdeněk Kolka

Rok RIV

2005

Vydáno

26. 9. 2005

Nakladatel

Somaru, Ljubljana

Místo

Portorož, Slovinsko

ISSN

1581-4572

Periodikum

Proceedings of the 15th International Electrotechnical and Computer Science Conference ERK 2006

Ročník

14

Číslo

1

Stát

Slovinská republika

Strany od

36

Strany do

39

Strany počet

4

BibTex

@inproceedings{BUT14995,
  author="Martin {Horák} and Zdeněk {Kolka}",
  title="Topological simplification using sparse matrices and Sherman-Morrison formula",
  booktitle="Proceedings of the fourteenth International Electrotechnical and Computer Science Conference ERK 2005",
  year="2005",
  journal="Proceedings of the 15th International Electrotechnical and Computer Science Conference ERK 2006",
  volume="14",
  number="1",
  pages="4",
  publisher="Somaru, Ljubljana",
  address="Portorož, Slovinsko",
  issn="1581-4572"
}