A generalization of \(p\)-boxes to affine arithmetic (Q411436): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Input variables with both interval and probabilistic uncertainties can be modelled by \(p\)-boxes and Dempster-Shafer structures (see, e.g., [\textit{S. Ferson, V. Kreinovich, L. Ginzburg, D. S. Myers} and \textit{K. Sentz}, ``Constructing probability boxes and Dempster-Shafer structures'', SAND report, SAND2002-4015 (2003), \url{http://www.sandia.gov/epistemic/Reports/SAND2002-4015.pdf}). Affine arithmetic is an extension of interval arithmetic (see [\textit{J. L. D. Comba} and \textit{J. Stolfi}, ``Affine arithmetic and its application to computer graphics'', Proc. SIBGRAPI'93 -- VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, Recife, Brasil, 9--18 (1993), \url{http://graphics.stanford.edu/~comba/papers/aa-93-09-sibgrapi-paper.pdf}]). In this paper, the authors combine both approaches and use some information about variable dependencies which leads to an increase in precision of the results and a decrease of computation time. | |||
Property / review text: Input variables with both interval and probabilistic uncertainties can be modelled by \(p\)-boxes and Dempster-Shafer structures (see, e.g., [\textit{S. Ferson, V. Kreinovich, L. Ginzburg, D. S. Myers} and \textit{K. Sentz}, ``Constructing probability boxes and Dempster-Shafer structures'', SAND report, SAND2002-4015 (2003), \url{http://www.sandia.gov/epistemic/Reports/SAND2002-4015.pdf}). Affine arithmetic is an extension of interval arithmetic (see [\textit{J. L. D. Comba} and \textit{J. Stolfi}, ``Affine arithmetic and its application to computer graphics'', Proc. SIBGRAPI'93 -- VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, Recife, Brasil, 9--18 (1993), \url{http://graphics.stanford.edu/~comba/papers/aa-93-09-sibgrapi-paper.pdf}]). In this paper, the authors combine both approaches and use some information about variable dependencies which leads to an increase in precision of the results and a decrease of computation time. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Wolfgang Näther / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60A86 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65G30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6022007 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
affine arithmetic | |||
Property / zbMATH Keywords: affine arithmetic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(p\)-boxes | |||
Property / zbMATH Keywords: \(p\)-boxes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
probability boxes | |||
Property / zbMATH Keywords: probability boxes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Dempster-Shafer structures | |||
Property / zbMATH Keywords: Dempster-Shafer structures / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: RAMAS Risk Calc / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00607-011-0182-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2104044130 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounding the results of arithmetic operations on random variables of unknown dependency using intervals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Best-possible bounds for the distribution of a sum -- a problem of Kolmogorov / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A zonotopic framework for functional abstractions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Static Analysis of Finite Precision Computations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4808034 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to copulas. Properties and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence of methods for uncertainty propagation of real-valued random variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4547771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131415 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilistic arithmetic. I: Numerical methods for calculating convolutions and dependency bounds / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:01, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A generalization of \(p\)-boxes to affine arithmetic |
scientific article |
Statements
A generalization of \(p\)-boxes to affine arithmetic (English)
0 references
4 April 2012
0 references
Input variables with both interval and probabilistic uncertainties can be modelled by \(p\)-boxes and Dempster-Shafer structures (see, e.g., [\textit{S. Ferson, V. Kreinovich, L. Ginzburg, D. S. Myers} and \textit{K. Sentz}, ``Constructing probability boxes and Dempster-Shafer structures'', SAND report, SAND2002-4015 (2003), \url{http://www.sandia.gov/epistemic/Reports/SAND2002-4015.pdf}). Affine arithmetic is an extension of interval arithmetic (see [\textit{J. L. D. Comba} and \textit{J. Stolfi}, ``Affine arithmetic and its application to computer graphics'', Proc. SIBGRAPI'93 -- VI Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, Recife, Brasil, 9--18 (1993), \url{http://graphics.stanford.edu/~comba/papers/aa-93-09-sibgrapi-paper.pdf}]). In this paper, the authors combine both approaches and use some information about variable dependencies which leads to an increase in precision of the results and a decrease of computation time.
0 references
affine arithmetic
0 references
\(p\)-boxes
0 references
probability boxes
0 references
Dempster-Shafer structures
0 references
0 references