From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 07:51:06 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id HAA04273
for reliable_computing-outgoing; Thu, 8 Apr 1999 07:51:06 -0500 (CDT)
Received: from tik2.ethz.ch (kom-tik2.ethz.ch [129.132.66.10])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id HAA04268
for ; Thu, 8 Apr 1999 07:51:01 -0500 (CDT)
Received: from tec25.ethz.ch (tec25 [129.132.119.25])
by tik2.ethz.ch (8.8.8/8.8.8) with ESMTP id OAA26906
for ; Thu, 8 Apr 1999 14:50:47 +0200 (MET DST)
From: Application Asm
Received: (from asm@localhost)
by tec25.ethz.ch (8.8.8/8.8.8) id OAA05115
for reliable_computing [at] interval [dot] usl.edu; Thu, 8 Apr 1999 14:50:47 +0200 (MET DST)
Date: Thu, 8 Apr 1999 14:50:47 +0200 (MET DST)
Message-Id: <199904081250.OAA05115 [at] tec25 [dot] ethz.ch>
To: reliable_computing [at] interval [dot] usl.edu
Subject: ASM2000, preliminary announcement
X-Sun-Charset: US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Apologies for multiple copies of this ......
______________________________________________________________________
____________ _____________
____________ ASM2000, http://www.tik.ee.ethz.ch/~asm/2000 _____________
_________________________________________________________________________
In March 2000, an Abstract State Machine (ASM) Workshop (a follow up of
the 2nd Cannes ASM Workshop) will be held in the conference center of
the Swiss Federal Institute of Technology at Monte Verita, Ticino,
Switzerland. (Please see http://www.csf-mv.ethz.ch for information on
the Monte Verita Center)
The ASM formalism was proposed together with the thesis that it is
suitable to model arbitrary algorithms on arbitrary abstraction levels.
ASMs have been used to analyse and specify various hardware- and software-
systems as well as computer languages.
(Please see http://www.eecs.umich.edu/gasm for information on ASMs)
ASMs have imperative flavor and can be used to bridge the gap between
engineers and theoreticians. The aim of the workshop is to bring toghether
domain-experts using ASMs as practical specification formalisms, and
theoreticians using ASMs as formal starting point for their investigations.
In addition the workshop is a forum on theoretical and practical topics that
relate to ASMs in a broad sense. A significant part of the time will be
devoted to discussions.
The workshop is sponsored by the Swiss Federal Institute of Technology
and Microsoft Research.
Yuri Gurevich, Microsoft Research, Redmond, Washington, USA
(gurevich [at] microsoft [dot] com)
Philipp W. Kutter, Federal Institute of Technology, Zuerich, Switzerland
(kutter [at] tik [dot] ee.ethz.ch)
Martin Odersky, Federal Institute of Technology, Lausanne, Switzerland
(cismxo [at] cs [dot] unisa.edu.au)
Lothar Thiele, Federal Institute of Technology, Zuerich, Switzerland
(thiele [at] tik [dot] ee.ethz.ch)
_________________________________________________________________________
________________________ ___________________________
________________________ Important dates ___________________________
_________________________________________________________________________
Submission of contributions: November 20th, 1999
Notification of aceptance : January 10th, 2000
Workshop : March 19th - March 24th, 2000
________________________________________________________________________
________________________________________________________________________
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 09:40:09 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA04643
for reliable_computing-outgoing; Thu, 8 Apr 1999 09:40:09 -0500 (CDT)
Received: from cs.utep.edu ([129.108.5.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id JAA04638
for ; Thu, 8 Apr 1999 09:40:04 -0500 (CDT)
Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA22106; Thu, 8 Apr 99 08:25:03 MDT
Date: Thu, 8 Apr 99 08:25:03 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9904081425.AA22106 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
Subject: ISIPTA '99: Call for Participation
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
ANNOUNCEMENT AND CALL FOR PARTICIPATION
ISIPTA '99, the First International Symposium on Imprecise
Probabilities and Their Applications, will be held in Ghent,
Belgium, from 29 June until 2 July 1999.
Imprecise probability is a generic term for the many
mathematical models which measure chance or uncertainty
without sharp numerical probabilities. Such models are
needed in inference problems where the relevant information
is scarce, vague or conflicting, and in decision problems
where preferences are incomplete. Imprecise probability
models are being studied and applied by a large number of
researchers working in a great variety of fields. The aim
of this symposium is to bring these people together to
present recent research and to discuss issues of common
interest.
The symposium format
--------------------
The symposium is intended to promote discussion and
interaction between participants. Various theories of
imprecise probability have been developed, without a common
meeting place that would enable the theories to be discussed
and compared. To rectify this situation the symposium will
have an unusual format in some respects: instead of invited
speakers, there will be discussion sessions on topics that
are important, controversial and of general interest; there
will be no parallel sessions; and besides the usual paper
presentations in plenary sessions, there will be poster
presentations which enable discussions to take place in a
more informal atmosphere.
About the papers
----------------
About 50 papers will be presented at the symposium, on a
wide range of topics. They include a number of survey
papers on applications and problems of current interest.
The topics include mathematical models for uncertainty,
conditioning rules, models for independence, combination of
uncertainties, algorithms for computing inferences,
coherence, hierarchical models, imprecise Markov processes,
decision making, vagueness aversion, and Ellsberg's paradox.
The applications to be presented at the symposium include
applications in economics, decision making, statistical
inference, experimental studies of human judgement,
artificial intelligence, reliability, dynamical systems,
robotics, classification, and legal problems. The working
language of the symposium will be English.
Tutorials
---------
On Tuesday 29 June, the day before the actual ISIPTA
symposium begins, there will be three tutorials on some of
the fundamental concepts of imprecise probability. These
tutorials are aimed primarily at students and others who
wish to learn more about the basic ideas, and also at ISIPTA
participants who may want to understand the background to
some of the papers that will be presented during the
symposium, especially the papers on decision making,
economic applications and experimental psychology. Unlike
the papers presented during ISIPTA, the tutorials will be
mainly concerned with very basic concepts and not with
advanced or recent research. The three tutorials will cover
the following topics.
1. An Introduction to the Mathematics of Imprecise
Probabilities
Lecturer: Peter Walley.
Topics:
definitions of the various mathematical models (upper/lower
probabilities and previsions, coherence, Choquet capacities,
belief functions, possibility measures, etc.), their
mathematical properties, the relationships between them,
definitions of upper and lower expectations and conditioning
rules.
Duration: approx. 2 hours.
2. An Introduction to Ellsberg's Paradox, Ambiguity
Aversion and Related Topics in Experimental Psychology
Lecturer: Michael Smithson (Australian National University).
Topics:
Ellsberg's experiment, and other empirical work on ambiguity
aversion (vagueness aversion) and related topics. This
tutorial will explain the background to the papers on
experimental psychology and ambiguity aversion that will be
presented at the symposium.
Duration: approx. 1 hour.
3. Decision Theories Based on Non-Additive Measures of
Uncertainty
Lecturer: Jean-Yves Jaffray (Universite Pierre et Marie
Curie, Paris 6).
Topics:
non-expected-utility decision theories (i.e., alternatives
to maximising expected utility), the motivations behind
them, their interpretations, and some basic tools like
convex capacities and the Choquet integral. Most of the
ISIPTA papers that are concerned with decision making and
economic applications are based on the concepts covered in
this tutorial.
Duration: approx. 2 hours.
Presentation of the papers
--------------------------
The accepted papers will be presented in plenary and poster
sessions, from Wednesday 30 June until Friday 2 July. The
group discussions will also take place during these three
days. There will be no parallel sessions.
Venue
-----
The first ISIPTA '99 symposium will be held in conference
room Rector Vermeylen (second floor) of Het Pand, a former
Dominican monastery (13th century), now owned by the
Universiteit Gent. Het Pand is located in the historic
centre of Ghent, at the following address: Onderbergen 1,
9000 Ghent. For more information, consult the symposium web
site under the heading VENUE AND TOURIST INFORMATION.
Tourist information
-------------------
Ghent is one of the oldest cities in Flanders, the Dutch
speaking northern part of Belgium. It is a city rich in
history, architecture, art, culture and gastronomy. It is
also very close to other historical Flemish cities such as
Bruges and Antwerp. More details, and links to tourist
information about Ghent, Flanders and Belgium can also be
found at the symposium web site under the heading VENUE AND
TOURIST INFORMATION.
Accommodation in Ghent
----------------------
You can request hotel accommodation in Ghent, at a range of
prices, from the Belgian Tourist Reservation board (before 1
June 1999). More details, and the appropriate reservation
form, can be found on the symposium web site under the
heading HOW TO FIND ACCOMMODATION. Please book your
accommodation early, as June and July are very busy months
in Ghent.
Registration fees and deadlines
-------------------------------
There are two types of registration:
+ full registration: includes sessions, coffee breaks,
reception, banquet and a copy of the proceedings
+ student registration: includes sessions, coffee breaks and
reception
The tutorial sessions are free of charge, but we want to
stress that their purpose is to explain the basic concepts
of imprecise probability rather than to describe advanced
research.
For the student registration, we require proof of student
status (copy of student card).
The deadline for early registration is 31 May 1999. If you
register later than 31 May, your registration will be
considered as an on-site registration.
before 31 May 1999 (early) | after 31 May 1999 (on-site)
-------------------------------------------------------------
student 50 EUR | 70 EUR
full 200 EUR | 250 EUR
additional banquet ticket: 40 EUR
additional copy of proceedings: 50 EUR
Registration procedure
----------------------
Detailed information about how to register for participation
can be found at the symposium web site under the heading HOW
TO REGISTER FOR PARTICIPATION.
More information?
-----------------
Detailed information about all aspects of the symposium is
available on the symposium web site.
Questions?
----------
If you have any other questions about the symposium, please
contact the ISIPTA'99 Secretariat at the address given
below. We strongly encourage e-mail correspondence.
ISIPTA '99 Secretariat
p/a Gert de Cooman
Universiteit Gent
Onderzoeksgroep SYSTeMS
Technologiepark - Zwijnaarde 9
9052 Zwijnaarde
Belgium
Telephone: +32-(0)9-264.56.53
Fax : +32-(0)9-264.58.40
E-mail: isipta99 [at] ensmain [dot] rug.ac.be
Web site: http://ensmain.rug.ac.be/~isipta99
Important dates
---------------
deadline for early registration 31 May 1999
symposium 29 June - 2 July 1999
tutorials 29 June 1999
sessions 30 June - 2 July 1999
Organising committee
--------------------
Gert de Cooman (Universiteit Gent, Belgium, chairman)
Dirk Aeyels (Universiteit Gent, Belgium)
Fabio G. Cozman (Universidade de Sao Paulo, Brazil)
Heidi Jansegers (Tele Atlas, Belgium)
Etienne E. Kerre (Universiteit Gent, Belgium)
Serafin Moral (Universidad de Granada, Spain)
Da Ruan (SCK-CEN, Belgium)
Bartel Van de Walle (SCK-CEN, Belgium)
Peter Walley (Unversidade de Sao Paulo, Brazil)
Program committee
-----------------
Gert de Cooman (Universiteit Gent, Belgium)
Fabio G. Cozman (Universidade de Sao Paulo, Brazil)
Didier Dubois (Universit Paul Sabatier, France)
Angelo Gilio (Universita di Catania, Italy)
Michel Grabisch (Thomson-CSF, France)
Jean-Yves Jaffray (Universite Pierre et Marie Curie, France)
Brigitte Jaumard (Ecole Polytechnique de Montreal, Canada)
George J. Klir (Binghamton University, USA)
Serafin Moral (Universidad de Granada, Spain)
Robert Nau (Duke University, USA)
Luis R. Pericchi (Universidad Simon Bolivar, Venezuela)
Henri Prade (Universite Paul Sabatier, France)
David Schmeidler (Tel Aviv University, Israel and Ohio State University,
USA)
Teddy Seidenfeld (Carnegie Mellon University, USA)
Philippe Smets (Universite Libre de Bruxelles, Belgium)
Michael Smithson (Australian National University, Australia)
Wynn Stirling (Brigham Young University, USA)
Lev V. Utkin (Saint-Petersburg Forest Technical Academy, Russia)
Peter Walley (Chairman, Universidade de Sao Paulo, Brazil)
Nic Wilson (Oxford Brookes University, UK)
Our sponsors
------------
The organisation of ISIPTA '99 is made possible through the
support of the Universiteit Gent, and the Fund for
Scientific Research - Flanders (Belgium).
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 09:46:45 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA04838
for reliable_computing-outgoing; Thu, 8 Apr 1999 09:46:45 -0500 (CDT)
Received: from its.chem.uva.nl (its.chem.uva.nl [145.18.129.41])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id JAA04833
for ; Thu, 8 Apr 1999 09:46:40 -0500 (CDT)
Received: from chemeng.chem.uva.nl (unverified [145.18.135.56]) by its.chem.uva.nl
(Rockliffe SMTPRA 2.1.6) with ESMTP id for ;
Thu, 08 Apr 1999 16:46:37 +0200
Message-ID: <370CC1A5.BDFB8863 [at] chemeng [dot] chem.uva.nl>
Date: Thu, 08 Apr 1999 16:48:05 +0200
From: Jorge Alberto Copati
X-Mailer: Mozilla 4.5 [en] (WinNT; I)
X-Accept-Language: en
MIME-Version: 1.0
To: "reliable_computing [at] interval [dot] usl.edu"
Subject: Little problem
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear people of the list:
My name is Alberto Copati, and I'm doing a PhD on chemical
engineering. I need to use interval computations for some phase
stability check, and so, I'm implementing them in C++. I used the basic
package from RVInterval, available on the net in
http://www-math.cudenver.edu/~rvan/Software.html , and extended it to
support vectors and matrices. I'm now working on a newton method using
Gauss-Seidel. I solved several problems with the method, and it's
running quite fine, but I came across one, in principle easy problem,
that systematically fails, and I don't know why.
The problem in question is a set of two equations:
x^2+x*y^3-9=0
3*x^2*y-y^3-4=0
This system has four roots:
1.33636, 1.75424
-3.00162, 0.148108
2.99836, 0.148431
-0.9013, -2.087
My program finds without problems only the first two roots, but
not the other ones. I have been looking for some days at the code, but
it seems OK to me. As I don't have any other program to run this example
and see how it behaves, I would ask if somebody can send me some code to
run it without much complexity (I don't program fortran and I don't have
a fortran compiler). If somebody has ever done something similar and has
a bit of advice, it's very welcome.
Well, thanks in advance,
Alberto Copati
acopati [at] chemeng [dot] chem.uva.nl
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 10:17:27 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id KAA05239
for reliable_computing-outgoing; Thu, 8 Apr 1999 10:17:27 -0500 (CDT)
Received: from darwin.helios.nd.edu (darwin.helios.nd.edu [129.74.250.114])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id KAA05234
for ; Thu, 8 Apr 1999 10:17:23 -0500 (CDT)
Received: from kronecker.helios.nd.edu (markst [at] kronecker [dot] helios.nd.edu [129.74.222.5])
by darwin.helios.nd.edu (8.9.2/8.9.2) with ESMTP id KAA12948;
Thu, 8 Apr 1999 10:17:18 -0500 (EST)
From: Mark Stadtherr
Received: (from markst@localhost)
by kronecker.helios.nd.edu (8.9.1/8.9.1) id KAA15957;
Thu, 8 Apr 1999 10:17:16 -0500 (EST)
Message-Id: <199904081517.KAA15957 [at] kronecker [dot] helios.nd.edu>
Subject: Re: Little problem
To: acopati [at] its [dot] chem.uva.nl (Jorge Alberto Copati)
Date: Thu, 8 Apr 1999 10:17:16 -0500 (EST)
Cc: reliable_computing [at] interval [dot] usl.edu
In-Reply-To: <370CC1A5.BDFB8863 [at] chemeng [dot] chem.uva.nl> from "Jorge Alberto Copati" at Apr 8, 99 04:48:05 pm
X-Mailer: ELM [version 2.4 PL25]
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Alberto,
In my research group, we have done a lot of work on the
application of interval analysis to phase stability
problems. If you're not familiar with this work, you'll
find links to a number of publications and presentations
on the web site http://www.nd.edu/~markst
I don't know whether this work will help you identify
your current difficulty (our current code is in Fortran),
but should be a indication that interval-Newton with
Gauss-Seidel is already a well proven approach for solving
phase stability problems.
Please contact me directly at markst [at] nd [dot] edu if you would
like to discuss the solution of these problems in more
detail.
Mark Stadtherr
========================
Mark A. Stadtherr
Professor
Department of Chemical Engineering
University of Notre Dame
Notre Dame, IN 46556
Phone: (219) 631-9318
Fax: (219) 631-8366
Email: markst [at] nd [dot] edu
========================
>
> Dear people of the list:
>
> My name is Alberto Copati, and I'm doing a PhD on chemical
> engineering. I need to use interval computations for some phase
> stability check, and so, I'm implementing them in C++. I used the basic
> package from RVInterval, available on the net in
> http://www-math.cudenver.edu/~rvan/Software.html , and extended it to
> support vectors and matrices. I'm now working on a newton method using
> Gauss-Seidel. I solved several problems with the method, and it's
> running quite fine, but I came across one, in principle easy problem,
> that systematically fails, and I don't know why.
> The problem in question is a set of two equations:
>
> x^2+x*y^3-9=0
> 3*x^2*y-y^3-4=0
>
> This system has four roots:
>
> 1.33636, 1.75424
> -3.00162, 0.148108
> 2.99836, 0.148431
> -0.9013, -2.087
>
> My program finds without problems only the first two roots, but
> not the other ones. I have been looking for some days at the code, but
> it seems OK to me. As I don't have any other program to run this example
> and see how it behaves, I would ask if somebody can send me some code to
> run it without much complexity (I don't program fortran and I don't have
> a fortran compiler). If somebody has ever done something similar and has
> a bit of advice, it's very welcome.
> Well, thanks in advance,
>
> Alberto Copati
> acopati [at] chemeng [dot] chem.uva.nl
>
>
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 11:28:11 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA05605
for reliable_computing-outgoing; Thu, 8 Apr 1999 11:28:11 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id LAA05600
for ; Thu, 8 Apr 1999 11:28:09 -0500 (CDT)
Received: from rbk5287 (goedel.usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-melissa_1.3) with SMTP id LAA25559;
Thu, 8 Apr 1999 11:27:52 -0500 (CDT)
Message-Id: <2.2.32.19990408162837.006df24c [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: multipart/mixed; boundary="=====================_923606917==_"
Date: Thu, 08 Apr 1999 11:28:37 -0500
To: acopati [at] its [dot] chem.uva.nl (Jorge Alberto Copati)
From: "R. Baker Kearfott"
Subject: Re: Little problem
Cc: reliable_computing [at] interval [dot] usl.edu
X-Attachments: C:\GlobSol\examples\Copati\copatiopt.OT1;
C:\GlobSol\examples\Copati\copatiopt.DT1;
C:\GlobSol\examples\Copati\copatiopt.f90;
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
--=====================_923606917==_
Content-Type: text/plain; charset="us-ascii"
Alberto,
I have posed your problem as a constrained optimization problem for
GlobSol, and have run find_global_min from GlobSol. find_global_min
found small boxes verified to contain solutions corrsponding to the
first three roots you gave (in about .3 seconds), and found a fourth
box that does not correspond to your fourth root. In fact, the fourth
coordinate pair you gave below does not appear to correspond to
a root. the routine eval_cd from GlobSol gives the following
rigorous range on the residuals around that point:
----------------------------------------------------------------
Enter 2 interval values, one per line:
-.91 -.89
-2.1 -2.0
Initial box:
[ -0.9100D+00, -0.8900D+00 ] [ -0.2100D+01, -0.2000D+01 ]
Interval constraint values:
[ -0.1747D+02, -0.1617D+02 ] [ -0.1217D+01, 0.5084D+00 ]
----------------------------------------------------------------
I also note that the other three approximate solutions you gave
below are near the verified boxes GlobSol gave, but not contained
in those boxes.
I have attached the following for your perusal:
1. The GlobSol problem definition file copatiopt.f90
2. The GlobSol box data file copatiopt.DT1
3. The GlobSol output file copatiopt.OT1
Best regards,
Baker
>>
>> Dear people of the list:
>>
>> My name is Alberto Copati, and I'm doing a PhD on chemical
>> engineering. I need to use interval computations for some phase
>> stability check, and so, I'm implementing them in C++. I used the basic
>> package from RVInterval, available on the net in
>> http://www-math.cudenver.edu/~rvan/Software.html , and extended it to
>> support vectors and matrices. I'm now working on a newton method using
>> Gauss-Seidel. I solved several problems with the method, and it's
>> running quite fine, but I came across one, in principle easy problem,
>> that systematically fails, and I don't know why.
>> The problem in question is a set of two equations:
>>
>> x^2+x*y^3-9=0
>> 3*x^2*y-y^3-4=0
>>
>> This system has four roots:
>>
>> 1.33636, 1.75424
>> -3.00162, 0.148108
>> 2.99836, 0.148431
>> -0.9013, -2.087
>>
>> My program finds without problems only the first two roots, but
>> not the other ones. I have been looking for some days at the code, but
>> it seems OK to me. As I don't have any other program to run this example
>> and see how it behaves, I would ask if somebody can send me some code to
>> run it without much complexity (I don't program fortran and I don't have
>> a fortran compiler). If somebody has ever done something similar and has
>> a bit of advice, it's very welcome.
>> Well, thanks in advance,
>>
>> Alberto Copati
>> acopati [at] chemeng [dot] chem.uva.nl
>>
>>
>
>
--=====================_923606917==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.OT1"
Output from FIND_GLOBAL_MIN on 04/08/1999 at 11:11:09.
Version for the system is: March 20, 1999
Codelist file name is: copatioptG.CDL
Box data file name is: copatiopt.DT1
Initial box:
[ -0.1000D+02, 0.1000D+02 ] [ -0.1000D+02, 0.1000D+02 ]
BOUND_CONSTRAINT:
F F F F
---------------------------------------
CONFIGURATION VALUES:
EPS_DOMAIN: 0.1000D-08 MAXITR: 5000
DO_INTERVAL_NEWTON: T QUADRATIC: T FULL_SPACE: F
VERY_GOOD_INITIAL_GUESS: F
USE_SUBSIT: T
OUTPUT UNIT: 7 PRINT_LENGTH: 1
PHI_MUST_CONVERGE: T
EQ_CNS_MUST_CONVERGE: F
INEQ_CNS_MUST_CONVERGE: F
PHI_THICKNESS_FACTOR: 0.2500D+00
EQ_CNS_THICKNESS_FACTOR: 0.5000D+00
INEQ_CNS_THICKNESS_FACTOR: 0.5000D+00
PHI_MUST_CONVERGE: T
EQ_CNS_MUST_CONVERGE: F
INEQ_CNS_MUST_CONVERGE: F
PHI_CONVERGENCE_FACTOR: 0.1000D-13
EQ_CNS_CONVERGENCE_FACTOR: 0.5000D+00
INEQ_CNS_CONVERGENCE_FACTOR: 0.1000D-13
Default point optimizer was used.
THERE WERE NO BOXES IN COMPLETED_LIST.
LIST OF BOXES CONTAINING VERIFIED FEASIBLE POINTS:
Box no.: 1
Box coordinates:
[ 0.1386D+01, 0.1387D+01 ] [ 0.1919D+01, 0.1921D+01 ]
PHI:
[ 0.0000D+00, 0.2068D-03 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
F F
Level: 0
Box contains the following approximate root:
0.1387D+01 0.1920D+01
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.1392D-26, 0.8265D-26 ]
Unknown = T Contains_root = T
Changed coordinates:
F F
U0:
[ 0.0000D+00, 0.1000D+01 ]
V:
[ -0.1000D+01, 0.1000D+01 ] [ -0.1000D+01, 0.1000D+01 ]
-------------------------------------------------
Box no.: 2
Box coordinates:
[ -0.2999D+01, -0.2999D+01 ] [ 0.1483D+00, 0.1483D+00 ]
PHI:
[ 0.0000D+00, 0.2170D-25 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 2
Box contains the following approximate root:
-0.2999D+01 0.1483D+00
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.1775D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
T F
U0:
[ 0.9992D+00, 0.1000D+01 ]
V:
[ -0.6447D-05, 0.6447D-05 ] [ -0.7108D-05, 0.7108D-05 ]
-------------------------------------------------
Box no.: 3
Box coordinates:
[ -0.1387D+01, -0.1387D+01 ] [ 0.1920D+01, 0.1920D+01 ]
PHI:
[ 0.0000D+00, 0.2724D-23 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 3
Box contains the following approximate root:
-0.1387D+01 0.1920D+01
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.9600D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
T F
U0:
[ 0.9980D+00, 0.1000D+01 ]
V:
[ -0.1080D-04, 0.1080D-04 ] [ -0.1025D-04, 0.1025D-04 ]
-------------------------------------------------
Box no.: 4
Box coordinates:
[ 0.2999D+01, 0.2999D+01 ] [ 0.1483D+00, 0.1483D+00 ]
PHI:
[ 0.0000D+00, 0.2170D-25 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 3
Box contains the following approximate root:
0.2999D+01 0.1483D+00
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.1775D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
T T
U0:
[ 0.9992D+00, 0.1000D+01 ]
V:
[ -0.6447D-05, 0.6447D-05 ] [ -0.7108D-05, 0.7108D-05 ]
-------------------------------------------------
ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER,
5000 OF BOXES.
Number of bisections: 6
No. dense interval residual evaluations -- gradient code list: 113
Number of orig. system inverse midpoint preconditioner rows: 8
Number of orig. system C-LP preconditioner rows: 60
Number of solutions for a component in the expanded system: 7789
Total number of forward_substitutions: 379
Number of Gauss--Seidel steps on the dense system: 55
Number of gradient evaluations from a gradient code list: 26
Total number of dense slope matrix evaluations: 66
Total number second-order interval evaluations of the
original function: 42
Total number dense interval constraint evaluations: 228
Total number dense interval constraint gradient component
evaluations: 288
Total number dense point constraint gradient component
evaluations: 72
Total number dense interval reduced gradient evaluations: 48
Total number of calls to FRITZ_JOHN_RESIDUALS: 18
Number of times the interval Newton method made a coordinate
interval smaller: 27
Number of times the approximate solver was called: 4
Number Fritz-John matrix evaluations: 12
Number times SUBSIT decreased one or more
coordinate widths: 9
Number times SUBSIT rejected a box: 5
BEST_ESTIMATE: 0.2170D-25
Total number of boxes processed in loop: 14
Overall CPU time: 0.2800D+00
CPU time in PEEL_BOUNDARY: 0.0000D+00
CPU time in REDUCED_INTERVAL_NEWTON: 0.6000D-01
--=====================_923606917==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.DT1"
1D-9
-10 10
-10 10
--=====================_923606917==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.f90"
! Implements Alberto Copati's problem (see copati.txt) as an
! optimization problem with equality constraints.
PROGRAM COPATIOPT
USE CODELIST_CREATION
IMPLICIT NONE
TYPE(CDLVAR), DIMENSION(2):: X
TYPE(CDLEQ), DIMENSION(2):: F
TYPE(CDLVAR), DIMENSION(2) :: FVAL
TYPE(CDLLHS) :: PHI
OUTPUT_FILE_NAME='copatiopt.CDL'
CALL INITIALIZE_CODELIST(X)
FVAL(1) = X(1)**2 + X(2)**3 - 9
FVAL(2) = 3*X(1)**2*x(2) - X(2)**3 - 4
F(1) = FVAL(1)
F(2) = FVAL(2)
PHI = FVAL(1)**2 + FVAL(2)**2
CALL FINISH_CODELIST
END PROGRAM COPATIOPT
--=====================_923606917==_
Content-Type: text/plain; charset="us-ascii"
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
--=====================_923606917==_--
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 13:10:54 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id NAA06068
for reliable_computing-outgoing; Thu, 8 Apr 1999 13:10:54 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id NAA06063
for ; Thu, 8 Apr 1999 13:10:52 -0500 (CDT)
Received: from rbk5287 (goedel.usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-melissa_1.3) with SMTP id NAA27086
for ; Thu, 8 Apr 1999 13:10:47 -0500 (CDT)
Message-Id: <2.2.32.19990408181132.006ed994 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: multipart/mixed; boundary="=====================_923613092==_"
Date: Thu, 08 Apr 1999 13:11:32 -0500
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott"
Subject: Re: Little problem
X-Attachments: C:\GlobSol\examples\Copati\copatiopt.f90;
C:\GlobSol\examples\Copati\copatiopt.DT1;
C:\GlobSol\examples\Copati\copatiopt.OT1;
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
--=====================_923613092==_
Content-Type: text/plain; charset="us-ascii"
>Date: Thu, 08 Apr 1999 13:05:36 -0500
>To: "Robert J. Holt"
>From: "R. Baker Kearfott"
>Subject: Re: Little problem
>Cc: Jorge Alberto Copati
>X-Attachments: C:\GlobSol\examples\Copati\copatiopt.f90; C:\GlobSol\examples\Copati\copatiopt.DT1; C:\GlobSol\examples\Copati\copatiopt.OT1;
>
>Alberto and Robert,
>
>OOPS, I forgot the factor of x in the second term in equation 1 when
>I coded the system, that is, I forgot:
>
>> 2 3
>> eq1 := x + x y - 9
> ^
>
>When I put in the correct equations, I got four solutions corresponding
>to the ones you two got, using GlobSol :-)
>
>
>I have attached the correct function, box data, and output files to
>this email.
>
>Best regards,
>
>Baker
>
>
>At 01:07 PM 4/8/99 -0400, Robert J. Holt wrote:
>>Alberto and Baker,
>>
>>
>>A system this small can be solved using resultants. I got the same realsolutions
>>as Alberto. This is a Maple transcript:
>>
>>> eq1:=x^2+x*y^3-9;
>>
>> 2 3
>> eq1 := x + x y - 9
>>
>>> eq2:=3*x^2*y-y^3-4;
>>
>> 2 3
>> eq2 := 3 x y - y - 4
>>
>>> resultant(eq1,eq2,y);
>>
>> 10 6 4 5 2 3 8
>> - 27 x + x + 21 x - 12 x - 189 x + 152 x + 243 x - 729 - 972 x
>>
>>> fsolve(");
>>
>> -3.001624887, -.9012661908, 1.336355377, 2.998365348
>>
>>> resultant(eq1,eq2,x);
>>
>> 10 7 6 4 3 2
>> - 3 y - 12 y + y - 54 y + 8 y + 729 y - 216 y + 16
>>
>>> fsolve(");
>>
>> -2.086587595, .1481079950, .1484309777, 1.754235198
>>
>>> subs(x=-.9012661908,y=-2.086587595,[eq1,eq2]);
>>
>> -8 -8
>> [.5*10 , .4*10 ]
>>
>>> subs(x=1.336355377,y=1.754235198,[eq1,eq2]);
>>
>> -8 -8
>> [.2*10 , -.2*10 ]
>>
>>> subs(x=-3.001624887,y=.1481079950,[eq1,eq2]);
>>
>> -8 -8
>> [.1674*10 , .2*10 ]
>>
>>> subs(x=2.998365348,y=.1484309777,[eq1,eq2]);
>>
>> -9 -8
>> [-.763*10 , -.1*10 ]
>>Best Regards,
>>
>>Bob Holt
>>
>>>
>>>
>>> >> The problem in question is a set of two equations:
>>> >>
>>> >> x^2+x*y^3-9=0
>>> >> 3*x^2*y-y^3-4=0
>>> >>
>>> >> This system has four roots:
>>> >>
>>> >> 1.33636, 1.75424
>>> >> -3.00162, 0.148108
>>> >> 2.99836, 0.148431
>>> >> -0.9013, -2.087
>>
>>
>>
>>
>
--=====================_923613092==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.f90"
! Implements Alberto Copati's problem (see copati.txt) as an
! optimization problem with equality constraints.
PROGRAM COPATIOPT
USE CODELIST_CREATION
IMPLICIT NONE
TYPE(CDLVAR), DIMENSION(2):: X
TYPE(CDLEQ), DIMENSION(2):: F
TYPE(CDLVAR), DIMENSION(2) :: FVAL
TYPE(CDLLHS) :: PHI
OUTPUT_FILE_NAME='copatiopt.CDL'
CALL INITIALIZE_CODELIST(X)
FVAL(1) = X(1)**2 + X(1)*X(2)**3 - 9
FVAL(2) = 3*X(1)**2*x(2) - X(2)**3 - 4
F(1) = FVAL(1)
F(2) = FVAL(2)
PHI = FVAL(1)**2 + FVAL(2)**2
CALL FINISH_CODELIST
END PROGRAM COPATIOPT
--=====================_923613092==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.DT1"
1D-9
-10 10
-10 10
--=====================_923613092==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="copatiopt.OT1"
Output from FIND_GLOBAL_MIN on 04/08/1999 at 13:01:28.
Version for the system is: March 20, 1999
Codelist file name is: copatioptG.CDL
Box data file name is: copatiopt.DT1
Initial box:
[ -0.1000D+02, 0.1000D+02 ] [ -0.1000D+02, 0.1000D+02 ]
BOUND_CONSTRAINT:
F F F F
---------------------------------------
CONFIGURATION VALUES:
EPS_DOMAIN: 0.1000D-08 MAXITR: 5000
DO_INTERVAL_NEWTON: T QUADRATIC: T FULL_SPACE: F
VERY_GOOD_INITIAL_GUESS: F
USE_SUBSIT: T
OUTPUT UNIT: 7 PRINT_LENGTH: 1
PHI_MUST_CONVERGE: T
EQ_CNS_MUST_CONVERGE: F
INEQ_CNS_MUST_CONVERGE: F
PHI_THICKNESS_FACTOR: 0.2500D+00
EQ_CNS_THICKNESS_FACTOR: 0.5000D+00
INEQ_CNS_THICKNESS_FACTOR: 0.5000D+00
PHI_MUST_CONVERGE: T
EQ_CNS_MUST_CONVERGE: F
INEQ_CNS_MUST_CONVERGE: F
PHI_CONVERGENCE_FACTOR: 0.1000D-13
EQ_CNS_CONVERGENCE_FACTOR: 0.5000D+00
INEQ_CNS_CONVERGENCE_FACTOR: 0.1000D-13
Default point optimizer was used.
THERE WERE NO BOXES IN COMPLETED_LIST.
LIST OF BOXES CONTAINING VERIFIED FEASIBLE POINTS:
Box no.: 1
Box coordinates:
[ -0.3003D+01, -0.3001D+01 ] [ 0.1478D+00, 0.1484D+00 ]
PHI:
[ 0.0000D+00, 0.1566D-03 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
F F
Level: 0
Box contains the following approximate root:
-0.3002D+01 0.1481D+00
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.7119D-28, 0.8411D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
F F
U0:
[ 0.0000D+00, 0.1000D+01 ]
V:
[ -0.1000D+01, 0.1000D+01 ] [ -0.1000D+01, 0.1000D+01 ]
-------------------------------------------------
Box no.: 2
Box coordinates:
[ -0.9013D+00, -0.9013D+00 ] [ -0.2087D+01, -0.2087D+01 ]
PHI:
[ 0.0000D+00, 0.9709D-22 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 5
Box contains the following approximate root:
-0.9013D+00 -0.2087D+01
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.6974D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
T T
U0:
[ 0.9973D+00, 0.1000D+01 ]
V:
[ -0.2027D-04, 0.2027D-04 ] [ -0.2096D-04, 0.2096D-04 ]
-------------------------------------------------
Box no.: 3
Box coordinates:
[ 0.2998D+01, 0.2998D+01 ] [ 0.1484D+00, 0.1484D+00 ]
PHI:
[ 0.0000D+00, 0.1756D-24 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 6
Box contains the following approximate root:
0.2998D+01 0.1484D+00
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.1428D-27 ]
Unknown = T Contains_root = T
Changed coordinates:
T T
U0:
[ 0.9992D+00, 0.1000D+01 ]
V:
[ -0.6833D-05, 0.6833D-05 ] [ -0.7266D-05, 0.7266D-05 ]
-------------------------------------------------
Box no.: 4
Box coordinates:
[ 0.1336D+01, 0.1336D+01 ] [ 0.1754D+01, 0.1754D+01 ]
PHI:
[ 0.0000D+00, 0.3850D-22 ]
B%LIUI(1,*):
F F
B%LIUI(2,*):
F F
B%SIDE(*):
F F
B%PEEL(*):
T T
Level: 6
Box contains the following approximate root:
0.1336D+01 0.1754D+01
OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
[ 0.0000D+00, 0.1000D-26 ]
Unknown = T Contains_root = T
Changed coordinates:
T T
U0:
[ 0.9981D+00, 0.1000D+01 ]
V:
[ -0.1319D-04, 0.1319D-04 ] [ -0.1802D-04, 0.1802D-04 ]
-------------------------------------------------
ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER,
5000 OF BOXES.
Number of bisections: 10
No. dense interval residual evaluations -- gradient code list: 153
Number of orig. system inverse midpoint preconditioner rows: 8
Number of orig. system C-LP preconditioner rows: 105
Number of solutions for a component in the expanded system: 22138
Total number of forward_substitutions: 475
Number of Gauss--Seidel steps on the dense system: 85
Number of gradient evaluations from a gradient code list: 43
Total number of dense slope matrix evaluations: 89
Total number second-order interval evaluations of the
original function: 47
Total number dense interval constraint evaluations: 352
Total number dense interval constraint gradient component
evaluations: 464
Total number dense point constraint gradient component
evaluations: 120
Total number dense interval reduced gradient evaluations: 75
Total number of calls to FRITZ_JOHN_RESIDUALS: 27
Number of times the interval Newton method made a coordinate
interval smaller: 45
Number of times the approximate solver was called: 4
Number Fritz-John matrix evaluations: 21
Number times SUBSIT decreased one or more
coordinate widths: 9
Number times SUBSIT rejected a box: 10
BEST_ESTIMATE: 0.1756D-24
Total number of boxes processed in loop: 23
Overall CPU time: 0.2700D+00
CPU time in PEEL_BOUNDARY: 0.0000D+00
CPU time in REDUCED_INTERVAL_NEWTON: 0.0000D+00
--=====================_923613092==_
Content-Type: text/plain; charset="us-ascii"
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
--=====================_923613092==_--
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 15:26:34 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id PAA06456
for reliable_computing-outgoing; Thu, 8 Apr 1999 15:26:34 -0500 (CDT)
Received: from santo.eunet.fi (santo.eunet.fi [212.226.249.1])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id PAA06451
for ; Thu, 8 Apr 1999 15:26:26 -0500 (CDT)
Received: from net5.delisoft.fi (net5.delisoft.fi [193.94.10.101])
by santo.eunet.fi (8.9.3/8.9.1) with SMTP id XAA10473;
Thu, 8 Apr 1999 23:25:26 +0300 (EET DST)
Received: by net5.delisoft.fi with Microsoft Mail
id <01BE8217.813A8FB0 [at] net5 [dot] delisoft.fi>; Thu, 8 Apr 1999 23:28:27 +0300
Message-ID: <01BE8217.813A8FB0 [at] net5 [dot] delisoft.fi>
From: Stefano De Pascale
To: "'R. Baker Kearfott'"
Cc: "reliable_computing [at] interval [dot] usl.edu"
Subject: RE: Little problem
Date: Thu, 8 Apr 1999 23:28:19 +0300
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Prof. Baker,
I tried the problem described by Alberto Copati with Interval Solver for Microsoft Excel
and I got all 4 roots in 0.69 seconds (Pentium II 400MHz). Here are the results:
1.336355377 1.754235198
-3.001624887 0.148107995
2.998365348 0.148430978
-0.901266191 -2.086587595
Best regards,
Stefano De Pascale
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Stefano De Pascale stefano.depascale [at] delisoft [dot] com
Delisoft Ltd http://www.delisoft.com
Urho Kekkosen katu 8 C 30 Tel. +358-9-68665551
FIN-00100 Helsinki GSM +358-40-5242331
Finland Fax +358-9-68665544
----------
From: R. Baker Kearfott
Sent: 8. huhtikuuta 1999 19:28
To: Jorge Alberto Copati
Cc: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Little problem
<><><><>
Alberto,
I have posed your problem as a constrained optimization problem for
GlobSol, and have run find_global_min from GlobSol. find_global_min
found small boxes verified to contain solutions corrsponding to the
first three roots you gave (in about .3 seconds), and found a fourth
box that does not correspond to your fourth root. In fact, the fourth
coordinate pair you gave below does not appear to correspond to
a root. the routine eval_cd from GlobSol gives the following
rigorous range on the residuals around that point:
----------------------------------------------------------------
Enter 2 interval values, one per line:
-.91 -.89
-2.1 -2.0
Initial box:
[ -0.9100D+00, -0.8900D+00 ] [ -0.2100D+01, -0.2000D+01 ]
Interval constraint values:
[ -0.1747D+02, -0.1617D+02 ] [ -0.1217D+01, 0.5084D+00 ]
----------------------------------------------------------------
I also note that the other three approximate solutions you gave
below are near the verified boxes GlobSol gave, but not contained
in those boxes.
I have attached the following for your perusal:
1. The GlobSol problem definition file copatiopt.f90
2. The GlobSol box data file copatiopt.DT1
3. The GlobSol output file copatiopt.OT1
Best regards,
Baker
>>
>> Dear people of the list:
>>
>> My name is Alberto Copati, and I'm doing a PhD on chemical
>> engineering. I need to use interval computations for some phase
>> stability check, and so, I'm implementing them in C++. I used the basic
>> package from RVInterval, available on the net in
>> http://www-math.cudenver.edu/~rvan/Software.html , and extended it to
>> support vectors and matrices. I'm now working on a newton method using
>> Gauss-Seidel. I solved several problems with the method, and it's
>> running quite fine, but I came across one, in principle easy problem,
>> that systematically fails, and I don't know why.
>> The problem in question is a set of two equations:
>>
>> x^2+x*y^3-9=0
>> 3*x^2*y-y^3-4=0
>>
>> This system has four roots:
>>
>> 1.33636, 1.75424
>> -3.00162, 0.148108
>> 2.99836, 0.148431
>> -0.9013, -2.087
>>
>> My program finds without problems only the first two roots, but
>> not the other ones. I have been looking for some days at the code, but
>> it seems OK to me. As I don't have any other program to run this example
>> and see how it behaves, I would ask if somebody can send me some code to
>> run it without much complexity (I don't program fortran and I don't have
>> a fortran compiler). If somebody has ever done something similar and has
>> a bit of advice, it's very welcome.
>> Well, thanks in advance,
>>
>> Alberto Copati
>> acopati [at] chemeng [dot] chem.uva.nl
>>
>>
>
>
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 8 19:15:39 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id TAA06901
for reliable_computing-outgoing; Thu, 8 Apr 1999 19:15:39 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id TAA06896
for ; Thu, 8 Apr 1999 19:15:37 -0500 (CDT)
Received: from rbk5287 (goedel.usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-melissa_1.3) with SMTP id TAA01292;
Thu, 8 Apr 1999 19:15:28 -0500 (CDT)
Message-Id: <2.2.32.19990409001614.0069fc44 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 08 Apr 1999 19:16:14 -0500
To: Stefano De Pascale
From: "R. Baker Kearfott"
Subject: RE: Little problem
Cc: "reliable_computing [at] interval [dot] usl.edu"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Stefano,
Yes, indeed. Actually, we all agree right now :-) GlobSol was right,
I just gave GlobSol the wrong problem. See my second posting today.
Best regards,
Baker
At 11:28 PM 4/8/99 +0300, Stefano De Pascale wrote:
>Dear Prof. Baker,
>
>I tried the problem described by Alberto Copati with Interval Solver for Microsoft Excel
>and I got all 4 roots in 0.69 seconds (Pentium II 400MHz). Here are the results:
>
> 1.336355377 1.754235198
>-3.001624887 0.148107995
> 2.998365348 0.148430978
>-0.901266191 -2.086587595
>
>Best regards,
>
>>> The problem in question is a set of two equations:
>>>
>>> x^2+x*y^3-9=0
>>> 3*x^2*y-y^3-4=0
>>>
>>> This system has four roots:
>>>
>>> 1.33636, 1.75424
>>> -3.00162, 0.148108
>>> 2.99836, 0.148431
>>> -0.9013, -2.087
>>>
>
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
From owner-reliable_computing [at] interval [dot] usl.edu Fri Apr 9 01:42:51 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id BAA07390
for reliable_computing-outgoing; Fri, 9 Apr 1999 01:42:51 -0500 (CDT)
Received: from emn.emn.fr (emn.emn.fr [193.104.34.131])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id BAA07385
for ; Fri, 9 Apr 1999 01:42:48 -0500 (CDT)
Received: from info.info.emn.fr (info.info.emn.fr [193.104.32.224])
by emn.emn.fr (8.8.8/jtpda-5.1) with ESMTP id IAA03961
; Fri, 9 Apr 1999 08:41:43 +0200 (MET DST)
Received: from coudres.info.emn.fr (coudres.info.emn.fr [193.104.32.141])
by info.info.emn.fr (8.8.8/jtpda-5.1) with ESMTP id IAA22328
; Fri, 9 Apr 1999 08:41:43 +0200 (MET DST)
Received: from coudres (localhost [127.0.0.1])
by coudres.info.emn.fr (SMI-8.6/jtpda-5.1) with ESMTP id IAA20540
; Fri, 9 Apr 1999 08:31:32 +0200
Message-Id: <199904090631.IAA20540 [at] coudres [dot] info.emn.fr>
X-Mailer: exmh version 2.0.2 2/24/98
To: "R. Baker Kearfott"
cc: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Little problem
In-reply-to: Your message of "Thu, 08 Apr 1999 19:16:14 CDT."
<2.2.32.19990409001614.0069fc44 [at] pop [dot] usl.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Date: Fri, 09 Apr 1999 08:31:31 +0200
From: Lebbah Yahia 0251858202
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id BAA07386
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
The four solutions are also "BROUWER solutions". The precision is about
1.0e-15.
BROUWER Solution 1
x = [-3.0016248866767232e+00,-3.0016248866767219e+00]
y = [1.4810799495836588e-01,1.4810799495836613e-01]
BROUWER Solution 2
x = [-9.0126619078303394e-01,-9.0126619078303316e-01]
y = [-2.0865875946569798e+00,-2.0865875946569790e+00]
BROUWER Solution 3
x = [1.3363553772171668e+00,1.3363553772171672e+00]
y = [1.7542351976516986e+00,1.7542351976516992e+00]
BROUWER Solution 4
x = [2.9983653481116019e+00,2.9983653481116028e+00]
y = [1.4843097772968072e-01,1.4843097772968092e-01]
Best regards,
--
*************************************************************************
Yahia LEBBAH
Ph.D student in constraint programming
Address:
Département Informatique
Ecole des Mines de Nantes
La Chantrerie - 4, rue Alfred Kastler - B. P. 20722
44 307 Nantes Cedex 3
FRANCE
Phone: (+33) 2 51 85 82 36
Fax: (+33) 2 51 85 82 49
E-mail: lebbah [at] emn [dot] fr
*************************************************************************
From owner-reliable_computing [at] interval [dot] usl.edu Fri Apr 9 01:51:22 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id BAA07650
for reliable_computing-outgoing; Fri, 9 Apr 1999 01:51:22 -0500 (CDT)
Received: from iis.nsk.su (mx.iis.nsk.su [194.226.177.121])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id BAA07641
for ; Fri, 9 Apr 1999 01:50:59 -0500 (CDT)
Received: from hooker.rriai.org.ru (hooker.rriai.org.ru [194.226.177.235])
by iis.nsk.su (8.8.8/8.8.8) with SMTP id NAA10270;
Fri, 9 Apr 1999 13:37:25 +0700 (NOVST)
Message-Id: <199904090637.NAA10270 [at] iis [dot] nsk.su>
Comments: Authenticated sender is
From: "Alexander Semenov"
Organization: Russian Research Institute of AI
To: Jorge Alberto Copati
Date: Fri, 9 Apr 1999 13:49:56 +6
MIME-Version: 1.0
Content-type: text/plain; charset=US-ASCII
Content-transfer-encoding: 7BIT
Subject: Re: Little problem
Reply-to: semenov [at] iis [dot] nsk.su
CC: reliable_computing [at] interval [dot] usl.edu
Priority: normal
In-reply-to: <370CC1A5.BDFB8863 [at] chemeng [dot] chem.uva.nl>
X-mailer: Pegasus Mail for Win32 (v2.53/R1)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Alberto,
I solved your problem with our UniCalc solver and found the following results
(about 1 sec. on Intel486-100MHz):
x^2+x*y^3-9=0;
3*x^2*y-y^3-4=0;
(** Root #1 **)
x = [-3.00162489, -3.00162488]
y = [0.148107994, 0.148107995]
(** Root #2 **)
x = [-0.901266192, -0.90126618]
y = [-2.0865876, -2.08658759]
(** Root #3 **)
x = [1.33635537, 1.33635538]
y = [1.75423519, 1.7542352]
(** Root #4 **)
x = [2.99836534, 2.99836535]
y = [0.148430977, 0.148430978]
To get this solution it is sufficient to use a demo version which can be
downloaded for free.
Best regards,
Alexander Semenov
---------------------------------------------------------------------------
Alexander Semenov Novosibirsk Division of the Russian
Research Institute of Artificial Intelligence
tel. (7 383 2) 34 29 91 pr. ak. Lavrent'eva, 6
fax (7 383 2) 32 83 59 Novosibirsk
e-mail semenov [at] iis [dot] nsk.su Russia, 630090
URL http://www.rriai.org.ru/~semenov/
-------------------------------------------------------------------
From owner-reliable_computing [at] interval [dot] usl.edu Fri Apr 9 02:21:27 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id CAA08013
for reliable_computing-outgoing; Fri, 9 Apr 1999 02:21:27 -0500 (CDT)
Received: from mekong.univ-orleans.fr (root [at] mekong [dot] univ-orleans.fr [193.49.80.56])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id CAA08008
for ; Fri, 9 Apr 1999 02:21:25 -0500 (CDT)
Received: from localhost.univ-orleans.fr (granvil [at] localhost [dot] univ-orleans.fr [127.0.0.1])
by mekong.univ-orleans.fr (8.8.8/G.8.Lifo) with SMTP id JAA25538;
Fri, 9 Apr 1999 09:20:14 +0200 (MET DST)
Message-Id: <199904090720.JAA25538 [at] mekong [dot] univ-orleans.fr>
X-Authentication-Warning: mekong.univ-orleans.fr: granvil [at] localhost [dot] univ-orleans.fr [127.0.0.1] didn't use HELO protocol
X-Mailer: exmh version 2.0zeta 7/24/97
To: Jorge Alberto Copati
cc: "reliable_computing [at] interval [dot] usl.edu" ,
granvil [at] lifo [dot] univ-orleans.fr
Subject: Re: Little problem
In-reply-to: Your message of "Thu, 08 Apr 1999 16:48:05 +0200."
<370CC1A5.BDFB8863 [at] chemeng [dot] chem.uva.nl>
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Date: Fri, 09 Apr 1999 09:20:13 +0200
From: Laurent Granvilliers
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id CAA08009
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Another solving technique is to compute a Groebner basis
from the initial polynomial system {x^2+x*y^3-9 = 0, 3*x^2*y-y^3-4 = 0}.
This adds the following redundant equation (in 30ms, Sun Sparc 166MHz) :
y^10 + 4*y^7 - (1/3)*y^6 + 18*y^4 - (8/3)*y^3 - 243*y^2 + 72*y - (16/3) = 0
A constraint propagation/bisection method then solves the resulting system
in 50ms. The precision of the four solutions is about 1.0e-15.
x ~ [-3.001624886676723 , -3.001624886676722],
y ~ [0.1481079949583659 , 0.1481079949583661]
x ~ [-0.9012661907830345 , -0.9012661907830326],
y ~ [-2.08658759465698 , -2.086587594656979]
x ~ [1.336355377217166 , 1.336355377217168],
y ~ [1.754235197651698 , 1.754235197651699]
x ~ [2.998365348111602 , 2.998365348111603],
y ~ [0.1484309777296808 , 0.1484309777296809]
Best regards,
-- Laurent Granvilliers
________________________________________________________________________
Laurent GRANVILLIERS e-mail: granvil [at] lifo [dot] univ-orleans.fr
LIFO, Université d'Orléans phone: +33 2 38 41 72 95
BP 6759, F-45067 ORLEANS Cedex 2 fax: +33 2 38 41 71 37
FRANCE
http://www.univ-orleans.fr/SCIENCES/LIFO/Members/lg
From owner-reliable_computing [at] interval [dot] usl.edu Fri Apr 9 15:40:02 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id PAA08868
for reliable_computing-outgoing; Fri, 9 Apr 1999 15:40:02 -0500 (CDT)
Received: from isse.gmu.edu (isse.gmu.edu [129.174.40.15])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id PAA08861
for ; Fri, 9 Apr 1999 15:39:53 -0500 (CDT)
Received: from isse.gmu.edu (isse.gmu.edu [129.174.40.15])
by isse.gmu.edu (8.8.5/8.8.5) with SMTP id MAA15549;
Fri, 9 Apr 1999 12:26:22 -0400 (EDT)
Date: Fri, 9 Apr 1999 12:26:22 -0400 (EDT)
From: Xiaoyang Sean Wang
To: xywang [at] gmu [dot] edu
Subject: cp99 final call for paper
Message-ID:
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Please accept our apologies if you receive this multiple times.
Note submission date is April 16, 1999.
CALL FOR PAPERS - CP'99
Fifth International Conference on
Principles and Practice of Constraint Programming
October 11-15, 1999
Alexandria, Virginia, USA
http://www.ise.gmu.edu/cp99
Constraints have emerged as the basis of a representational
and computational paradigm that draws from many disciplines
and can be brought to bear on many problem domains. The
conference is concerned with all aspects of computing with
constraints including algorithms, applications, environments,
languages, models, and systems. Contributions are welcome from
any discipline concerned with constraints, including artificial
intelligence, combinatorial algorithms, computational logic,
concurrent computation, databases, discrete mathematics,
operations research, programming languages, symbolic computation.
We also solicit papers from any domain employing constraints,
including computational linguistics, configuration, decision
support, design, diagnosis, graphics, hardware verification,
molecular biology, planning, qualitative reasoning, real-time
systems, resource allocation, robotics, scheduling, software
engineering, temporal reasoning, vision, visualization, user
interfaces. Papers that bridge disciplines or combine theory
and practice are especially welcome.
Important dates:
Submissions: April 16, 1999
Notification of acceptance: July 2, 1999
Camera-ready papers due: July 31, 1999
Submissions: Submission should be done by sending two emails to
cp99 [at] comp [dot] nus.edu.sg The first email should have the subject
"CP99 Abstract:" followed by the paper title. The body of this
first email should contain the title, authors and a short
abstract of the paper, all in plain text. The second email
should have subject "CP99 Paper:" followed by the paper title.
The body of this second email should contain a postscript file,
in portable format. All authors must be prepared to send a
hardcopy by fast airmail upon request.
For authors who are unable to submit electronically, five paper
copies can be mailed to the program chair, to arrive by the
submission deadline.
Publication: The proceedings will be published by Springer
Verlag in the Lecture Notes in Computer Science series.
A special issue of the Constraints journal (Kluwer Academic
Publishers) is planned, based on selected papers.
Conference site: The conference will be held at Old Town
Alexandria which is just minutes from Washington, D.C.
by car, bus or metro. Old Town Alexandria is a colonial
era seaport, with a revitalized two-mile-long waterfront.
It still has cobblestone streets and many 18th century
buildings. This quaint historic town features a centralized
shopping district with numerous galleries and boutiques
within eight blocks from the hotel.
Workshops: Workshops are planned for Friday, Oct 15, 1999.
Workshop proposals can be submitted to the workshop chair
(to be announced soon) by approximately March 15, 1999.
Details will be available soon.
Conference Chair
Alex Brodsky
Dept of Information & Software Engineering
George Mason University
Fairfax, Virginia 22030-4444
USA
brodsky [at] isse [dot] gmu.edu
+703-993-1529, fax +703-993-1638
Program Chair
Joxan Jaffar
School of Computing
National University of Singapore
S16, Lower Kent Ridge Road
Singapore 119260
Republic of Singapore
joxan [at] comp [dot] nus.edu.sg
+65-874-6731, fax +65-779-4580
Program Committee
(To be finalized)
Alexander Bockmayr, Universite Henri Poincare, Nancy 1, France
Rina Dechter, University of California, Irvine, USA
Francois Fages, Ecole Normal Supierieure, France
Boi Faltings, Federal Institute of Technology, Lausanne, Switzerland
Thom Fruehwirth, Ludwig Maximilians University, Germany
Vineet Gupta, NASA Ames Research Center, USA
Nevin Heintze, Lucent Bell Laboratories, USA
Joxan Jaffar (chair), National University of Singapore, Singapore
Claude Kirchner, LORIA & INRIA, France
Jimmy Lee, Chinese University of Hong Kong, Hong Kong
Thomas Schiex, INRA Toulouse, France
Bart Selman, Cornell University, USA
Helmut Simonis, Cosytec, France
Edward Tsang, University of Sussex, UK
Peter Van Beek, University of Alberta, Canada
Mark Wallace, Imperial College, UK
Publicity Chair
X.Sean Wang
Dept of Information & Software Engineering
George Mason University
Fairfax, Virginia 22030-4444
USA
xywang [at] gmu [dot] edu
+703-993-1662, fax +703-993-1638
Organizing Committee:
A. Borning (Univ. of Washington),
J. Cohen (Brandeis Univ.),
A. Colmerauer (Univ. of Marseille),
E. Freuder, chair (Univ. of New Hampshire),
H. Gallaire (Xerox),
J.-P. Jouannaud (Univ. of Paris Sud),
J.-L. Lassez (New Mexico Tech),
M. Maher (Griffith Univ.),
U. Montanari (Univ. of Pisa),
A. Nerode (Cornell Univ.),
J-F. Puget (ILOG),
F. Rossi (Univ. of Padova),
V. Saraswat (AT&T Research),
G. Smolka (DFKI and Univ. Saarlandes),
R. Wachter (Office of Naval Research).
From owner-reliable_computing [at] interval [dot] usl.edu Wed Apr 14 03:53:38 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id DAA12951
for reliable_computing-outgoing; Wed, 14 Apr 1999 03:53:38 -0500 (CDT)
Received: from contact.fh-konstanz.de (contact.fh-konstanz.de [141.37.216.5])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id DAA12946
for ; Wed, 14 Apr 1999 03:53:32 -0500 (CDT)
Received: from ti-pc01.fh-konstanz.de (dec-switch.fh-konstanz.de [141.37.28.1])
by contact.fh-konstanz.de (8.8.8/8.8.8) with SMTP id KAA08811
for ; Wed, 14 Apr 1999 10:53:24 +0200 (MET DST)
Message-Id: <1.5.4.32.19990414083831.006d3da4 [at] mail [dot] fh-konstanz.de>
X-Sender: garloff [at] mail [dot] fh-konstanz.de
X-Mailer: Windows Eudora Light Version 1.5.4 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Wed, 14 Apr 1999 10:38:31 +0200
To: reliable_computing [at] interval [dot] usl.edu
From: Juergen Garloff
Subject: WCNA-2000
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Colleague,
the International Federation of Nonlinear Analysts (IFNA) will held its
Third World Congress (WCNA-2000) in Catania, Sicily, Italy, July 19 - 26,
2000. The First and Second World Congress were held in Tampa, Florida (1992)
and Athens, Greece (1996).
I was invited to organize there a
Minisymposium/ Special Session on
Applications of Interval Computations.
I think that this minisymposium will give a good oppurtunity to propagate
the ideas of interval computations. WCNA-200 aims to bring together
academic, industrial and goverment experts from such diverse disciplines as
aerospace science, atmospheric science, biological science, chemical
science, economics, enigineering & technological sciences, mathematics,
medical & health sciences,
oceanographic science, physics, social sciences.
More details can be found at
http://www.fit.edu/AcadRes/math/wcna2000.htm
If you are interested to give a talk on applications of interval
computations to nonlinear problems at the minisymposium please send me an
abstract (preferably as hardcopy) of your proposed contribution at your
earliest convenience (mid May at latest). I was asked to submit the
preliminary list of speakers until the end of May 1999.
If necessary, I could send you the first announcement in paper format.
Sincerely yours,
Juergen Garloff
--------------------------------------------------------------
Prof. Dr. Juergen Garloff
Fachhochschule Konstanz/
University of Applied Sciences Konstanz
Fachbereich Informatik
Postfach 100543
D-78405 Konstanz
Germany
Tel.: +49-7531-206-597 or -627
Fax: +49-7531-206-559
email: garloff@fh-konstanz.de
URL: http://www-home.fh-konstanz.de/~garloff/
--------------------------------------------------------------
From owner-reliable_computing [at] interval [dot] usl.edu Wed Apr 14 06:48:14 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id GAA13446
for reliable_computing-outgoing; Wed, 14 Apr 1999 06:48:14 -0500 (CDT)
Received: from rztsun.rz.tu-harburg.de (rztsun.rz.tu-harburg.de [134.28.200.14])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id GAA13441
for ; Wed, 14 Apr 1999 06:47:36 -0500 (CDT)
Received: from zeta.ti3.tu-harburg.de (zeta.ti3.tu-harburg.de [134.28.20.70])
by rztsun.rz.tu-harburg.de (8.9.0/8.8.8) with ESMTP id NAA06272
for ; Wed, 14 Apr 1999 13:47:33 +0200 (MET DST)
Received: from armada.ti3.tu-harburg.de (armada [134.28.20.121]) by zeta.ti3.tu-harburg.de (AIX4.2/UCB 8.7/8.7) with SMTP id NAA12804 for ; Wed, 14 Apr 1999 13:47:42 +0200 (DFT)
Received: by armada.ti3.tu-harburg.de with Microsoft Mail
id <01BE867D.21D69EA0 [at] armada [dot] ti3.tu-harburg.de>; Wed, 14 Apr 1999 13:46:00 +-200
Message-ID: <01BE867D.21D69EA0 [at] armada [dot] ti3.tu-harburg.de>
From: "Siegfried M. Rump"
To: "'reliable_computing'"
Subject: LAA special issue: a friendly reminder
Date: Wed, 14 Apr 1999 13:45:59 +-200
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear colleagues:
about five month we announced the call for papers for
a special issue of LAA on self-validating methods.
This is to remind and encourage submission - if it is
not already on your agenda.
As you know, deadline for submission is September 30, 1999.
We sincerely hope for a good special issue - a good chance
to generate public attention to our field.
With best regards,
Siegfried M. Rump
===============================================
Linear Algebra and its Applications (LAA)
Special issue on
LINEAR ALGEBRA IN SELF-VALIDATING METHODS .
The goal of self-validating methods is to compute correct results on
digital computers - correct in a mathematical sense, covering all
errors like representation, discretization, rounding errors or others.
These methods have a connection to linear algebra since problems are
frequently transformed into linearized problems with uncertain data.
Then the linearization and discretization errors are estimated, possibly
together with an infinite dimensional part of the problem.
It has turned out that computation of an inclusion of the solution complex
of even a linear system of equations with uncertain data is NP-hard. This
has given rise to interesting connections between self-validating methods
and complexity theory. Despite this, in many cases a reasonably sharp
inclusion can be calculated. The class of problems being solvable in this
sense has been extended in recent years.
The possibility to estimate the range of a function is a main ingredient
of self-validating methods. Beside the naive way to get error bounds by
replacing every operation by the corresponding interval operation, much
more elaborate methods have come up using gradients, slopes,
lp- and qp-approaches and more.
In the past few decades the area of self-validating methods has been
evolving, with rapidly growing number of researchers. We want to
take this opportunity to publish a special issue on self-validating
methods. A preliminary list of topics would include:
- systems of linear equations and inequalities
- range of functions
- complexity theory for problems with uncertain data
- componentwise distance to singularity and/or stability
- sparse systems of equations
- algebraic eigenvalue problems
- iterative methods
- matrix methods in validation methods for differential
equations
- use of M-matrices and H-matrices in validation methods
- analysis of zeros and connection to controllability
- combination of computer algebra with floating point methods.
This is a sample, but not an exclusive list of topics. If there is
doubt about suitability of a particular paper, contact one of the
editors of the special issue.
Please submit three (3) hard copies to one of the special issue editors
listed below. The deadline for submission is SEPTEMBER 30, 1999.
Jiri Rohn
Faculty of Mathematics and Physics
Charles University
Malostranske nam. 25
118 00 Prague
Czech Republic
e-mail: rohn [at] uivt [dot] cas.cz
Siegfried M. Rump
Inst. f. Computer Science III
Technical University Hamburg-Harburg
Eissendorfer Str. 38
21071 Hamburg, Germany
e-mail: rump@tu-harburg.de
Tetsuro Yamamoto
Department of Mathematics
Faculty of Science
Ehime University
Matsuyama 790, Japan
e-mail: yamamoto [at] dpc [dot] ehime-u.ac.jp
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 22 04:30:00 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id EAA25241
for reliable_computing-outgoing; Thu, 22 Apr 1999 04:30:00 -0500 (CDT)
Received: from uci.agh.edu.pl (solak [at] galaxy [dot] uci.agh.edu.pl [149.156.96.9])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id EAA25234
for ; Thu, 22 Apr 1999 04:29:06 -0500 (CDT)
Received: from localhost (solak@localhost)
by uci.agh.edu.pl (8.9.3/8.8.7/rchk1.20) with ESMTP id LAA06845;
Thu, 22 Apr 1999 11:28:45 +0200 (MET DST)
Date: Thu, 22 Apr 1999 11:28:44 +0200 (MET DST)
From: Wieslaw Solak
To: Juergen Garloff
cc: reliable_computing [at] interval [dot] usl.edu
Subject: Re: WCNA-2000
In-Reply-To: <1.5.4.32.19990414083831.006d3da4 [at] mail [dot] fh-konstanz.de>
Message-ID:
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Liber Juergen!
Ich habe dir heute eine Arbeit geschiken aber es ist nich genau in dieses
richtung?
Ich werde sehr gern nach Italien kommen auch der Bialas und mein freud
Fitzke, wen es ist moglich und werde nicht ser teujer dan kennen wir
kommen.
Besten Grussen und zum wider sehen.
W.Solak
On Wed, 14 Apr 1999, Juergen Garloff wrote:
>
> Dear Colleague,
> the International Federation of Nonlinear Analysts (IFNA) will held its
> Third World Congress (WCNA-2000) in Catania, Sicily, Italy, July 19 - 26,
> 2000. The First and Second World Congress were held in Tampa, Florida (1992)
> and Athens, Greece (1996).
> I was invited to organize there a
>
> Minisymposium/ Special Session on
> Applications of Interval Computations.
>
> I think that this minisymposium will give a good oppurtunity to propagate
> the ideas of interval computations. WCNA-200 aims to bring together
> academic, industrial and goverment experts from such diverse disciplines as
> aerospace science, atmospheric science, biological science, chemical
> science, economics, enigineering & technological sciences, mathematics,
> medical & health sciences,
> oceanographic science, physics, social sciences.
> More details can be found at
>
> http://www.fit.edu/AcadRes/math/wcna2000.htm
>
> If you are interested to give a talk on applications of interval
> computations to nonlinear problems at the minisymposium please send me an
> abstract (preferably as hardcopy) of your proposed contribution at your
> earliest convenience (mid May at latest). I was asked to submit the
> preliminary list of speakers until the end of May 1999.
> If necessary, I could send you the first announcement in paper format.
>
> Sincerely yours,
> Juergen Garloff
> --------------------------------------------------------------
> Prof. Dr. Juergen Garloff
> Fachhochschule Konstanz/
> University of Applied Sciences Konstanz
> Fachbereich Informatik
> Postfach 100543
> D-78405 Konstanz
> Germany
>
> Tel.: +49-7531-206-597 or -627
> Fax: +49-7531-206-559
> email: garloff@fh-konstanz.de
> URL: http://www-home.fh-konstanz.de/~garloff/
> --------------------------------------------------------------
>
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 29 09:26:36 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA01417
for reliable_computing-outgoing; Thu, 29 Apr 1999 09:26:36 -0500 (CDT)
Received: from satie.u-bourgogne.fr (satie.u-bourgogne.fr [192.134.59.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id JAA01412
for ; Thu, 29 Apr 1999 09:26:26 -0500 (CDT)
Received: from u-bourgogne.fr (catmull.u-bourgogne.fr [193.52.237.132]) by satie.u-bourgogne.fr (8.9.3/8.9.3) with ESMTP id QAA93184 for ; Thu, 29 Apr 1999 16:26:19 +0200
Message-ID: <3184D10E.BD8EF4BF@u-bourgogne.fr>
Date: Mon, 29 Apr 1996 16:24:15 +0200
From: Dominique Faudot
X-Mailer: Mozilla 4.5 [fr] (Win98; I)
X-Accept-Language: fr
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: interval of sum of functions
Content-Type: multipart/mixed;
boundary="------------00CB1B38A997617DCB777797"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Il s'agit d'un message multivolet au format MIME.
--------------00CB1B38A997617DCB777797
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Hi,
I am just beginning with arithmetic of intervals applied to computer
graphics. I have a problem, which is the following :
Suppose we have f1(X) + f2(X) where f1 and f2 are functions and X an
interval.
1 - On which interval f1+f2 is defined ? Is this interval (f1+f2)(X) ?
2 - On which interval is defined f'1(X), f'2(X), f'1+f'2 and (f1+f2)'
Thanks to answer
--------------00CB1B38A997617DCB777797
Content-Type: text/x-vcard; charset=us-ascii;
name="faudot.vcf"
Content-Transfer-Encoding: 7bit
Content-Description: Carte pour Dominique Faudot
Content-Disposition: attachment;
filename="faudot.vcf"
begin:vcard
n:Faudot;Dominique
tel;fax:(33) (0)3 80 39 68 69
tel;work:(33) (0)3 80 39 64 89
x-mozilla-html:FALSE
org:Université de Bourgogne
version:2.1
email;internet:faudot@u-bourgogne.fr
title:Maitre de Conférences
adr;quoted-printable:;;Laboratoire LE2I=0D=0ABP 47870=0D=0A21078 Dijon Cedex;Dijon;;21078;France
fn:Dominique Faudot
end:vcard
--------------00CB1B38A997617DCB777797--
From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 29 09:55:02 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA01714
for reliable_computing-outgoing; Thu, 29 Apr 1999 09:55:02 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id JAA01707
for ; Thu, 29 Apr 1999 09:55:00 -0500 (CDT)
Received: from rbk5287 (goedel.usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-melissa_1.3) with SMTP id JAA00369;
Thu, 29 Apr 1999 09:54:38 -0500 (CDT)
Message-Id: <2.2.32.19990429145439.006f6098 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 29 Apr 1999 09:54:39 -0500
To: Dominique Faudot ,
reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott"
Subject: Re: interval of sum of functions
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
At 04:24 PM 4/29/96 +0200, Dominique Faudot wrote:
>Hi,
>I am just beginning with arithmetic of intervals applied to computer
>graphics. I have a problem, which is the following :
>
>Suppose we have f1(X) + f2(X) where f1 and f2 are functions and X an
>interval.
>
>1 - On which interval f1+f2 is defined ?
f1+f2 is generally defined where both f1 and f2 are, as with
real-valued functions.
>Is this interval (f1+f2)(X) ?
If f1 and f2 are evaluated, say, by evaluating each by replacing
the symbol X in the expression by intervals, then f1(X)+f2(X) will
contain the range of (f1+f2) over X, just as f1(X) contains the range
of f1 over X and f2(X) contains the range of f2 over X. In that sense,
(f1+f2)(X) is always equivalent to f1(X)+f2(X). However, unlike
real-valued functions, different ways of writing down f1 and f2 that
are equivalent in real arithmetic give rise to different interval
values.
>2 - On which interval is defined f'1(X), f'2(X), f'1+f'2 and (f1+f2)'
Generally, these functions are defined generally where you can define
the corresponding real-valued functions. My explanation above for
the sum is also valid for the sum of the derivatives.
Think of interval values as BOUNDS ON THE RANGE that are not unique.
Best regards,
Baker
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
From owner-reliable_computing [at] interval [dot] usl.edu Fri Apr 30 23:36:43 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA03255
for reliable_computing-outgoing; Fri, 30 Apr 1999 23:36:43 -0500 (CDT)
Received: from cs.utep.edu ([129.108.5.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id XAA03250
for ; Fri, 30 Apr 1999 23:36:40 -0500 (CDT)
Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA03812; Fri, 30 Apr 99 22:36:39 MDT
Date: Fri, 30 Apr 99 22:36:39 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9905010436.AA03812 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
Subject: El Paso Energy Award for work using intervals
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
On April 26, 1999, Diane Doser, Geological Sciences Professor from the
University of Texas at El Paso, was awarded El Paso Energy Foundation
Faculty Achievement Award for Research. This regional award is annually
awarded to the best faculty researcher. In her research, in addition to more
traditional statistical geophysical techniques, Dr. Doser used interval
methods for handling measurement uncertainty. Her paper on interval methods
in geophysics was published in Reliable Computing, 1998, Vol. 4, No. 3, pp.
241-168.