Detail publikace

Exploiting Matrix Sparsity for Symbolic Analysis

Originální název

Exploiting Matrix Sparsity for Symbolic Analysis

Anglický název

Exploiting Matrix Sparsity for Symbolic Analysis

Jazyk

en

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.

BibTex


@inproceedings{BUT12652,
  author="Zdeněk {Kolka} and Viera {Biolková} and Dalibor {Biolek}",
  title="Exploiting Matrix Sparsity for Symbolic Analysis",
  annote="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.",
  address="WSEAS Press",
  booktitle="Proc. of 4th WSEAS International Conference on Applied Informatics and Communications",
  chapter="12652",
  institution="WSEAS Press",
  year="2004",
  month="december",
  pages="234",
  publisher="WSEAS Press",
  type="conference paper"
}