Publication result detail

Exploiting Matrix Sparsity for Symbolic Analysis

KOLKA, Z., BIOLKOVÁ, V., BIOLEK, D.

Original Title

Exploiting Matrix Sparsity for Symbolic Analysis

English Title

Exploiting Matrix Sparsity for Symbolic Analysis

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

This paper deals with a method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits. The method is based on a simplification of the equations of circuit models of linear or linearized circuits in the frequency domain. The simplified model is then analyzed symbolically. The algorithm proposed has been developed with the aim of obtaining maximum computational efficiency.

English abstract

This paper deals with a method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits. The method is based on a simplification of the equations of circuit models of linear or linearized circuits in the frequency domain. The simplified model is then analyzed symbolically. The algorithm proposed has been developed with the aim of obtaining maximum computational efficiency.

Keywords

symbolic analysis, sparse matrices

Key words in English

symbolic analysis, sparse matrices

Authors

KOLKA, Z., BIOLKOVÁ, V., BIOLEK, D.

RIV year

2011

Released

10.12.2004

ISBN

1109-2734

Periodical

WSEAS Transactions on Circuits

Volume

3

Number

10

State

Hellenic Republic

Pages from

2278

Pages count

4

BibTex

@article{BUT45902,
  author="Zdeněk {Kolka} and Viera {Biolková} and Dalibor {Biolek}",
  title="Exploiting Matrix Sparsity for Symbolic Analysis",
  journal="WSEAS Transactions on Circuits",
  year="2004",
  volume="3",
  number="10",
  pages="4",
  issn="1109-2734"
}