Abstract
Multidimensional uncertainties are borne by confidence ellipsoids and security polytopes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Imagine a straight line connecting any two points of a given solid. If every point on the line is a point of the solid, the latter is said to be convex. Hence, the solid’s interior features no hollows and the solid’s hull no indentations.
References
Journals
D.R. Chand, S.S. Kapur, An algorithm for convex polytopes. J. Assoc. Comput. Mach. 17, 78–86 (1979)
Works by the Author
M. Grabe, Anpassung eines Kreises nach kleinsten Quadraten (Least squares fitting of a circle), in Jahresbericht der Physikalisch-Technischen Bundesanstalt (1989), pp. 210–211
M. Grabe, Uncertainties, confidence ellipsoids and security polytopes in LSA. Phys. Lett. A 165, 124–132 (1992). Erratum A 205, 425 (1995)
M. Grabe, On the estimation of one- and multidimensional uncertainties, in Proceedings of the National Conference of Standards Laboratories, Albuquerque, USA, 25–29 July 1993, pp. 569–576
M. Grabe, Generalized Gaussian Error Calculus (Springer, Berlin, 2010), 301 p. 100 illus., ISBN 978-3-642-03304-9, e-ISBN 978-3-642-03305-6
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grabe, M. (2014). Uncertainty Spaces. In: Measurement Uncertainties in Science and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-04888-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-04888-8_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04887-1
Online ISBN: 978-3-319-04888-8
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)