Publication detail

Worst-Case Control Mechanism for Approximate Symbolic Analysis

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

Original Title

Worst-Case Control Mechanism for Approximate Symbolic Analysis

English Title

Worst-Case Control Mechanism for Approximate Symbolic Analysis

Type

conference paper

Language

en

Original Abstract

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.

English abstract

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.

Keywords

Symbolic analysis, Simplification, Error prediction, Worst-case analysis, Linear circuits; CAD tools

RIV year

2011

Released

10.12.2011

Publisher

IEEEAM

Location

Tenerife, Spain

ISBN

978-1-61804-055-8

Book

Proceedings of the International conference on MATHEMATICAL MODELS FOR ENGINEERING SCIENCE (MMES 2011)

Pages from

160

Pages to

164

Pages count

5

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