Loading [MathJax]/extensions/MathZoom.js
This article is a case study in the implementation of a portable,
proven and efficient correctly rounded elementary function in
double-precision. We describe the methodology used to achieve these
goals in the crlibm library. There are two novel aspects to
this approach. The first is the proof framework, and in general the
techniques used to balance performance and provability. The second
is the introduction of processor-specific optimization to get
performance equivalent to the best current...
This paper reviews the use of set-membership methods in fault diagnosis (FD) and fault tolerant control (FTC). Setmembership methods use a deterministic unknown-but-bounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between observed and predicted behaviour by using simple sets to approximate the exact set of possible behaviour (in the parameter or the state space). When an inconsistency is detected between the measured and predicted...
Floating-point arithmetic provides a fast but inexact way of
computing geometric predicates. In order for these predicates to be
exact, it is important to rule out all the numerical situations where
floating-point computations could lead to wrong results. Taking into
account all the potential problems is a tedious work to do by hand. We
study in this paper a floating-point implementation of a filter for the
orientation-2 predicate, and how a formal and partially automatized
verification of this...
Currently displaying 1 –
8 of
8