Worst-Case Control Mechanism for Approximate Symbolic Analysis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F11%3A00449097" target="_blank" >RIV/60162694:G43__/11:00449097 - isvavai.cz</a>
Result on the web
<a href="http://vavtest.unob.cz/registr" target="_blank" >http://vavtest.unob.cz/registr</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Worst-Case Control Mechanism for Approximate Symbolic Analysis
Original language description
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.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the International conference on MATHEMATICAL MODELS FOR ENGINEERING SCIENCE (MMES 2011)
ISBN
978-1-61804-058-9
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
160-164
Publisher name
IEEEAM
Place of publication
Tenerife, Spain
Event location
Tenerife, Spain
Event date
Jan 1, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)