License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2251
URN: urn:nbn:de:0030-drops-22516
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2251/
Go to the corresponding OASIcs Volume Portal

Kreinovich, Vladik
Invited Talks

From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk)

pdf-format:
Kreinovich.2251.pdf (0.3 MB)

Abstract

Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds $\Delta$ on the measurement errors. In this case, based on the measurement result $\widetilde x$, we can only conclude that the actual (unknown) value $x$ of the desired quantity is in the interval $[\widetilde x-\Delta,\widetilde x+\Delta]$.

In interval computations, at each intermediate stage of the computation, we have intervals of possible values of the corresponding quantities. As a result, we often have bounds with excess width. To remedy this problem, in our previous papers, we proposed an extension of interval technique to {\it set computations}, where on each stage, in addition to intervals of possible values of the quantities, we also keep sets of possible values of pairs (triples, etc.). In this paper, we show that in several practical problems, such as estimating statistics (variance, correlation, etc.) and solutions to ordinary differential equations (ODEs) with given accuracy, this new formalism enables us to find estimates in feasible (polynomial) time.

BibTeX - Entry

@InProceedings{kreinovich:OASIcs:2009:2251,
  author =	{Vladik Kreinovich},
  title =	{{From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interval and p-Box Uncertainty (Invited Talk)}},
  booktitle =	{6th International Conference on Computability and Complexity in Analysis (CCA'09)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-12-5},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{11},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2251},
  URN =		{urn:nbn:de:0030-drops-22516},
  doi =		{10.4230/OASIcs.CCA.2009.2251},
  annote =	{Keywords: Interval computations, set computations, probability boxes, uncertainty, efficient algorithms}
}

Keywords: Interval computations, set computations, probability boxes, uncertainty, efficient algorithms
Collection: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue Date: 2009
Date of publication: 25.11.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI