Tolerance-based Control Mechanism for Approximate Symbolic Analysis

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183908" target="_blank" >RIV/68407700:21230/11:00183908 - isvavai.cz</a>
Alternative codes found
RIV/00216305:26220/11:PU94744 RIV/60162694:G43__/11:00449119
Result on the web
<a href="http://dx.doi.org/10.1109/AFRCON.2011.6072093" target="_blank" >http://dx.doi.org/10.1109/AFRCON.2011.6072093</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/AFRCON.2011.6072093" target="_blank" >10.1109/AFRCON.2011.6072093</a>

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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)