Ulrich,
Currently the ".bib" file in the P1788 repository contains the entries below.
Please say which are incorrect and correct them.
Thanks,
-Dima
@book{Kulisch2008a,
title = {Complete interval arithmetic and its implementation
on the computer},
author = {Kulisch, Ulrich W},
year = 2009,
publisher = {Springer}
}
@book{Kulisch2008b,
title = {Computer arithmetic and validity: Theory,
implementation, and applications},
author = {Kulisch, Ulrich},
volume = 33,
year = 2013,
publisher = {Walter de Gruyter}
}
@article{KulischSnyder2009a,
title = {The exact dot product as basic tool for long
interval arithmetic},
author = {Kulisch, Ulrich and Snyder, Van},
journal = {Computing},
volume = 91,
number = 3,
pages = {307--313},
year = 2011,
publisher = {Springer}
}
----- Original Message -----
From: ulrich.kulisch@xxxxxxx
To: wolff@xxxxxxxxxxxxxxxxxxxxxxxxxxx, stds-1788@xxxxxxxxxxxxxxxxx
Sent: Monday, May 26, 2014 7:47:04 PM GMT +04:00 Abu Dhabi / Muscat
Subject: Re: the final text - bib
Dear colleagues:
Am 24.05.2014 18:48, schrieb Jürgen Wolff von Gudenberg:
Dear Prof Kulisch, dear colleagues.
let me first clarify an obvious misunderstanding :
in my draft9-2 version of the p1788 document [7] is Marco's,
Stefan's and my contribution to scan2010 .
your book is [4]
I do not understand this. As I mentioned in an
earlier mail I am using DRAFT P1788/D9.2, dated May 7, 2014
and there [7] is my book.
But nevertheless, the confusion caused me to send you some
comments of which I hope they contribute clarifying the situation.
Dear Prof Kulisch
Now to complete arithmetic.
In your email, you say :
This immediately leads to the requirement to
compute dot products of two
floating-point vectors with just one rounding (correctly
rounded).
and this is required in 12.12.12
Hence, we should be happy that complete arithmetic is included
although its inputs are float vectors.
Complete arithmetic computes dot products exactly what a
correctly rounded dot product does not!
However, a look into the computing
history (before the electronic age) does not help to define a
standard for the future. perhaps, the dawning of the
floating-point age is already foreseeable ??
Many old computers (before the electronic age) provided an exact dot product
in addtition to the four elementary arithmetic operations. Complete arithmetic does exactly this.
It exceeds floating-point arithmetic.
It can be used to overcome shortcomings of floating-point and of
naive interval arithmetic.
Jürgen
Am 24.05.2014 16:14, schrieb Ulrich
Kulisch:
Dear
colleagues:
Let me comment a little on [7]. Compared with P1788 the book
takes
a more general approach to interval arithmetic. It does not just
consider
arithmetic for intervals over the real numbers. It also defines
and studies
arithmetic for *intervals* in the usual product spaces of
computation like
complex numbers, and for *intervals *of vectors and matrices
over the real
and complex numbers. All these interval operations are defined
by a general
mapping principle (semimorphism) which produces the best
possible answer.
This immediately leads to the requirement to compute dot
products of two
floating-point vectors with just one rounding (correctly
rounded).
However, a look into the computing history (before the
electronic age) shows
that the simplest and fastest way for computing a dot product is
to compute
it exactly in fixed point arithmetic^§ . This is an essential
mean to speed up computing.
Complete arithmetic does just this. It is fast and exact vector
processing. *
In addition to this it turns out that the exact dot product is a
most
**general tool for obtaining high accuracy in interval
computations,
*a feature not yet considered in P1788.*
***
There is nothing that can be or needs to be standardized in
complete arithmetic.
Repeating the empty argument "complete arithmetic needs a
standard of its own"
again and again, has distracted the attention of many members of
P1788. It
hurt its development.
In an early stage of the P1788 development complete arithmetic
was listed
very early under basic arithmetic operations. This would give it
the necessary
emphasis. I have no doubts that manufacturers would react and
provide it
well implmented on modern processors. The technology allows this
easily.
For more details see [7].
With best wishes
Ulrich
^§ No intermediate results after multiplications and additions
need to be stored and
read in again for the next operation. No intermediate roundings
and normalizations
have to be performed. No intermediate overflow or underflow can
occur. No error
analysis is necessary. The result is always exact. It is
independent of the order in
which the summands are added. Rounding is only done, if
required, at the very
end of the accumulation.
Am 06.05.2014 01:20, schrieb Jürgen Wolff von Gudenberg:
is now online!
I start the discussion with a few remarks on the bibliography
- drop [1] and [2] they import only notation
- drop [10] or include other motions as well
- include more position papers or drop [5]
-add or replace [7] by
Parallel Detection of Interval Overlapping. Nehmeier, Marco;
Siegel, Stefan; Wolff von Gudenberg, Jürgen K. Jónasson (ed.),
(2012). (Vol. 7134) 127-136.
We should decide whether we list position papers. I suggest to
take those whih appeared also elsewhere
Jürgen
--
Karlsruher Institut für Technologie (KIT)
Institut für Angewandte und Numerische Mathematik
D-76128 Karlsruhe, Germany
Prof. Ulrich Kulisch
Telefon: +49 721 608-42680
Fax: +49 721 608-46679
E-Mail: ulrich.kulisch@xxxxxxx
www.kit.edu
www.math.kit.edu/ianm2/~kulisch/
KIT - Universität des Landes Baden-Württemberg
und nationales Großforschungszentrum in der
Helmholtz-Gesellschaft