Split and Merge Strategies for Solving Uncertain Equations Using Affine Arithmetic
Journal Title: EAI Endorsed Transactions on Industrial Networks and Intelligent Systems - Year 2016, Vol 3, Issue 9
Abstract
The behaviour of systems is determined by various parameters. Due to several reasons like e. g. manufacturing tolerances these parameters can have some uncertainties. Corner Case and Monte Carlo simulations are well known approaches to handle uncertain systems. They sample the corners and random points of the parameter space, respectively. Both require many runs and do not guarantee the inclusion of the worst case. As alternatives, range based approaches can be used. They model parameter uncertainties as ranges. The simulation outputs are ranges which include all possible results created by the parameter uncertainties. One type of range arithmetic is the affine arithmetic, which allows to maintain linear correlations to avoid over-approximation. An equation solver based on affine arithmetic has been proposed earlier. Unlike many other range based approaches it can solve implicit non-linear equations. This is necessary for analog circuit simulation. For large uncertainties the solver suffers from convergence problems. To overcome these problems it is possible to split the parameter ranges, calculate the solutions separately and merge them again. For higher dimensional systems this leads to excessive runtimes as each parameter is split. To minimize the additional runtime several split and merge strategies are proposed and compared using two analog circuit examples.
Authors and Affiliations
Oliver Scharf, Markus Olbrich, Erich Barke
Keywords
Related Articles
- EP ID EP46052
- DOI http://dx.doi.org/10.4108/eai.24-8-2015.2260594
- Views 302
- Downloads 0
Applying algorithm finding shortest path in the multiple- weighted graphs to find maximal flow in extended linear multicomodity multicost network
The shortest path finding algorithm is used in many problems on graphs and networks. This article will introduce the algorithm to find the shortest path between two vertices on the extended graph. Next, the algorithm fin...
Welcome message from the Editors
This special issue is dedicated to Innovations for Community Services. The issue highlights papers selected from the presentations given during the 2014 14th International Conference on Innovations for Community Serv...
Outage Performance of a Two-branch Cooperative Energy-constrained Relaying Network with Selection Combining at Destination
In this paper, we investigate two-branch cooperative DF relaying networks with selection combining at the destination. Two intermediate relay-clusters (a conventional relay cluster and an energy-constrained relay cluster...
Knowledge Extraction Framework for Building a Largescale Knowledge Base
As the Web has already permeated to life styles of human beings, people tend to consume more data in online spaces, and to exchange their behaviours among others. Simultaneously, various intelligent services are availabl...
Attribution of Cyber Attacks on Industrial Control Systems
In order to deter or prosecute for cyber attacks on industrial control systems it is necessary to assign attribution to the attacker and define the type of attack so that international law enforcement agencies or nationa...