Detail publikace

Accurate Time-Domain Semisymbolic Analysis

Originální název

Accurate Time-Domain Semisymbolic Analysis

Anglický název

Accurate Time-Domain Semisymbolic Analysis

Jazyk

en

Originální abstrakt

The paper deals with a method for accurate semisymbolic time-domain analysis of highly idealized linear lumped circuits. Pulse and step responses can be computed by means of the partial fraction decomposition. The procedure relies on an accurate computation of poles of the transfer function. The well known problem of the QR and QZ algorithms is their poor accuracy in the case of multiple roots. Moreover, the partial fraction decomposition itself is an ill-posed problem for closelyspaced clusters of roots. The method presented in this paper is based on an improved reduction procedure for transforming the generalized eigenproblem into a standard one in combination with an algorithm for computing the Jordan canonical form of inexact matrices.

Anglický abstrakt

The paper deals with a method for accurate semisymbolic time-domain analysis of highly idealized linear lumped circuits. Pulse and step responses can be computed by means of the partial fraction decomposition. The procedure relies on an accurate computation of poles of the transfer function. The well known problem of the QR and QZ algorithms is their poor accuracy in the case of multiple roots. Moreover, the partial fraction decomposition itself is an ill-posed problem for closelyspaced clusters of roots. The method presented in this paper is based on an improved reduction procedure for transforming the generalized eigenproblem into a standard one in combination with an algorithm for computing the Jordan canonical form of inexact matrices.

BibTex


@inproceedings{BUT34887,
  author="Zdeněk {Kolka} and Dalibor {Biolek} and Viera {Biolková}",
  title="Accurate Time-Domain Semisymbolic Analysis",
  annote="The paper deals with a method for accurate semisymbolic time-domain analysis of highly idealized linear lumped circuits. Pulse and step responses can be computed by means of the partial fraction decomposition. The procedure relies on an accurate computation of poles of the transfer function. The well known problem of the QR and QZ algorithms is their poor accuracy in the case of multiple roots. Moreover, the partial fraction decomposition itself is an ill-posed problem for closelyspaced clusters of roots. The method presented in this paper is based on an improved reduction procedure for transforming the generalized eigenproblem into a standard one in combination with an algorithm for computing the Jordan canonical form of inexact matrices.",
  address="IEEE",
  booktitle="Proceedings of XIth International Workshop on Symbolic and Numerical Methods, Modeling and Application to Circuit Design SM2ACD 2010",
  chapter="34887",
  howpublished="electronic, physical medium",
  institution="IEEE",
  year="2010",
  month="october",
  pages="137--140",
  publisher="IEEE",
  type="conference paper"
}