NDLI: Blending Set and Interval Arithmetic for Maximal Reliability

Please wait, while we are loading the content...

Blending Set and Interval Arithmetic for Maximal Reliability

Content Provider	Springer Nature Link
Author	Verdonk, B. Vervloet, J. Cuyt, A.
Copyright Year	2004
Abstract	In both [3] and [8], the authors review the implementation of the basic operations in interval arithmetic, and in particular discuss the different approaches given in the literature for interval division when the divisor interval contains zero. In these papers, and in the references therein, the basic operations are defined for real or extended real interval operands.Division by an interval containing zero is a special case of an interval function for which the input arguments contain points outside the domain of the underlying point function. A number of approaches exist in the literature, [7], [12], to remove restrictions on the domain of interval functions and hence obtain a closed, exception-free interval system.In this paper, we present an alternative approach to remove restrictions on the domain of interval functions and to guarantee the inclusion property in all situations, even when some input intervals contain points that lie outside the domain of the underlying point function. To achieve this, we allow for the (efficient) set-based representation of non-real results. The computed intervals are sharp, yet contain more information and the resulting interval system is closed and exception-free. We also show how the presented ideas can be implemented in an interval arithmetic library. The performance overhead is negligible compared to the fact that the implementation using the new approach offers 100% reliability in return.The structure of the paper is as follows. We set off with a motivating example in Sect. 1. In Sect. 2, we review various approaches to interval division and then introduce vset-division of real intervals, based on the newly introduced concept of value set or vset. In Sect. 3, we give a formal definition of real vset-intervals and arithmetic on these intervals. We prove a number of essential properties and point out the likenesses and differences with other approaches. Finally, in Sect. 4, we discuss the implementation of vset-interval arithmetic in a floating-point context.
Starting Page	41
Ending Page	65
Page Count	25
File Format	PDF
ISSN	0010485X
Journal	Computing
Volume Number	74
Issue Number	1
e-ISSN	14365057
Language	English
Publisher	Springer-Verlag
Publisher Date	2004-12-20
Publisher Place	Vienna
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Interval arithmetic inclusion property Computational Mathematics and Numerical Analysis
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics Numerical Analysis Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A sufficient condition for non-overestimation in interval arithmetic

Specification of hardware for interval arithmetic

Interval Arithmetic with Containment Sets

A Generalized Kahan-Babuška-Summation-Algorithm

Sensitivity-based feedforward and feedback control for uncertain systems

Horner's Rule for Interval Evaluation Revisited

Weierstrass-like Methods with Corrections for the Inclusion of Polynomial Zeros

A verified realization of a Dempster–Shafer based fault tree analysis

Derivative Free Inclusion Methods for Polynomial Zeros

Blending Set and Interval Arithmetic for Maximal Reliability

Similar Documents

A sufficient condition for non-overestimation in interval arithmetic

Specification of hardware for interval arithmetic

Interval Arithmetic with Containment Sets

A Generalized Kahan-Babuška-Summation-Algorithm

Sensitivity-based feedforward and feedback control for uncertain systems

Horner's Rule for Interval Evaluation Revisited

Weierstrass-like Methods with Corrections for the Inclusion of Polynomial Zeros

A verified realization of a Dempster–Shafer based fault tree analysis

Derivative Free Inclusion Methods for Polynomial Zeros

Blending Set and Interval Arithmetic for Maximal Reliability