Detail publikace

Tolerance-based Control Mechanism for Approximate Symbolic Analysis

Originální název

Tolerance-based Control Mechanism for Approximate Symbolic Analysis

Anglický název

Tolerance-based Control Mechanism for Approximate Symbolic Analysis

Jazyk

en

Originální abstrakt

The paper deals with an enhanced control mechanism for approximate symbolic analysis of the Simplification-Before- Generation class. A traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses sensitivities to estimate the worst-case error due to component tolerances, i.e. the expression validity is checked over the tolerance interval of component parameters. A fast computational algorithm based on the Sherman-Morrison formula is used. The numerical cost is approximately given by two matrix inversions per one control-frequency point and one simplification step.

Anglický abstrakt

The paper deals with an enhanced control mechanism for approximate symbolic analysis of the Simplification-Before- Generation class. A traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses sensitivities to estimate the worst-case error due to component tolerances, i.e. the expression validity is checked over the tolerance interval of component parameters. A fast computational algorithm based on the Sherman-Morrison formula is used. The numerical cost is approximately given by two matrix inversions per one control-frequency point and one simplification step.

BibTex


@inproceedings{BUT74682,
  author="Zdeněk {Kolka} and Dalibor {Biolek} and Viera {Biolková} and Josef {Dobeš}",
  title="Tolerance-based Control Mechanism for Approximate Symbolic Analysis",
  annote="The paper deals with an enhanced control mechanism for approximate symbolic analysis of the Simplification-Before- Generation class. A traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses sensitivities to estimate the worst-case error due to component tolerances, i.e. the expression validity is checked over the tolerance interval of component parameters. A fast computational algorithm based on the Sherman-Morrison formula is used. The numerical cost is approximately given by two matrix inversions per one control-frequency point and one simplification step.",
  address="IEEE",
  booktitle="Proceedings of the IEEE Region 8 AFRICON 2011 conference",
  chapter="74682",
  doi="10.1109/AFRCON.2011.6072093",
  howpublished="electronic, physical medium",
  institution="IEEE",
  year="2011",
  month="september",
  pages="1--4",
  publisher="IEEE",
  type="conference paper"
}