Abstract
We compare two approaches, the interval and the ellipsoidal ones, to the guaranteed estimation of errors of vector operations by considering the problem of multiplication of a vector by a matrix. It is shown that for a large class of linear operators the ellipsoidal estimates are more precise than the interval ones, even if the initial vector has interval error bounds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic Press, New York (1983)
Chernousko, F.L.: Estimation of State for Dynamical Systems. Nauka, Moscow (1988)
Chernousko, F.L.: State Estimation for Dynamic Systems. CRC Press, Boca Raton (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chernousko, F.L., Ovseevich, A.J., Tarabanko, Y.V. (2006). Comparison of Interval and Ellipsoidal Bounds for the Errors of Vector Operations. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_32
Download citation
DOI: https://doi.org/10.1007/11666806_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31994-8
Online ISBN: 978-3-540-31995-5
eBook Packages: Computer ScienceComputer Science (R0)