Publication detail

Topological simplification using sparse matrices and Sherman-Morrison formula

Martin Horák, Zdeněk Kolka

Original Title

Topological simplification using sparse matrices and Sherman-Morrison formula

Type

conference paper

Language

English

Original Abstract

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.

Keywords

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

Authors

Martin Horák, Zdeněk Kolka

RIV year

2005

Released

26. 9. 2005

Publisher

Somaru, Ljubljana

Location

Portorož, Slovinsko

ISBN

1581-4572

Periodical

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

Year of study

14

Number

1

State

Republic of Slovenia

Pages from

36

Pages to

39

Pages count

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"
}