Thread Links Date Links
Thread Prev Thread Next Thread Index Date Prev Date Next Date Index

Re: A question Re: Level 1 <---> level 2 mappings; arithmetic versus applications



Am 30.06.2010 23:11, schrieb Dan Zuras Intervals:
From: "Nate Hayes"<nh@xxxxxxxxxxxxxxxxx>
To: "Dan Zuras Intervals"<intervals08@xxxxxxxxxxxxxx>,
	"Ralph Baker Kearfott"<rbk@xxxxxxxxxxxx>
Cc: "P-1788"<stds-1788@xxxxxxxxxxxxxxxxx>,
	"Dan Zuras Intervals"<intervals08@xxxxxxxxxxxxxx>
Subject: Re: A question Re: Level 1<--->  level 2 mappings; arithmetic versus applications
Date: Wed, 30 Jun 2010 15:05:39 -0500

Dan Zuras wrote:

. . .

John has previously made the observation that there is an exact mapping from
Level 2 mid-rad interval to Level 1 interval. Of course, once at Level 1
there is then also an exact mapping from mid-rad to inf-sup (or vice-versa).
So the only conversion that requires care is mapping back from Level 1 to
Level 2. However, it seems there is some Level 1 mid-rad interval
corresponding to some Level 2 mid-rad interval that is provably the tightest
possible Level 2 enclosure, so long as that Level 2 enclosure is represented
by a midpoint and a radius.

. . .

Nate


	Nate,

	I am going to pass on most of the content of your note
	to focus on this one statement because the fact that
	you state things in this way means I have not been
	clear.

	Level 1 is the set of all possible contiguous subsets
	of the extended Reals.

	Therefore there ARE NO mid-rad or inf-sups at level 1.
	Representations have no meaning there.

	Level 2 is some finite subset of the intervals that exist
	at level 1.

	What I am proposing is that the DEFINING characteristic
	of that subset be that the bounds be exactly (some say,
	losslessly) extractable as elements of some floating-point
	type F.

	Therefore, there are no mid-rad or inf-sups at level 2
	either.  Representations have no more meaning here then
	they do at level 1.

	All the formats live at lower levels.

	And I am proposing an approach that never speaks of them
	directly while still knowing that they exist&  taking
	care that some agreeable behavior is possible for them.

	That's all.


				Dan


Dan,

After having been quiet in the long discussion we want to congratulate you for clarifying the level structure.

Your new definition of level 2 is completely analogue to the specification of an interface (abstract data type) in object orientated programming. Where the methods are specified by pre- and post-conditions. The internal representation is not yet determined.

For example addition of two intervals A and B
	pre: A, B in IR
	post: (A + B).inf() == rnd_down(A.inf() + B.inf())
	      (A + B).sup() == rnd_up(A.sup() + B.sup())	

Now implementation (level 3) with inf-sup-intervals is obvious. The mid-rad-guys have to proof if they can meet the specification.


We will put in a motion that the standard will be written in this manner.

Note that motion 5 already close to this definition.
 	
Best regards

Jürgen & Marco
 	
--
     o           Marco Nehmeier, Lehrstuhl fuer Informatik II
    / \          Universitaet Wuerzburg, Am Hubland, D-97074 Wuerzburg
InfoII o         Tel.: +49 931 / 31 88684
  / \  Uni       E-Mail: nehmeier@xxxxxxxxxxxxxxxxxxxxxxxxxxx
 o   o Wuerzburg