Tolerance-based 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%3A00449119" target="_blank" >RIV/60162694:G43__/11:00449119 - 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
Tolerance-based Control Mechanism for Approximate Symbolic Analysis
Original language description
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.
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 IEEE Region 8 AFRICON 2011 conference
ISBN
978-1-61284-991-1
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
1-4
Publisher name
IEEE
Place of publication
Livingstone, Zambia
Event location
Livingstone, Zambia
Event date
Jan 1, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)