Detail publikačního výsledku

Exploiting Matrix Sparsity for Symbolic Analysis

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

Originální název

Exploiting Matrix Sparsity for Symbolic Analysis

Anglický název

Exploiting Matrix Sparsity for Symbolic Analysis

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

symbolic analysis, sparse matrices

Klíčová slova v angličtině

symbolic analysis, sparse matrices

Autoři

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

Rok RIV

2011

Vydáno

10.12.2004

ISSN

1109-2734

Periodikum

WSEAS Transactions on Circuits

Svazek

3

Číslo

10

Stát

Řecká republika

Strany od

2278

Strany počet

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