From owner-reliable_computing Tue May 6 12:20:29 1997 Received: by interval.usl.edu id AA05474 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 6 May 1997 05:30:29 -0500 Received: from goggins.bath.ac.uk by interval.usl.edu with SMTP id AA05468 (5.65c/IDA-1.4.4 for ); Tue, 6 May 1997 05:30:21 -0500 Received: from maths.Bath.AC.UK (actually host stork3.maths.bath.ac.uk) by goggins.bath.ac.uk with SMTP (PP); Tue, 6 May 1997 11:20:44 +0100 Date: Tue, 6 May 1997 11:20:29 +0100 (BST) From: "Dr D.S. Richardson" To: reliable_computing [at] interval [dot] usl.edu Subject: Aberth's toplogical degree algorithm Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk At Bath, we have studied O. Aberth's paper: Computation of topological degree using interval computation, and applications in Mathematics of Computation, Jan 1994, pp 1-10. A key part of this is that faces are subdivided at the midpoint. We have been looking at the problem of trying to improve the algorithm by choosing other subdivision points. At this stage we have some ideas, and we would like to hear about other results of this kind, if such exist. We also have an implementation of the algorithm, and would be interested in hearing about other implementations, and developing a catalogue of of test cases. Regards, Dan Richardson From owner-reliable_computing Tue May 6 02:25:53 1997 Received: by interval.usl.edu id AA05776 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 6 May 1997 07:26:04 -0500 Received: from boris.mscs.mu.edu by interval.usl.edu with SMTP id AA05770 (5.65c/IDA-1.4.4 for ); Tue, 6 May 1997 07:26:00 -0500 Received: by boris.mscs.mu.edu (Smail3.1.28.1 #9) id m0wOjJa-0010tjC; Tue, 6 May 97 07:25 CDT Message-Id: From: georgec [at] marque [dot] mscs.mu.edu (Dr. George F. Corliss MU MSCS) Subject: Zeros of a Polynomial (fwd) To: reliable_computing [at] interval [dot] usl.edu Date: Tue, 6 May 1997 07:25:53 -0500 (CDT) Cc: georgec [at] marque [dot] mscs.mu.edu (George Corliss), npsychar [at] physics [dot] gla.ac.uk X-Mailer: ELM [version 2.4 PL25] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Content-Length: 3868 Sender: owner-reliable_computing Precedence: bulk Can anyone else respond meaningfully to this query? I will send a general response, but I do not know about special-purpose methods for polynomials. Does anyone know an interval person in Glasgow? Forwarded message: > From: Nektarios Psycharis > To: georgec [at] boris [dot] mscs.mu.edu > Subject: Zeros of a Polynomial > Date: Tue, 06 May 97 11:00:45 +0100 > > Dear Dr Corliss > > My name is Nektarios Psycharis and I am > a PhD student in Theoretical Particle Physics (Lattice) > at Glasgow University (Scotland). > I am involved in a project where I try to find the zeros of > a polynomial. > I contacted earlier Professor Robert J. Lopez > and he suggested me to contact you. > I have a high deggree polynomial and I am trying to find the zeros > of it. The polynomial have coefficients of large magnitude. > I am using the Muller method to find the zeros. > I also have some errors of the coefficients > and with your experience I would be pleased if you > could inform me about any code which can > consider the errors of the coefficients > and give zeros with some errors. > Professor Lopez mentioned to me something about > interval arithmetic. I would be very pleased if you could > inform me for any possible use of this method to my problem. > > I hope I didnot spend much of your time. > > Thank You > > Yours Sincerely > > Nektarios Psycharis Interval arithmetic is a general-purpose method for dealing with sources of errors such as the uncertainty of the coefficients, truncation errors in methods such as Muller, and computer round-off that are present in your problem. Excellent introductions to interval analysis may be found in several books, including books by Moore, Hansen, Neumaier, Alefeld, or Kearfott. At least a few of these should be in your University's library. I am not an expert in special-purpose methods for polynomials, but I know about general-purpose non-linear solvers. One fundamental tool is the interval Newton method, and several variants. Each of the books listed discusses the interval Newton method, and Kearfott's book discusses a Fortran library of ftp-available software. One possible strategy is to use Muller's method for an approximate solution. Then try to put an interval around the computed approximation and use an interval Newton method to guarantee the existence of a unique root on an enclosing interval. This is effective if Muller's method is giving you good approximations. However, I suspect that if Muller's method were giving you good approximations, you would not be asking me. Hence, you may prefer a full global search strategy as done by Kearfott's software. If a contributing difficulty is that "very large coefficients" require an extended precision arithmetic, Maple is a good tool. The Maple share library includes an interval arithmetic package. I could send you a Maple worksheet with a very simple interval Newton method. If a contributing difficulty is the error in the coefficients, you may have REAL problems. Polynomial root-finding is notoriously ill-conditioned on coefficient values. Intervals can help you explore and understand that ill-conditioning, but intervals cannot remove the ill-conditioning of the mathematical problem. There are several good libraries available for doing interval arithmetic in C, C++, Fortran, Ada, Maple, and other languages. Duscussions are underway leading toward inclusion of intervals in Fortran 2000. This has been a very sketchy reply. I will be happy to expand on any parts you wish, and perhaps someone else will add to the discussion. George F. Corliss Dept. Math, Stat, Comp Sci Marquette University P.O. Box 1881 Milwaukee, WI 53201-1881 USA georgec [at] mscs [dot] mu.edu; CorlissG [at] vms [dot] csd.mu.edu http://www.mscs.mu.edu/~georgec/ (414) 288-6599 (office); 288-7375 (Dept.); 288-5472 (fax) From owner-reliable_computing Wed May 7 00:28:38 1997 Received: by interval.usl.edu id AA06311 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 6 May 1997 15:28:48 -0500 Received: from lambert.uni-paderborn.de by interval.usl.edu with SMTP id AA06305 (5.65c/IDA-1.4.4 for ); Tue, 6 May 1997 15:28:41 -0500 Received: (from krandick@localhost) by lambert.uni-paderborn.de (8.8.5/8.8.5) id WAA19760; Tue, 6 May 1997 22:28:38 +0200 (MET DST) Date: Tue, 6 May 1997 22:28:38 +0200 (MET DST) Message-Id: <199705062028.WAA19760 [at] lambert [dot] uni-paderborn.de> From: Werner Krandick To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Zeros of a Polynomial (fwd). Cc: npsychar [at] physics [dot] gla.ac.uk Sender: owner-reliable_computing Precedence: bulk Dear George, Whenever the coefficients of a polynomial are known exactly, all of its roots can be computed using exact calculation. For the case of real roots I gave a detailed description of such a method in Werner Krandick, Isolierung reeller Nullstellen von Polynomen, pp.105-154 in: Wissenschaftliches Rechnen, J"urgen Herzberger (ed.), Akademie-Verlag, 1995. There are also methods for complex root calculation. In either case, root calculation means to compute disjoint intervals (rectangles) that each contain exactly one root, and together contain all the roots. Once isolating intervals (rectangles) have been found, they can be refined to any desired accuracy using bisection, or Newton-steps, or a combination of the two. The multiplicity of each root is also computed. When only intervals are known for the coefficients, the above method for real root isolation can still be applied: Jeremy Johnson and Werner Krandick, Polynomial real root isolation using approximate arithmetic, Proceedings of the International Symposium on Symbolic and Algebraic Computation, Wolfgang K"uchlin (ed.), Maui, Hawaii, July 21-23, 1997, ACM Press, to appear. As you pointed out, the number of real roots of such polynomials might be undefined. So, in those cases (and possibly also in other cases) our method will report "inconclusive"; in many cases, however, - and we explored what those cases are - it does find isolating intervals. These intervals can then be refined - at least to some extent. The same approach can be used to find the complex roots of polynomials with complex interval coefficients. In 1995, I reported the following computing times for real root isolation of polynomials of degree 100: Polynomials with random 10-bit integer coefficients: 467 ms Cebyshev polynomial of the first kind: 17,900 ms Mignotte-polynomial x^100 - 2(5x-1)^2: 254,299 ms In 1992, I isolated the complex roots of polynomials of degree 50 with random 10-bit integer coefficients in 112,076 ms. I would be very interested to learn more about the "Glasgow- polynomials" - degree, coefficient size, where they occur, and what exactly needs to be computed (the real or the complex roots, all of them or just some, etc). But maybe we shouldn't do this on the interval mailing list; I would welcome a direct exchange of e-mail messages. Cheers, Werner ---------------------------------------------------------------------------- Werner Krandick, Ph.D. phone: +49 - 5251 - 60 3069 Dept. Math. and Computer Science fax: +49 - 5251 - 60 3516 University of Paderborn e-mail: krandick@uni-paderborn.de D-33095 Paderborn, Germany http://www-math.uni-paderborn.de/~krandick ---------------------------------------------------------------------------- From owner-reliable_computing Wed May 7 14:29:37 1997 Received: by interval.usl.edu id AA06967 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 7 May 1997 09:58:36 -0500 Received: from gps1.leeds.ac.uk ([129.11.16.2]) by interval.usl.edu with SMTP id AA06961 (5.65c/IDA-1.4.4 for ); Wed, 7 May 1997 09:58:30 -0500 Received: from mi.leeds.ac.uk (misun1.leeds.ac.uk [129.11.12.4]) by gps1.leeds.ac.uk (8.8.5/8.8.5) with SMTP id NAA08970 for ; Wed, 7 May 1997 13:29:59 +0100 (BST) Message-Id: <337075B1.15FB [at] mi [dot] leeds.ac.uk> Date: Wed, 07 May 1997 13:29:37 +0100 From: Zsuzsanna Szabo Organization: ICAMS, School of Chemistry, Univ. of Leeds X-Mailer: Mozilla 2.01S (X11; I; IRIX 6.2 IP22) Mime-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: software for inequalities Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing Precedence: bulk I am looking for a C, C++ or Maple interval package containing methods to solve systems of inequalities (i.e. eliminate certainly infeasible points). Does anybody know about public-domain packages for this purpose? Thank you in advance. Zsuzsanna Szabo zsu [at] mi [dot] leeds.ac.uk Institute for Computer Applications in Molecular Sciences University of Leeds From owner-reliable_computing Sat May 10 03:44:22 1997 Received: by interval.usl.edu id AA08622 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 10 May 1997 08:44:27 -0500 Received: by interval.usl.edu id AA08611 (5.65c/IDA-1.4.4 for reliable_computing); Sat, 10 May 1997 08:44:22 -0500 Date: Sat, 10 May 1997 08:44:22 -0500 From: "Kearfott R. Baker" Message-Id: <199705101344.AA08611 [at] interval [dot] usl.edu> To: reliable_computing Subject: Graduate student research assistantship opportunity Cc: cyc2538 [at] usl [dot] edu Sender: owner-reliable_computing Precedence: bulk There is an opening for a graduate student research assistant. The person will work with me on a project involving global optimization, automatic differentiation, parallelization, and applications. Because of the time frame of the project, the candidate should already have a knowledge of interval computations and background in one or more of the following: 1. Fortran language programming (ideally Fortran 90) or extensive experience in software development in another object-oriented language, and willingness to learn Fortran quickly. 2. Experience in coarse-grain parallelization, preferably using MPI. 3. Knowledge of techniques of automatic (computational) differentiation. Above all, the person should be dedicated to the work, excited about research and development projects, and understanding of the needs and pressures of directed research. The student will also satisfy the general requirements for admission to the graduate program in mathematics at the University of Southwestern Louisiana. See http://crock.cacs.usl.edu/Departments/EnrollMgmt/GradBulletin/ for an on-line version of the university's graduate bulletin, and http://crock.cacs.usl.edu/Departments/EnrollMgmt/GradBulletin/programs_f-m.html (then search down for "Mathematics") for specific requirements for the Mathematics Ph.D. (Also see: http://mathp6a.usl.edu/ for a more complete description of the mathematics department. See: http://www.usl.edu/ for general information about the university, and see: http://interval.usl.edu/kearfott.html for information about me and my research. The stipend will be $18,000 for one year, including tuition (roughly $2,000 per semester for a non-resident alien; much less for citizens and residents). Support after the first year is dependent upon the student passing an oral proficiency exam in English for a teaching assistantship, or else successful continuation (and funding) of the research project. Please send me a description of your background and goals (it may be in the form of a resume' or vita) by May 19. You may send this by email (rbk [at] usl [dot] edu) or fax ( 318-981-9744, attention R. Baker Kearfott), and it may be in ASCII, Postscript, TeX, DVI, PDF, RTF, Wordperfect, or MS Word format. I will make a decision and give further instructions as soon as possible (e.g. within a week) after that date. If this message is not of personal interest, please pass it on to someone appropriate. Best regards, R. Baker Kearfott --------------------------------------------------------------- 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 --------------------------------------------------------------- From owner-reliable_computing Tue May 13 11:16:31 1997 Received: by interval.usl.edu id AA10335 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 13 May 1997 14:17:07 -0500 Received: from cs.hope.edu (smaug.cs.hope.edu) by interval.usl.edu with SMTP id AA10329 (5.65c/IDA-1.4.4 for ); Tue, 13 May 1997 14:16:55 -0500 Received: from walkndude.cs.hope.edu by cs.hope.edu (5.x/SMI-SVR4 (Mod 5/10/94.8)) id AA18567; Tue, 13 May 1997 15:16:44 -0400 Received: from localhost by walkndude.cs.hope.edu (5.x/SMI-SVR4 (10/28/94)) id AA07051; Tue, 13 May 1997 15:16:33 -0400 Date: Tue, 13 May 1997 15:16:31 -0400 (EDT) From: Ronald Van Iwaarden X-Sender: rvaniwaa@walkndude To: Reliable Computing Mailing List Subject: VerGO 0.6.0 Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk This is my second major release of VerGO, Verified Global Optimization in C++. The number 0.6.0 indicates that this is a beta release which means it has potential bugs, is not feature complete, and may have documentation errors/incompleteness. On the plus side, it has been able to solve any (small) unconstrained problem that has been thrown at it so far. It includes a verified interval arithmetic package, automatic differentiation (reverse mode) for both intervals and doubles, all source code, and several examples. VerGO uses a standard branch and bound method with local search, monotonicity test, non-convexity test, and a Newton type step. These tests (except for the local search) can all be disabled through a few #defines. One of the major areas of incompleteness is constrained global optimization. This has been much improved since the last release but still is not as advanced as I would like it. It has, again, solved several small problems with both equality and/or inequality constraints. It verifies the existence of a feasible point in a box and then uses that to improve on the best estimate for the global optimum. Another area with significant improvement is the included automatic differentiation package. Variable names are no longer restricted and you have the choice of using AD for any or all of F, G, or H where F, G, and H represent the objective, inequality, or equality functions. Presently, I am interested in willing volunteers to give me some feed back on ease of use, ways to improve documentation, more ports (runs on about 10 PC and workstation platforms now), and speed tests/comparisons. The URL is http://www.cs.hope.edu/~rvaniwaa/VerGO. Please let me know if you are testing it, have used it in some interesting application, are interested in more information, or have any feedback at all! --Ron o Ronald Van Iwaarden | Work to live; /\ Hope College | Live to bike; _`\ `_<=== Holland MI 49423 | Bike to work! __(_)/_(_)___.-._ voice : (616)395-7523 | http://www.cs.hope.edu/~rvaniwaa/ From owner-reliable_computing Wed May 14 07:00:22 1997 Received: by interval.usl.edu id AA10895 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 14 May 1997 09:55:56 -0500 Received: from sucre.ven.net by interval.usl.edu with SMTP id AA10889 (5.65c/IDA-1.4.4 for ); Wed, 14 May 1997 09:55:47 -0500 Received: from wklindt.pdvsa.pdv.com (dppp07.ven.net [199.0.184.107]) by sucre.ven.net (8.7.4/8.6.12) with SMTP id LAA25596 for ; Wed, 14 May 1997 11:00:04 -0400 (AST) Message-Id: <3379D386.6332 [at] ven [dot] net> Date: Wed, 14 May 1997 11:00:22 -0400 From: WKC Organization: Personal X-Mailer: Mozilla 3.0Gold (Win95; I) Mime-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: Requesting comments on Mixture Sensitivity Analysis (Intervals - Probabilistic) Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing Precedence: bulk Dear Colleagues: Recently I have been using interval arithmetic to perform sensitivity analysis with good results. However, lately I have confronted mathematical models which are composed of probabilistic numbers and interval numbers, so I do not know how to do the analysis in these cases. Some ideas have passed through my mind, like: (1) Converting intervals in a uniform distribution (based on the maximum entropy) and then performing a simulation. (2) Obtaining confidence intervals from the probabilistic numbers and then using interval arithmetic to obtain a final interval, with at least the lowest probability of confidence of original probabilistic numbers. Please, I would like to hear any comment about this and/or any suggestions where I can find material or ideas to perform a mixture analysis with intervals and probability. Gratefully yours, Wilhelm Klindt C. marco [at] ven [dot] net Caracas -Venezuela From owner-reliable_computing Wed May 14 07:52:19 1997 Received: by interval.usl.edu id AA11191 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 14 May 1997 10:53:36 -0500 Received: from mail3.uts.ohio-state.edu by interval.usl.edu with SMTP id AA11185 (5.65c/IDA-1.4.4 for ); Wed, 14 May 1997 10:53:34 -0500 Received: from ts42-15.homenet.ohio-state.edu (ts42-15.homenet.ohio-state.edu [140.254.115.118]) by mail3.uts.ohio-state.edu (8.8.5/8.8.5) with SMTP id LAA24187; Wed, 14 May 1997 11:52:19 -0400 (EDT) Date: Wed, 14 May 1997 11:52:19 -0400 (EDT) Message-Id: <199705141552.LAA24187 [at] mail3 [dot] uts.ohio-state.edu> X-Sender: rmoore [at] pop [dot] service.ohio-state.edu X-Mailer: Windows Eudora Pro Version 2.1.2 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" To: marco [at] ven [dot] net From: Ramon Edgar Moore Subject: Requesting comments on Mixture Sensitivity Analysis (Intervals - Probabilistic) Cc: reliable_computing [at] interval [dot] usl.edu Sender: owner-reliable_computing Precedence: bulk See for instance: D. Berleant, Automatically verified reasoning with both intervals and probability density functions, INTERVAL COMPUTATIONS, 2:48-70, 1993. D. Berleant, Automatically verified arithmetic on probability distributions and intervals, APPLICATIONS OF INTERVAL COMPUTATIONS (R.B.KEARFOTT AND V. KREINOVICH, EDS.), 227-244, Kluwer, 1996. J. Pesonen and E. Hyvonen, Interval approach challenges Monte Carlo simulation, RELIABLE COMPUTING, 2(2):155-160, 1996. >Date: Wed, 14 May 1997 11:00:22 -0400 >From: WKC >Organization: Personal >To: reliable_computing [at] interval [dot] usl.edu >Subject: Requesting comments on Mixture Sensitivity Analysis (Intervals - Probabilistic) >Sender: owner-reliable_computing [at] interval [dot] usl.edu > >Dear Colleagues: > Recently I have been using interval arithmetic to perform >sensitivity analysis with good results. However, lately I have >confronted mathematical models which are composed of probabilistic >numbers and interval numbers, so I do not know how to do the analysis in >these cases. > Some ideas have passed through my mind, like: >(1) Converting intervals in a uniform distribution (based on the maximum >entropy) and then performing a simulation. >(2) Obtaining confidence intervals from the probabilistic numbers and >then using interval arithmetic to obtain a final interval, with at least >the lowest probability of confidence of original probabilistic numbers. > >Please, I would like to hear any comment about this and/or any >suggestions where I can find material or ideas to perform a mixture >analysis with intervals and probability. > > > Gratefully yours, > > Wilhelm Klindt C. > marco [at] ven [dot] net > Caracas -Venezuela > > From owner-reliable_computing Fri May 16 14:55:08 1997 Received: by interval.usl.edu id AA12793 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 16 May 1997 05:54:00 -0500 Received: from chaparro.ac.uma.es by interval.usl.edu with SMTP id AA12787 (5.65c/IDA-1.4.4 for ); Fri, 16 May 1997 05:53:45 -0500 Received: from pinsapo.ac.uma.es (pinsapo.ac.uma.es [150.214.109.2]) by chaparro.ac.uma.es (8.8.2/8.7.3) with ESMTP id MAA06501 for ; Fri, 16 May 1997 12:53:34 +0200 (MET DST) Received: (from hormigo@localhost) by pinsapo.ac.uma.es (8.8.2/8.7.3) id MAA10381 for reliable_computing [at] interval [dot] usl.edu; Fri, 16 May 1997 12:55:09 +0200 (MET DST) From: "Fco. Javier Hormigo Aguilar" Message-Id: <199705161055.MAA10381 [at] pinsapo [dot] ac.uma.es> Subject: Variable Precision To: reliable_computing [at] interval [dot] usl.edu Date: Fri, 16 May 1997 12:55:08 +0200 (MET DST) X-Mailer: ELM [version 2.4 PL25 PGP2] Content-Type: text Sender: owner-reliable_computing Precedence: bulk Hi: I am interested in variable precision arithmetic and I am looking for some ref erences about the precision need in real problems, and what kind of problems use variable precision. Regards, Javier Hormigo email:hormigo [at] ac [dot] uma.es From owner-reliable_computing Fri May 16 07:35:46 1997 Received: by interval.usl.edu id AA13270 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 16 May 1997 10:37:29 -0500 Received: from mail2.uts.ohio-state.edu by interval.usl.edu with SMTP id AA13264 (5.65c/IDA-1.4.4 for ); Fri, 16 May 1997 10:37:20 -0500 Received: from ts23-6.homenet.ohio-state.edu (ts23-6.homenet.ohio-state.edu [140.254.113.189]) by mail2.uts.ohio-state.edu (8.8.5/8.8.5) with SMTP id LAA11198; Fri, 16 May 1997 11:35:46 -0400 (EDT) Date: Fri, 16 May 1997 11:35:46 -0400 (EDT) Message-Id: <199705161535.LAA11198 [at] mail2 [dot] uts.ohio-state.edu> X-Sender: rmoore [at] pop [dot] service.ohio-state.edu X-Mailer: Windows Eudora Pro Version 2.1.2 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" To: hormigo [at] ac [dot] uma.es From: Ramon Edgar Moore Subject: Variable Precision Cc: reliable_computing [at] interval [dot] usl.edu Sender: owner-reliable_computing Precedence: bulk See, for example: J. S. Ely and R. G. Baker, High precision calculations of vortex sheet motion. JOURNAL OF COMPUTATIONAL PHYSICS, 111(2):275-281,1994 >From: "Fco. Javier Hormigo Aguilar" >Subject: Variable Precision >To: reliable_computing [at] interval [dot] usl.edu >Date: Fri, 16 May 1997 12:55:08 +0200 (MET DST) >Sender: owner-reliable_computing [at] interval [dot] usl.edu > > Hi: > > I am interested in variable precision arithmetic and I am looking for some ref >erences about the precision need in real problems, and what kind of problems use > variable precision. > > Regards, > > Javier Hormigo > email:hormigo [at] ac [dot] uma.es > > From owner-reliable_computing Sat May 17 05:39:57 1997 Received: by interval.usl.edu id AA13666 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 16 May 1997 20:40:12 -0500 Received: from cesit1.unifi.it by interval.usl.edu with SMTP id AA13660 (5.65c/IDA-1.4.4 for ); Fri, 16 May 1997 20:40:08 -0500 Received: from INGFI1.ING.UNIFI.IT by CESIT1.UNIFI.IT (PMDF V5.0-4 #3688) id <01IIYN3OWB2O000ABC [at] CESIT1 [dot] UNIFI.IT> for reliable_computing [at] interval [dot] usl.edu; Sat, 17 May 1997 03:40:04 +0100 (MET) Received: from aguirre.ing.unifi.it by INGFI1.ING.UNIFI.IT with SMTP; Sat, 17 May 1997 03:40:02 +0200 (MET-DST) Received: from ozon180.cs.dsi by aguirre.ing.unifi.it (4.1/SMI-4.1) id AA20178; Sat, 17 May 1997 03:39:58 +0200 Received: by ozon180.cs.dsi (5.0/SMI-SVR4) id AA24134; Sat, 17 May 1997 03:39:57 +0200 Date: Sat, 17 May 1997 03:39:57 +0200 From: csmr98 [at] aguirre [dot] ing.UNIFI.IT Subject: CFPs: 2nd Euromicro Work.Conf. on Soft.Maint. & Reeng., Florence To: reliable_computing [at] interval [dot] usl.edu Message-Id: <9705170139.AA24134 [at] ozon180 [dot] cs.dsi> Content-Transfer-Encoding: 7BIT Sender: owner-reliable_computing Precedence: bulk From: csmr98 [at] aguirre [dot] ing.unifi.it Dear colleague: Here is the call for papers for the 2nd EUROMICRO WORKING CONFERENCE on SOFTWARE MAINTENANCE AND REENGINEERING which will be help in Florence, Italy, in March 1998. Please accept our apologies if you receive multiple copies of this call. Please post and/or forward to all interested colleagues. Thank you, -------------------------------------------------------------------------- Call for Papers --------------- 2nd EUROMICRO WORKING CONFERENCE on SOFTWARE MAINTENANCE AND REENGINEERING Florence, Italy -- March 9-11, 1998 The purpose of the working conference is to promote discussion and interaction about a series of topics which are yet underrepresented. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results which could contribute to the academic arena and also benefit business and industrial community. Researcher, practitioners, technology transition experts, project managers, developers and users of tools, are all welcome. Topics of interest include but are not restricted to: Maintenance and Reengineering Tools (CARE-Tools), Reverse Engineering Tools, Support of Reengineering Tasks by CASE-Tools, Software Reusability, Tele-Maintenance (Concepts, Experiences, Use of New Technologies), Maintainability of Programming Languages (e.g., OOPLs), Models and Methods for Error Prediction, Measurement of Software Quality, Maintenance Metrics, Formal Methods, Maintenance and Reengineering of KBS, Reengineering and Reverse Engineering Concepts, Experiences from Redesign and Reengineering Projects, Millennium Problem (Year 2000), Euro Problem, Organizational Framework and Models for "RE"-Projects, Software Evolution, Migration and Maintenance Strategies, Design for Maintenance, Preventive Maintenance, Personnel Aspects of Maintenance (Motivation, Team building), Third Party Maintenance, Empirical Results about the Maintenance Situation in Businesses, Version and Configuration Management, Legal Aspects and Jurisdiction, Organization and Management of Large Maintenance Projects, Software Offloading, Related Areas such as Software Documentation. Program Committee: V.S. Alagar, USA; A. Ambriola, I; G. Bakker, NL; K. Bennett, UK; A. Bertolino, I; F. Brito e Abreu, P; G. Bucci, I; M. Campanai, I; A. Cimitile, I; I. Classen, D; L. da F. Costa, BR; J.A. de La Puente, S; A. Fantechi, I; J.-L. Hainaut, B; J. Harauz, CA; B. Henderson-Sellers, AU; M. Hinchey, USA; F. Lehner, D; E.-A. Karlsson, S; T.M. Khoshgoftaar, USA; P. Laplante, USA; S. Liu, J; M. Loewe, D; M. Marchesi, I; T.J. Marlowe, USA; E. Miller, USA; J.-M. Morel, F; D. Natale, I; P. Nesi, I; S. Nocentini, I; M. Pezze`, I; P.T. Poon, USA; L. Richter, CH; D. Rombach, D; G. Sechi, I; J. Sommerville, UK; A. Stoyen, USA; J. Taramaa, SF; H. Toetenel, NL; G. Tsai, USA; Y. Yamaguchi, J; SUBMISSIONS: There are two types of papers: full length papers (not exceeding 4000 words in length and including a 150-200 word abstract) and short papers (not exceeding 2000 words in length and including a 75-100 word abstract). Authors are strongly encouraged to send a PostScript version of their paper by anonymous ftp to ftp.dsi.unifi.it and put this file into the directory pub/CSMR98/incoming (in order to avoid overwritings, the PostScript file should be named:.ps). In addition, they should send by e-mail to CSMR98 [at] ozon180 [dot] ing.unifi.it the title of the paper, full names, affiliations, postal and e-mail addresses of all authors, fax and telephone numbers. Alternatively, the paper can be sent by postal mail. In that case, five copies of all the above items should be sent to a program chairman. Proceeding will be published by IEEE Computer Society. Full papers exceeding 8 pages (short papers 4 pages) will be charged for pages in excess.For more information please contact the organization at the addresses: csmr98 [at] ozon180 [dot] ing.unifi.it http://www.isst.fhg.de/csmr http://www.dsi.unifi.it/~nesi/csmr98.html The DEADLINE for submissions is Sept. 15, 1997. Authors will be notified of acceptance by Nov.25, 1997. The camera ready version of the paper will be required by Dec. 25, 1997. The following signed information should be included in the submission: All necessary clearances have been obtained for the publication of this paper. If accepted, the author(s) prepare the camera-ready manuscript in time for inclusion in the proceedings, and will personally present the paper at the working conference. SPECIAL SESSIONS: Sessions of special interest proposed by delegates will be welcome. Please send suggestions to a program chairman before the closing date of submissions. Program Chair: Paolo Nesi Dip. Sistemi e Informatica, Universita' degli Studi di Firenze Via S. Marta, 3, 50139 Firenze, Italy Tel: +39-55-4796523 Fax: +39-55-4796363 email: nesi [at] ingfi1 [dot] ing.unifi.it csmr98 [at] ozon180 [dot] ing.unifi.it Program co-Chair: Franz Lehner Institute for Business Informatics, University of Regensburg Universitatsstr, 31, D-93040 REGENSBURG, Germany Tel.: +49-941-943-2734 Fax: +49-941-943-4986 email:Franz.Lehner [at] wiwi [dot] uni-regensburg.de Organizing Chair: Alessandro Fantechi Dip. di Sistemi e Informatica, Universita' degli Studi di Firenze Via S. Marta, 3, 50139 Firenze, Italy Tel: +39-55-4796265 Fax: +39-55-4796363 email: fantechi [at] dsi [dot] dsi.unifi.it Local Chair: Maurizio Campanai CESVIT (High-Tech Agency), Fortezza da Basso Viale F. Strozzi 1, 50129 Firenze, Italy Tel: +39-55-4619154 Fax: +39-55-485345 email: campanai [at] cesvit [dot] it General information The conference will take place at Palazzo degli Affari, in the center of Florence. Enquiries about the working conference arrangements should be directed to the organizing chairman or to the local chairman. Preregistration is suggested for the authors. -------------------------------------------------------------------------- From owner-reliable_computing Sun May 18 06:18:59 1997 Received: by interval.usl.edu id AA14430 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 18 May 1997 13:19:07 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA14424 (5.65c/IDA-1.4.4 for ); Sun, 18 May 1997 13:19:03 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA23418; Sun, 18 May 97 12:18:59 MDT Date: Sun, 18 May 97 12:18:59 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705181818.AA23418 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: contents of Reliable Computing, No. 3, 1997 Sender: owner-reliable_computing Precedence: bulk "Reliable Computing", 1997, No. 3, contents Foreword 195-198 Mathematical foundations and generalizations of interval arithmetic S.Markov Isomorphic Embeddings of Abstract Interval Systems 199-207 Z.Kulpa Diagrammatic Representation of Interval Space in Proving Theorems about Interval Relations 209-217 D. Berthelot and M.Daumas Computing on Sequences of Embedded Intervals 219-227 J.Weinhofer and W. Haas $H_\infty $-Control using Polynomial Matrices and Interval Arithmetic 229-237 Numerical methods and computer assisted proofs W. Hofschuster and W. Kr"amer A Computer Oriented Approach to Get Sharp Reliable Error Bounds 239-248 W. Otten, W. Luther Approximation Error and Error Accumulation for the Landen Transform 249-258 C. Bliek Fast Evaluation of Partial Derivatives and Interval Slopes 259-268 O.Caprani, K.Madsen, and O.Stauning Existence Test for Asynchronous Interval Iteration 269-275 M. Mrozek and M.Zelawski Heteroclinic connections in the Kuramoto-Sivashinsky equation: a computer assisted proof 277-285 H.-J. Dobner and S. Ritter Attacking a conjecture in mathematical physics by combining methods of computational analysis and scientific computing 287-295 B. Dobronets Two-sided Multigrid Method for Elliptic Boundary Value Problems 297-303 Complexity and constraint logic programming B. Acioly and B. Bedregal A Quasi-Metric Topology Compatible with Inclusion Monotonicity on Interval Space 305-313 J.Rohn Complexity of Some Linear Problems with Interval Data 315-323 M. Rueher and C. Solnon Concurent Cooperating Solvers on the Reals 325-333 F. Benhamou and L. Granvilliers Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving 335-344 Information Interval'98 First announcement and call for papers 345-347  ----- End Included Message ----- From owner-reliable_computing Mon May 19 03:23:14 1997 Received: by interval.usl.edu id AA15375 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 19 May 1997 10:23:26 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA15369 (5.65c/IDA-1.4.4 for ); Mon, 19 May 1997 10:23:20 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA26272; Mon, 19 May 97 09:23:14 MDT Date: Mon, 19 May 97 09:23:14 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705191523.AA26272 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Shiriaev: change of address Sender: owner-reliable_computing Precedence: bulk For those who do not know it yet: Dmitri (Dima) Shiriaev has recently moved to California; he is now working for Sun Microsystems. Dmitri is in charge of the group that implements interval arithmetic for a Fortran 90 compiler. his new email is dmitri@seacat-71.eng.sun.com From owner-reliable_computing Mon May 19 08:02:36 1997 Received: by interval.usl.edu id AA15967 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 19 May 1997 15:02:50 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA15961 (5.65c/IDA-1.4.4 for ); Mon, 19 May 1997 15:02:45 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA27542; Mon, 19 May 97 14:02:36 MDT Date: Mon, 19 May 97 14:02:36 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705192002.AA27542 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: Interval'98: first announcement Sender: owner-reliable_computing Precedence: bulk >>> FIRST ANNOUNCEMENT and CALL FOR PAPERS <<< +------------------------------------------------+ | INTERNATIONAL CONFERENCE ON | | INTERVAL METHODS AND THEIR APPLICATION | | IN GLOBAL OPTIMIZATION | | | | (INTERVAL'98) | | | | April 20-23, Nanjing, China | +------------------------------------------------+ ORGANIZED BY - Department of Mathematics, Nanjing University - The Editorial Board of the International Journal "Reliable Computing" The following scientists have been invited to join the INTERNATIONAL PROGRAM COMMITTEE G. Alefeld (co-chair, Germany), G. Corliss (USA), A. Cuyt (Belgium), B. Dobronets (Russia), J. Garloff (Germany), R.B. Kearfott (co-chair, USA), V. Kreinovich (USA), S. Markov (Bulgaria), G. Mayer (Germany), M. Nakao (Japan), V.M. Nesterov (co-chair, Russia), H. Ratschek (Germany), J. Rokne (Canada), S. Rump (Germany), S. Shary (Russia), E. Walter (France) B. Walster (USA), J. Wolff von Gudenberg (co-chair, Germany) Local organizer: Shen Zuhe INTERVAL'XX--CONFERENCES The conferences INTERVAL'XX are significant meetings devoted to various aspects of reliable numerical computations based on the interval approach. (Sometimes the terms validated numerics, localizational computations, or enclosure methods are used). Talks are devoted to development of corresponding mathematical structures, design of computer tools, and applications in a wide range of areas. The first conference was held in September 1992 near Moscow, with impressive success. Papers were presented by 106 participants from 17 countries throughout the world. It was decided to hold the INTERVAL'XX conferences biannually. The INTERVAL'92 conference emphasized the relation of interval computations to mathematical statistics. (The complete title of the conference was "Interval and Stochastic Methods in Science and Engineering"). The INTERVAL'94 conference emphasized interdisciplinary research with computer algebra. (The complete title of the conference was "Interval and Computer Algebraic Methods in Science and Engineering"). It took place March 6-11, 1994 in St. Petersburg, Russia. There were more than 120 talks presented by participants from 18 countries. INTERVAL'96 was focused on computer assisted proofs ranging from symbolic computation through rigorous error estimation, and including different paradigms such as functional and logic programming as well as solution of constraint systems. The traditional interval approach appeared as one important aspect common to most of the approaches. (The complete title of the conference was "Interval Methods and Computer aided Proofs in Science and Engineering"). It took place Sept 30 - Oct 2, 1996 in Wuerzburg, Germany. INTERVAL'98 will emphasize the application of interval mathematics and its combination with the interdisciplinary topics from the two preceding meetings in global optimization. Especially welcome are contributions which use interval arithmetic tools for solving problems of practical relevance. TOPICS The following topics will be considered: interval mathematics, hardware and software for interval and computer-algebraic methods, SC-languages, logic constraint programming, interval modelling, interval constraints, computer aided proofs in analysis, interval algorithms in control theory, organization of symbolic-numeric interfaces, programming environments for scientific computing, and applications in various fields of science and engineering as well as commercial issues. TIME AND PLACE The conference will be held April 20-23 in Nanjing, China. Nanjing(Nanking), situated at 32 degree north latitude and 119 degree east longitude, is the provincial capital and also the political, economic and cultural centre of Jiangsu Province. The city of Nanjing is well placed with the vast Jiangsu plain lying to the north, the rich Changjiang (Yangtse) River delta to the southeast, the gigantic bridge striding over the turbulent river which runs through the city, the Purple Hills towering in its eastern suburbs and the Stone City Wall standing in the west. More information about Nanjing see below. There are several ways to get to Nanjing: 1. from HongKong to Nanjing by air(probably this is the best way to reach Nanjing); 2. from Beijing to Nanjing by air or by railway train(~15 hours over night); 3. from Shanghai to Nanjing by air, by train(~4 hours), or by bus (a new highway, ~3 hours). There is a hotel in the University. The price of a two bed room: appr. US$60/per night. (Unfortunatly, there are no one bed rooms.) FEES Information on the registration fee for the conference will be sent in further announcements. EXTENDED ABSTRACTS AND PAPERS Two copies of an extended abstract of maximum 2 pages are requested for selection purposes. The deadline will be 31.10.1997. Electronic submission is strongly recommended. A collection of extended abstracts will be printed before the conference. Refereed proceedings including full versions of selected papers will be published after the conference. LANGUAGES The official language is English. IF YOU WISH TO GET MORE DETAILED INFORMATION CONTACT: Prof. Dr. Shen Zuhe email:shenzuhe [at] netra [dot] nju.edu.cn Mail address : Department of Mathematics Nanjing University Nanjing 21008 People's Republic of China HISTORY OF NANJING Located in the subtropical zone, it enjoys a mild climate with the annual mean temperature at 15 C. Dry in winter, Nanjing is marked by intermittent drizzles in spring but gets most of the rainfall in summer. Nanjing is an old city with a long history. As far back as three or four thousand years ago Chinese forefathers already began to live and work here. Around 1,100 B.C. this region was within the territory of the state of Wu. By the end of the Spring and Autumn Period there was a town with an important smelting industry, called Yecheng or the Metallurgical City, occupying what is now the area around Chaotian Gong. In 473 B.C., when Goujian, the King of the state of Yue, conquered Wu, Fan Li, the Yue prime minister, built a city at Changgan Lane(the area around today's Zhonghuamen Gate) and named it Yuecheng. In the Warring States Period, when Yue was conquered in its turn by the state of Chu, a city named Jinling was built on Stone Hill (now called Qingliang Hill), and that is why, in literary writings, Jinling is often used to refer to Nanjing. During the period of the Three Kingdoms(229-280 A.D.), Sun Quan made it his capital and renamed it Jianye and built a stone wall around it. Nanjing thus began to be the capital of six southern dynasties (Wu, Eastern Jin, Song, Qi, Liang and Chen). With the founding of the Ming Dynasty(1368), the city became for the first time the national capital of the whole country. It was not called Nanjing, however, until 1421 when Emperor Yongle moved the capital to Beijing. During the period of 1853-1864, the Kingdom of Heavenly Peace, founded in revolt against the Qing Dynasty, established its capital here and called it Tianjing. The city resumed its name Nanjing in 1912 with the establishment of a provisional government following the overthrow of the Qing Dynasty by the 1911 Revolution led by Dr. Sun Yat-sen. From 1927 onwards Nanjing was the capital of the Kuomintang Government until it was liberated in April 1949. Clean, spacious and well kept, Nanjing is also a green city with its streets well lined with various trees. As Nanjing is a city with an ancient cultural background, there are many places of interest to visit. The busiest districts in Nanjing are Xinjiekou, Fuzimiao and the Drum Tower area. >  ----- End Included Message ----- From owner-reliable_computing Mon May 19 10:12:07 1997 Received: by interval.usl.edu id AA16352 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 19 May 1997 17:12:16 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA16346 (5.65c/IDA-1.4.4 for ); Mon, 19 May 1997 17:12:11 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA28224; Mon, 19 May 97 16:12:07 MDT Date: Mon, 19 May 97 16:12:07 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705192212.AA28224 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Interval'98 on the web Sender: owner-reliable_computing Precedence: bulk The first announcement of Interval'98 has been placed on the interval website http://cs.utep.edu/interval-comp/main.html, click on forthcoming conferences From owner-reliable_computing Mon May 26 06:00:54 1997 Received: by interval.usl.edu id AA01532 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 26 May 1997 09:01:12 -0500 Received: from cs.hope.edu (smaug.cs.hope.edu) by interval.usl.edu with SMTP id AA01526 (5.65c/IDA-1.4.4 for ); Mon, 26 May 1997 09:01:07 -0500 Received: from walkndude.cs.hope.edu by cs.hope.edu (SMI-8.6/SMI-SVR4 (Mod 5/10/94.8)) via SMTP id KAA08430; Mon, 26 May 1997 10:00:57 -0400 Received: from localhost by walkndude.cs.hope.edu (5.x/SMI-SVR4 (10/28/94)) id AA02720; Mon, 26 May 1997 10:00:56 -0400 Date: Mon, 26 May 1997 10:00:54 -0400 (EDT) From: Ronald Van Iwaarden X-Sender: rvaniwaa@walkndude To: Reliable Computing Mailing List Subject: I have moved Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk This is a quick message to all to let you know that I have now moved. My new e-mail address will be rvan [at] tiger [dot] cudenver.edu and my web pages are at http://www-math.cudenver.edu/~rvan This may be a temporary arangement but it will have to do for now. My old web pages and old account should continue to function until June 20th but there is no guarantee of continued existence after that date. --Ron From owner-reliable_computing Tue May 27 00:43:51 1997 Received: by interval.usl.edu id AA04147 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 27 May 1997 00:43:51 -0500 Received: from hp9000.hrz.uni-oldenburg.de by interval.usl.edu with SMTP id AA04141 (5.65c/IDA-1.4.4 for ); Tue, 27 May 1997 00:43:48 -0500 Received: from mathematik.uni-oldenburg.de (mathematik.uni-oldenburg.de [134.106.104.2]) by hp9000.hrz.uni-oldenburg.de (8.8.5/8.8.5/24.01.97) with ESMTP id HAA06743 for ; Tue, 27 May 1997 07:45:55 +0200 (METDST) Received: from FB6/MAILQUEUE by mathematik.uni-oldenburg.de (Mercury 1.21); 27 May 97 07:43:46 MEZ-1MESZ Received: from MAILQUEUE by FB6 (Mercury 1.21); 27 May 97 07:43:27 MEZ-1MESZ From: "Helmuth Spaeth" To: reliable_computing [at] interval [dot] usl.edu Date: Tue, 27 May 1997 07:43:25 MET-1 Subject: Reply-To: spaeth [at] mathematik [dot] uni-oldenburg.de Priority: normal X-Mailer: Pegasus Mail v3.22 Message-Id: <19DAFBE65712 [at] mathematik [dot] uni-oldenburg.de> Sender: owner-reliable_computing Precedence: bulk Please do delete my email address. Regards, Helmuth Spaeth From owner-reliable_computing Tue May 27 04:35:09 1997 Received: by interval.usl.edu id AA07334 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 27 May 1997 11:35:19 -0500 Received: from cs.utah.edu by interval.usl.edu with SMTP id AA07328 (5.65c/IDA-1.4.4 for ); Tue, 27 May 1997 11:35:16 -0500 Received: from sinc.cs.utah.edu by cs.utah.edu (8.8.4/utah-2.21-cs) id KAA14869; Tue, 27 May 1997 10:35:09 -0600 (MDT) Received: by sinc.cs.utah.edu (8.6.12/utah-2.15sun-leaf) id KAA16417; Tue, 27 May 1997 10:35:09 -0600 Date: Tue, 27 May 1997 10:35:09 -0600 From: stenger [at] sinc [dot] cs.utah.edu (Frank Stenger) Message-Id: <199705271635.KAA16417 [at] sinc [dot] cs.utah.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: delete from e-mail list Sender: owner-reliable_computing Precedence: bulk lease do delete my email address. Regards, Frank Stenger From owner-reliable_computing Wed May 28 15:34:54 1997 Received: by interval.usl.edu id AA07413 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 29 May 1997 00:50:49 -0500 Received: from csr.csc.UVic.CA by interval.usl.edu with SMTP id AA07407 (5.65c/IDA-1.4.4 for ); Thu, 29 May 1997 00:50:45 -0500 Received: by csr.csc.UVic.CA (4.1/UVicCScServer-MX-1.12) id AA27601; Wed, 28 May 97 22:34:54 PDT Date: Wed, 28 May 97 22:34:54 PDT From: nigelh [at] csr [dot] csc.UVic.CA (R Nigel Horspool) Message-Id: <9705290534.AA27601 [at] csr [dot] csc.UVic.CA> To: si2000 [at] csr [dot] csc.UVic.CA Subject: CFP: SI2000 Sender: owner-reliable_computing Precedence: bulk CALL-FOR-PAPERS Systems Implementation 2000: Languages, Methods and Tools Berlin, Germany, 23-26 February 1998 The conference will address problems and solutions in implementing complex and high quality systems past the year 2000. People with experience in such implementations are especially invited to attend. SI2000 will focus on the development of languages, methods, and tools and their further evaluation. The conference is intended to provide a forum for the presentation of existing knowledge as well as to provoke lively debate on its applicability in the real world. We invite you to submit a paper on one of the following themes: * evolution of software systems * specific application domains supporting portability and reusability of software components * the development of networking software * software architectures for various application domains * experience reports on the use of novel development and implementation techniques. Further information on the conference and how to submit a paper are provided at our web site: http://www.csc.uvic.ca/~wg24 The deadline for submissions is 15 September 1997. From owner-reliable_computing Thu May 29 09:38:13 1997 Received: by interval.usl.edu id AA08016 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 29 May 1997 14:38:14 -0500 Received: by interval.usl.edu id AA08006 (5.65c/IDA-1.4.4 for reliable_computing); Thu, 29 May 1997 14:38:13 -0500 Date: Thu, 29 May 1997 14:38:13 -0500 From: "Kearfott R. Baker" Message-Id: <199705291938.AA08006 [at] interval [dot] usl.edu> To: reliable_computing Subject: Thank you: address verification procedure Sender: owner-reliable_computing Precedence: bulk Dear Colleagues: Thank you for your cooperation in the semiannual address verification procedure that I recently ran. I removed the following addresses that bounced during this procedure. If you think any of these were removed in error, or if you know of updated addresses, I would appreciate your help. aach04 [at] sakacs00 [dot] bitnet angelica [at] inf [dot] ufrgs.br bochev [at] vtmath [dot] math.vt.edu dg8m [at] rs11 [dot] hrz.th-darmstadt.de fh1szk [at] dsyibm [dot] desy.de ae16 [at] dkauni2 [dot] bitnet g_vega [at] ccucvx [dot] unican.es steins [at] math [dot] uni-wuppertal.de aach04 [at] sakacs00 [dot] bitnet dg8m [at] rs11 [dot] hrz.th-darmstadt.de fh1szk [at] dsyibm [dot] desy.de forner [at] informatik [dot] uni-leipzig.d400.de kxd5425 [at] ucs [dot] usl.edu olazabal [at] ccucvx [dot] unican.es willmann [at] sun1 [dot] ruf.uni-freiburg.de acasares [at] puce [dot] edu.ec hchoi [at] angel [dot] ths.com Best regards, R. Baker Kearfott --------------------------------------------------------------- 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 --------------------------------------------------------------- From owner-reliable_computing Thu May 29 11:49:40 1997 Received: by interval.usl.edu id AA08311 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 29 May 1997 18:49:46 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA08305 (5.65c/IDA-1.4.4 for ); Thu, 29 May 1997 18:49:43 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA11618; Thu, 29 May 97 17:49:40 MDT Date: Thu, 29 May 97 17:49:40 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705292349.AA11618 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: book of interest to interval researchers Cc: mkosh [at] cs [dot] utep.edu Sender: owner-reliable_computing Precedence: bulk P.S. The links to this books have been added to the Books section of the interval computations website http://cs.utep.edu/interval-comp/main.html ----- Begin Included Message ---- From: Jean-Michel Muller Dear colleagues, This is to announce the imminent outcome of my book, "Elementary functions, algorithms and Implementation", published by Birkhauser Boston. Birkhauser's web page for the book is: http://www.birkhauser.com/cgi-win/ISBN/0-8176-3990-X it includes a description of the book, ordering information, and will include additional resources and selected code. My own web page for the book is: http://www.ens-lyon.fr/~jmmuller/book_functions.html Contents: 1. Introduction 2. Computer Arithmetic 2.1 Floating-Point Arithmetic 2.1.1 Floating-Point formats 2.1.2 Rounding modes 2.1.3 Subnormal numbers and exceptions 2.1.4 ULPs 2.1.5 Testing your computational environment 2.2 Redundant Number Systems 2.2.1 Signed-digit number systems 2.2.2 Radix-2 redundant number systems I. Algorithms Based on Polynomial Approximation and/or Table Lookup 3. Polynomial Approximations 3.1 Least Squares Polynomial Approximations 3.1.1 Legendre polynomials 3.1.2 Chebyshev polynomials 3.1.3 Jacobi polynomials 3.2 Least Maximum Approximations 3.3 Speed of Convergence 3.4 Rational Approximations 3.5 Actual Computation 3.6 Example: the Cyrix FastMath Processor 3.7 Algorithms and Architectures 3.7.1 The E-Method 3.7.2 Estrin's Method 3.8 Miscellaneous 4. Table-Based Methods 4.1 Introduction 4.2 Table-Driven Algorithms 4.2.1 Tang's algorithm for exp(x) in IEEE floating-point arithmetic 4.2.2 ln(x) on [1,2] 4.2.3 sin(x) on [0, pi/4] 4.3 Gal's Accurate Tables Method 4.4 Methods Requiring Specialized Hardware 4.4.1 Wong and Goto, logarithm 4.4.2 Wong and Goto, exponential II. Shift-and-Add Algorithms 5. Shift-and-Add algorithms 5.1 The Restoring and Nonrestoring Algorithms 5.2 Simple Algorithms for Exponentials and Logarithms 5.2.1 The restoring algorithm for exponentials 5.2.2 The restoring algorithm for logarithms 5.3 Faster Algorithms 5.3.1 Faster computation of exponentials 5.3.2 Faster computation of logarithms 5.4 Baker's Predictive Algorithm 5.5 Bibliographic notes 6. The CORDIC Algorithm 6.1 Introduction 6.2 The Conventional Iteration 6.3 Scale Factor Compensation 6.4 CORDIC With Redundant Number Systems 6.4.1 Signed-digit implementation 6.4.2 Carry-save implementation 6.4.3 The variable scale factor problem 6.5 The Double Rotation Method 6.6 Branching CORDIC 6.7 Differential CORDIC 6.8 Computation of cos-1 and sin-1 6.9 Variations on CORDIC 7. Other Shift-and-Add Algorithms 7.1 High-Radix Algorithms 7.1.1 Ercegovac's radix-16 algorithms 7.2 The BKM Algorithm 7.2.1 The BKM iteration 7.2.2 Computation of the exponential function (E-mode) 7.2.3 Computation of the logarithm function (L-mode) 7.2.4 Application to the computation of elementary functions III. Range Reduction, Final Rounding and Exceptions 8. Range Reduction 8.1 Introduction 8.2 Cody and Waite's Method for Range Reduction 8.3 Worst Cases for Range Reduction 8.3.1 A few basic notions on continued fractions 8.3.2 Finding worst cases using continued fractions 8.4 The Payne and Hanek Algorithm 8.5 The Modular Algorithm 8.5.1 Fixed-point reduction 8.5.2 Floating-point reduction 8.5.3 Architectures for Modular Reduction 9. Final Rounding 9.1 Introduction 9.2 Monotonicity 9.3 Exact Rounding: Presentation of the Problem 9.4 Some Experiments 9.5 A "Probabilistic" Approach 9.6 Upper Bounds on m 9.6.1 Frequency of Failures 9.6.2 Computing with one million bits 10. Miscellaneous 10.1 Exceptions 10.1.1 NaNs 10.1.2 Exact Results 10.2 Notes on xy 10.3 Multiple Precision ----- End Included Message ----- From owner-reliable_computing Fri May 30 12:49:45 1997 Received: by interval.usl.edu id AA08698 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 30 May 1997 03:51:37 -0500 Received: from prologianet.univ-mrs.fr by interval.usl.edu with SMTP id AA08692 (5.65c/IDA-1.4.4 for ); Fri, 30 May 1997 03:51:26 -0500 Received: from gwp200p by prologianet.univ-mrs.fr (SMI-8.6/SMI-SVR4) id KAA17423; Fri, 30 May 1997 10:51:12 +0200 Message-Id: <338E94A9.1A76 [at] prologianet [dot] univ-mrs.fr> Date: Fri, 30 May 1997 10:49:45 +0200 From: "Stephane N'Dong" Reply-To: steph [at] prologianet [dot] univ-mrs.fr Organization: PrologIA X-Mailer: Mozilla 3.01Gold (WinNT; I) Mime-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: (no subject) Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing Precedence: bulk Please do delete my email address. Regards Stiphane N'Dong From owner-reliable_computing Fri May 30 09:12:13 1997 Received: by interval.usl.edu id AA09365 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 30 May 1997 16:40:10 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA09359 (5.65c/IDA-1.4.4 for ); Fri, 30 May 1997 16:40:04 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA07612; Fri, 30 May 97 15:12:14 MDT Date: Fri, 30 May 97 15:12:13 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9705302112.AA07612 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: interval languages Cc: fateman [at] cs [dot] berkeley.edu, mkosh [at] cs [dot] utep.edu Sender: owner-reliable_computing Precedence: bulk Richard Fateman from UC Berkeley has informed us that in the interval languages part of the interval website (http://cs.utep.edu/interval-comp/main.html), several things were missing such as support of interval computations in Maple and Mathematica, etc. Thanks to his suggestions, we have added the corresponding links to this page. Please let us know of any further desired additions and/or changes. Thanks. Vladik and Misha