Detail publikace

Worst-Case Control Mechanism for Approximate Symbolic Analysis

Originální název

Worst-Case Control Mechanism for Approximate Symbolic Analysis

Anglický název

Worst-Case Control Mechanism for Approximate Symbolic Analysis

Jazyk

en

Originální abstrakt

The paper deals with a control mechanism for approximate symbolic analysis of the Simplification-Before-Generation class that uses the worst case analysis to incorporate component variations into the ranking mechanism. The traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses a fast algorithm for computing the sensitivities needed for the vertex-based worst-case analysis. An advantage of the proposed approach is that the validity of approximated expression is checked over the tolerance interval of component parameters.

Anglický abstrakt

The paper deals with a control mechanism for approximate symbolic analysis of the Simplification-Before-Generation class that uses the worst case analysis to incorporate component variations into the ranking mechanism. The traditional approach consists in the evaluation of errors caused by simplification only for the nominal parameters of network components. The proposed procedure uses a fast algorithm for computing the sensitivities needed for the vertex-based worst-case analysis. An advantage of the proposed approach is that the validity of approximated expression is checked over the tolerance interval of component parameters.

BibTex


@inproceedings{BUT74713,
  author="Zdeněk {Kolka} and Viera {Biolková} and Dalibor {Biolek}",
  title="Worst-Case Control Mechanism for Approximate Symbolic Analysis",
  annote="The paper deals with a control mechanism for approximate symbolic analysis of the Simplification-Before-Generation class that uses the worst case analysis to incorporate component variations into the ranking mechanism. The traditional approach consists in the evaluation of errors caused by  simplification only for the nominal parameters of network components. The proposed procedure uses a fast algorithm for computing the sensitivities needed for the vertex-based worst-case analysis. An advantage of the proposed approach is that the validity of approximated expression is checked over the tolerance interval of component parameters.",
  address="IEEEAM",
  booktitle="Proceedings of the International conference on MATHEMATICAL MODELS FOR ENGINEERING SCIENCE (MMES 2011)",
  chapter="74713",
  howpublished="electronic, physical medium",
  institution="IEEEAM",
  year="2011",
  month="december",
  pages="160--164",
  publisher="IEEEAM",
  type="conference paper"
}