NA Digest Sunday, March 21, 1999 Volume 99 : Issue 12

Today's Editor:
Cleve Moler
The MathWorks, Inc.

Submissions for NA Digest:

Mail to

Information about NA-NET:

Mail to

URL for the World Wide Web:

From: Jim Epperson <>
Date: Fri, 19 Mar 1999 14:01:46 -0600 (CST)
Subject: Complex Remez Algorithm

Is there a complex analogue of the Remez algorithm for finding a minimax
polynomial approximation to a given function?

Jim Epperson


From: Ken Turkowski <>
Date: Fri, 19 Mar 1999 14:07:47 -0800
Subject: Exponeniation of a Quaternion

I'm looking for a technique for exponentiating a quaternion (not
necessarily a normalized):


This will be evaluated at many values of t (not necessarily uniformly
spaced) for the same q, so I can do a bit of complicated setup before the
sequence of evalauations, but I would like each evaluation to be
relatively fast.

Can you offer any suggestions?

Ken Turkowski Immersive Media Technology Development
Apple Computer, Inc. email:
MS 302-3VR voice: +1 408 974 6699
Cupertino, CA 95014 fax: +1 408 974 5426


From: Ron Boisvert <>
Date: Fri, 19 Mar 1999 17:34:23 -0500
Subject: ACM TOMS Back on Schedule, Backlog Reduced

After a year of production delays associated with the conversion to a new
composition system, the ACM Transactions on Mathematical Software (TOMS)
is now being published (nearly) on time once again. In the process, TOMS
has been able to clear out its backlog. For example, many of the papers
which will appear in the March 1999 issue were accepted late in 1998.
TOMS continues to solict high-quality papers on the practical aspects of
mathematical algorithms and their implementation in modern computing systems.
Both regular research papers and papers which include software for possible
inclusion in the Collected Algorithms of the ACM may be submitted. Algorithms
may be coded in any widely available language; recent algorithms have been
published in C, C++ and Matlab, as well as in Fortran 90. Further information
about TOMS, including instructions for authors, can be found at


From: Bruce Hendrickson <>
Date: Thu, 18 Mar 99 10:52:49 MST
Subject: Follow up to Simple Geometry Problem

Several weeks ago, I posed the following question on na-digest.

A tetrahedron and a rectilinear 3D grid.
The volume of intersection of the tet with each grid cell.

I have had a number of responses that I would be happy to share
with anyone who expresses interest. Thanks to all of you who
shared your thoughts. My specific interest was due to a particular
Lagrangian/Eulerian coupling. However, I discovered via the
replies that this kernel arises in a number of other settings
including computer graphics, the cut-cell Cartesian method, and
certain types of ALE codes.

Most of the responses suggested an algorithm like the following

For each grid cell
Construct the intersection polygon
Compute its volume

A nice exposition about some details of this kind of algorithm can
be found in the description of the work by Aftosmis and Melton at

However, for my particular problem I think this approach is flawed
for two reasons. First, it is better to compute all the relevant
intersection points of the tet with the grid up front instead of
working on one cell at a time. This allows you to avoid unnecessary
recomputation, and (more importantly) it is easier to perform all
the intersection calculations in a consistent manner.

Second, I only need the volume of intersection, so the explicit
construction of the intersection polytope is overkill. This allows
for a simpler approach that works on one face of the tetrahedron at
a time. You may recall the clever algorithm for finding the area
of an arbitrary polygon in 2D. It works by computing the area
of a quadrilateral under each edge, and then adds or subtracts
this from the total area as appropriate. The same idea works
in 3D, leading to the following approach to my problem.

For each face of the tetrahedron
For each cell beneath it in the grid
Compute the volume of the cell region below the face
Add or subtract it to total volume as appropriate

This approach has a couple of additional advantages. First, the volume
calculations are simplified by the fact that I have a rectilinear grid.
Second, the algorithm generalizes to arbitrary polyhedra, not just

Any further thoughts would be of interest. I would be happy to discuss
this class of problems further with anyone who has bothered to read this

- Bruce Hendrickson


From: Peter Tang <>
Date: Thu, 18 Mar 1999 11:19:16 -0800
Subject: Change of Address for Peter Tang

Dear Colleagues:

I have taken a position as an Applied Mathematician at Intel Corporation and
my new address is

Ping Tak Peter Tang
Computational Software Lab, SC12-301
Intel Corp
2200 Mission College Blvd
Santa Clara, CA 94502 <>
Phone: 408-765-0626, Fax: 408-765-5165


From: Andreas Ahland <>
Date: Wed, 17 Mar 1999 08:59:38 +0100
Subject: Doing Numerics with C++

Numerical applications with object oriented design
Doing numerics with C++

C++ has a bad reputation for numeric calculations which is mainly caused by
its object oriented design. Using straightforward implementations of
numerical classes such as Vectors, Matrices etc., will cause a lot of
unnecessary copying and therefore decrease performance. This however can be
avoided through not as obvious implementations of these numerical base classes
as is usually the case. We chose an implementation based on the
"Temporary Base Class Idiom" TBCI to avoid the unnecessary copying of

We developed a templated library of numerical base classes which implement
basic data structures like complex numbers, dynamic vectors, static vectors,
different types of matrices like full matrices, band matrices, sparse
matrices, etc. and also included a representation for Tensors and its
typical operations like contraction, direct product and multiplication with
contraction. Further-on, some standard matrix solvers
like gauss-jordan LU-decomposition or iterative solvers have been
implemented as well as several interfaces to
libraries as CLAPACK or SuperLU (general sparse LU).

The header files are packed in tgz archive which is downloadable here:

The lib is found under "Research" and "Numblib". The performance is nearly
that of the BLITZ++ project, while the compiler does not need to be as much
ISO / ANSI compliant. The lib has been tested using egcs and MS VC 5.0/6.0.


From: Juha Haataja <>
Date: Tue, 16 Mar 1999 13:06:06 +0200
Subject: Finnish Center for Scientific Computing

Center for Scientific Computing, or simply CSC, is a Finnish service
center specializing in scientific computing and data
communications. CSC provides modeling, computing and information
services for universities, research institutes and industry.

CSC has published a report focusing on the achievements of
computational science in Finland. We have selected illustrative
examples from, e.g., physics, chemistry, biosciences, economics and
astronomy. Of course, this report can only show a small sample of the
results: CSC has over 1500 users, who are involved in over 700 active

The report is available at the Web address

in Adobe Acrobat format. A limited number of copies is also available
in printed form.

We hope this report encourages the readers to "think big". We are
currently compiling a report on the Finnish grand challenges in
scientific computing. We hope that the next supercomputer system - to
be installed in 2000 or 2001 - will make it possible to meet at least
some of these challenges.

We hope that you enjoy this interdisciplinary review of scientific
computing. Please send your comments about this report to the e-mail


- Juha Haataja, CSC


From: Michael Olesen <>
Date: Mon, 15 Mar 1999 14:02:20 -0600 (CST)
Subject: Computational Neuroscience Symposium

First Annual
University of Minnesota
Computational Neuroscience Symposium
October 7-8, 1999

The Computational Neuroscience Program of the University of
Minnesota in conjunction with the Department of Neuroscience, the
Graduate Programs in Scientific Computation and Neuroscience, and
the Supercomputing Institute for Digital Simulation and Advanced
Computation will host a symposium on computational neuroscience on
October 7 and 8 on the University of Minnesota campus. Topics

--molecular mechanisms in ion channels
--signal transduction
--neurotransmission and receptors
--computational models of vistibular and oculomotor control
--robotics and computer vision
--neural network models

For more information please contact the Conference Administrator,
Kathleen Clinton, at or (612) 625-8424.
Additional information is also available on the World Wide Web at:


From: Jianping Zhu <jzhu@Ra.MsState.Edu>
Date: Mon, 15 Mar 1999 21:35:39 -0600 (CST)
Subject: Conference on Differential Equations and Computational Simulations


how to apply etc will be posted on the conference web page
very soon. Application Deadline: April 16, 1999.
Contact person: J.Zhu (

Second Announcement and Call for Papers
MAY 21-22, 1999
Mississippi State University

Organized by: Department of Mathematics and Statistics and NSF Engineering
Research Center
Co-Sponsor: Electronic Journal of Differential Equations

Principal Speakers:
Lawrence C. Evans, University of California, Berkley
Charbel Farhat, University of Colorado, Boulder
Irene Fonseca, Carnegie Mellon University
Ahmed Noor, University of Virginia
James Serrin, University of Minnesota
Paul Waltman, Emory University
Mary Wheeler, University of Texas, Austin

This interdisciplinary conference will provide a joint forum where
mathematicians, scientists, and engineers from academia and industry can
exchange research ideas involving theoretical and applied developments in
differential equations and computational simulations. In addition to the
seven principal lectures, there will be sessions of contributed talks. This
conference is held bi-annually. Reviewed manuscripts will be published as
a special issue of the Electronic Journal of Differential Equations.

Abstracts for contributed papers should be submitted no later than March 31.
and should be done on-line at the conference web. In the event that it is
not possible to do it through the web, contact Dr. Jianping Zhu (Program
Chair) at

For further information on the conference organization, program, and
travel/registration funding possibilities for graduate students & recent
Ph.D.s via a National Science Foundation grant visit the conference webpage at

Conference organizers:

Ratnasingham Shivaji Bharat Soni
Department of Mathematics & Statistics NSF Engineering Research Center
Mississippi State, MS 39762, USA. Mississippi State, MS 39762, USA.
Phone:601-325-3414/7142 Phone:601-325-8278
Fax:601-325-0005 Fax:601-325-7692


From: Osman Yasar <>
Date: Thu, 18 Mar 1999 12:29:31 -0500
Subject: High Performance Computing Users Group


High Performance Computing Users (HPCU) Group
Annual Conference, HPCU '99, August 17-21
SUNY-Stony Brook, Long Island-New York

Conference General Areas:
New Trends in High Performance Computing
Vendor-Independent Issues in Hardware and Software
Computational Science Education

Innovative Architectures
Uniform software environment and standards
Clusters: hardware and software
Computational Science Education Programs
Communication Networks
Parallel Algorithms
Computational Fluid Dynamics
Computational Physics, Chemistry, Biology
Computational finance
Molecular dynamics
Computational Combustion
Weather and Climate Modeling
Transportation Systems

Extended Abstracts 05/05
Acceptance Announcement 06/20
Paper Submission 08/01

General Chairs:
Osman Yasar (Chair, HPC Users Group)
Mike Leuze (Chair, Intel SUG)

Conference Chair:
Prof. Yuefan Deng
State University of New York-Stony Brook

Brookhaven National Laboratory
Center for Data-Intensive Computing

Program Chair:
Robert E. Tuzun, State University of New York
Brockport, NY

Local Organizers:
Xiaolin Li, State University of New York, Stony Brook
W. Brent Lindquist, SUNY-Stony Brook

Advisory Committee:
Osman Yasar, State University of New York
Geoffrey Fox, Syracuse University
Jack Dongarra, Oak Ridge National Laboratory/UT-Knoxville
Yuefan Deng, State University of New York
Mike Leuze, Oak Ridge National Laboratory
Gary Lamont, Air Force Institute of Technology
Anil Deane, NASA Goddard Space Center
James Glimm, SUNY-Stony Brook/CDIC Brookhaven Nat'l Lab
Cherri Pancake, Oregon State UNiversity
Bruce Hendrickson, Sandia National Laboratories
Glen Hensen, Los Alamos National Laboratory
Phil Lankford, Chase Manhattan Bank
Sally Haerer, National Center for Atmospheric Research

For more detailed information about this conference, please
visit HPCU web site at
Abstract collection and review will be done electronically.
Please refer to HPCU web pages for instructions.


From: Michelle Hein <>
Date: Thu, 18 Mar 1999 14:39:42 -0500
Subject: Industrial Mathematics Modeling Workshop

1999 Industrial Mathematics Modeling Workshop for
Graduate Students
July 26-August 3, 1999
Center for Research in Scientific Computation
North Carolina State University


* Expose 36 graduate students in mathematics to challenging
and exciting real-world problems arising in industrial
and government laboratory research
* Introduce students to the team approach to problem solving


In the Workshop, which will be the fifth one to be held at North
Carolina State University, the students will be divided into six-member
teams to collaborate on "industrial mathematics" problems presented by
scientists from industry and government laboratories. These problems are
not academic exercises found in classrooms, but rather challenging,
real-world problems from industry or applied science which require fresh
new insight for their formulation and solution. As in the previous workshops,
we expect to have one problem presenter from the National Security Agency.
Other problems will be drawn from projects under investigation by
Aerospace Corporation, Battelle Memorial Institute, the Chemical Industry
Institute of Toxicology (CIIT), Jenike and Johanson and Michelin North
America. Details regarding problems investigated in previous years can be
found at the web address listed below.


Pierre Gremaud, North Carolina State University
Zhilin Li, North Carolina State University
Ralph Smith, North Carolina State University
Hien Tran, North Carolina State University


Graduate students in mathematics, applied mathematics, or statistics
can be nominated for this program through a letter of recommendation from
a faculty member. In addition, the student is required to send a copy of
a recent transcript. The deadline for application is April 15, 1999 and
successful applicants will be notified by May 1, 1999. The Workshop will
cover all local living expenses and will provide partial support for travel
to all U.S. citizens and permanent residents (subject to available funding).
Previous workshops have been funded by the National Security Agency. In
addition, supplemental funding for the 1997-1998 Workshops was provided by
the National Science Foundation.

Completed applications or inquiries concerning this Workshop should be
submitted to:

Ralph Smith
Center for Research in Scientific Computation
Box 8205
North Carolina State University
Raleigh, NC 27695-8205
Telephone: (919) 515-7552
Fax: (919) 515-1636


From: Sparse 99 <>
Date: Thu, 18 Mar 1999 15:55:58 -0600 (CST)
Subject: Conference on Sparse Matrices

Symposium reminder and travel support announcement

International Conference on Preconditioning Techniques for
Large Sparse Matrix Problems in Industrial Applications
June 10-12, 1999
Hubert H. Humphrey Center
Minneapolis, Minnesota

sponsored by the University of Minnesota Supercomputing
Institute and the University of Waterloo

in cooperation with the SIAM Linear Algebra Group

with support from the Lawrence Livermore National Laboratory
Center for Applied Scientific Computing


This conference will address complex issues related to the
solution of general sparse linear systems of equations in
real applications, or specifically in an industrial setting.
It is often observed that the issues of interest to
industrial users of linear systems solution software are
fairly different from those the academic community is
focussed on. In an industrial context, improving robustness
is more important than finding a method to gain speed. Memory
usage is also an important consideration seldom accounted for
in academic research on sparse solvers. Finally, linear
systems solved in applications are almost always part of some
nonlinear iteration (e.g., Newton) or optimization loop, and
it is important to consider the coupling between the linear
and nonlinear parts instead of focussing on the linear system

Invited speakers

Raymond Honfu Chan, Chinese University of Hong Kong, Hong Kong
"Preconditioning Techniques for Toeplitz Systems and their Applications in
High-Resolution Image Reconstruction"

Edmond Chow, Lawrence Livermore National Laboratory
"Parallel Preconditioning for Multiphysics Simulations with Sliding

Howard C. Elman, University of Maryland
"The Schur Complement and Preconditioners for Saddle Point Problems"

Charbel Farhat, University of Colorado at Boulder
"Recent Advances in the FETI Method for Structural Mechanics and Acoustic
Scattering Problems"

Peter A. Forsyth, University of Waterloo, Canada
"Iterative Methods for Multi-factor Option Pricing"

David Keyes, NASA Langley Research Center
"Newton-Krylov Methods with Multilevel Preconditioning: Algorithm-
Architecture Trade-offs in the Number of Levels"

John G. Lewis and Daniel J. Pierce, Boeing Computer Services
"Iterative Solution of Sparse Symmetric Linear Systems from Interior Point

Maya Neytcheva, University of Nijimegen, The Netherlands
"Fully Parallel Interface Domain Decomposition Method for Finite Element
Elliptic Problems"

Willy H.A. Schilders, Philips Research Laboratories, The Netherlands and
Henk A. van der Vorst, Utrecht University, The Netherlands
"Preconditioning Techniques for Indefinite Linear Systems with
Applications to Circuit Simulation"

Justin Wan, Stanford University
"Interface Preserving Coarsening and Energy-Minimizing Interpolation
Multigrid Methods for Discontinuous Coefficient PDEs"

More information

More information is available on the World Wide Web at:

or by contacting the conference administrator, Michael Olesen, at or (612) 624-1356.


From: Jacques Liandrat <>
Date: Fri, 19 Mar 1999 15:01:39 GMT
Subject: Summer School on Multiscale Approaches for PDE

Multiscale approaches for partial differential
Marseilles, France, May 31- June 12 1999


Multiscale approaches are widely developped in various domains related to
partial differential equations such as functional analysis, numerical
analysis or numerical algorithms.

The School should provide a global presentation of
the different approaches, allowing interactions and comparisons between them.
One of the main goal of the School is to emphasize the connections between
theory and application in the approximation of partial differential equations.

A first session of this Summer School has been organised in June 1998.

Preliminary Program:

The school will be organized in the form of lectures, computer sessions
and seminars.

The main topics of the school will be:

1) Functional spaces and non-linear approximation
2) Wavelets, approximation and numerical algorithms
3) Preconditionning, Multigrid methods and domain decomposition techniques
4) Spectral methods, Incremental Unknowns and non-linear Galerkin methods
5) Multilevel methods and conservation laws
6) Implementation on computers

The lecturers will be:

Silvia BERTOLUZZA (CNR, University of Pavia, Pavia (Italy))
Albert COHEN (University Pierre et Marie Curie, Paris (France))
Rosa DONAT (University of Valencia, Valencia (Spain))
Thierry DUBOIS, Francois BOUCHON (University Blaise Pascal,
Clermont Ferrand (France))
Angela KUNOTH (IGPM, Aachen (Germany))
Jacques LIANDRAT (ESM2/IRPHE, Marseille (France))
Stanislas MIKA (University of west Bohemia, Pilsen, (Czech Republic))
Alain MIRANVILLE (University of Poitiers, Poitiers (france))

The computer session organisers will be:

Paca ARANDIGA (University of Valencia, Valencia (Spain))
Guillaume CHIAVASSA (University of Valencia, Valencia (Spain))

Registration forms and general informations are available from:


J. Liandrat
Universite d'Aix-Marseille II,
IMT, Technopole de Chateau-Gombert,
13451 Marseille Cedex 20, France


From: Gareth Shaw <>
Date: Fri, 19 Mar 1999 16:35:34 +0000 (GMT)
Subject: A Fastflo Training Course

A Fastflo Training Course

13th April 1999
At the NAG Ltd office, Oxford, UK

The Numerical Algorithms Group Ltd (NAG) are running a free one-day
course in the use of Fastflo, a Finite Element solver for partial
differential equations. Fastflo uses unstructured meshes, and so
handles general boundaries in two and three dimensions. It has its
own macro-language for the description and solution of problems,
and has been extensively used for the development of advanced
algorithms in computational fluid dynamics. It is equally applicable
to problems in heat transfer, combustion, porous media flows and even
stress analysis. For further details of Fastflo see:


To register for this course please contact Frances Iles by email on or on 01865 511 245. Registration also entitles
you to a free trial of the software, or an extension of your existing
trial license.


From: Lothar Reichel <>
Date: Sat, 20 Mar 1999 19:06:11 -0500 (EST)
Subject: Conference Honoring Richard Varga


a conference on the occasion of
Richard S. Varga's 70th birthday

The meeting will take place at Kent State University on March 25-27, 1999,
and will focus on the many research areas in which Richard Varga has made
important contributions. The conference will provide an opportunity for
researchers in these different yet related areas to exchange ideas. The
conference program and other information about the meeting is available
at the web site


From: VCV Rao <>
Date: Sun, 21 Mar 1999 19:35:09 +0530 (IST)
Subject: Workshop on Parallel Computing, Algorithms and Applications

A workshop on
Parallel Computing - Algorithms and Applications (PCAA-99)
Jun 21- 25, 1999
National PARAM SuperComputing Facility (NPSF),
Center for Development of Advanced Computing (CDAC), Pune, INDIA

organized by
Center for Development of Advanced Computing (CDAC), Pune, INDIA

OBJECTIVES : The objective of the workshop is to promote parallel computing
in various Universities/Research organizations. Hands on sessions have been
to explain practical aspects of parallel computing. Invited lectures on designed
real life scientific applications have also been arranged. It is meant for
beginners as well as advanced level users of parallel computers. In addition,
the workshop will offer invited presentations on various applications
and hands on session on PARAM 10000, India's largest parallel computing
system. PARAM 10000 is a 100GF parallel computer developed by C-DAC and it
it has 40 compute nodes (quad Ultra processor, SMP) and 4 server nodes.

TOPICS COVERED : Introduction, models of parallel computers, scalability
and performance studies, principles of message passing programming,
principles of parallel algorithm and design, dense/sparse matrix computations,
fast fourier transformations, sorting, search algorithms, graph partitioning
techniques, graph coloring algorithms, libraries and tools. Lectures on
scientific and engineering applications will be delivered by experts from
research organizations and academic institutes. Some of these applications
will also be demonstrated on PARAM 10000 to the participants.

HANDS-ON SESSION : There will be two and half hours Hands on Session
on each day which will focus on writing MPI program for numerical
and non-numerical algorithms

REGISTRATION FEE : Rs. 5000/- per participant and Rs. 4000/- for every
additional participant from the same organization. US $250 per foreign
participant and US $200 for every additional participant from the same
organization. The registration fees include workshop proceedings, lunch,
dinner, refreshments, and Hands on Session. Students, research scholars,
and faculty members from Indian Universities are required to pay
registration fee only Rs. 3,000/ per participant and this registration
fee does not include participation in the Hands on Session.

The payment is to be made by cash or cheque/demand draft drawn
in fabour of PCAA-99 at Pune, India. The general information on the
program and registgration form can be found at URL


ACCOMODATION : Limited guest house accomodation facility may be available
to participants. Guest house accomodation, at participants cost, can be
provided subjected to availability upon special request.

CONTACT ADDRESS : Dr. VCV. Rao, Workshop Coordinator,
Center for Development of Advanced Computing (CDAC),
Pune University Campus, Ganesh Khind Road
Pune 411 007, Maharastra, INDIA
Phone : +091-20-377402, Fax : +091-20-379311/357551
email :


From: Tzon-Tzer Lu <>
Date: Fri, 19 Mar 1999 16:39:13 +0800
Subject: Position at National Sun Yat-sen University

Employment Opportunity for National Sun Yat-sen University

Institution/Company: National Sun Yat-sen University
Department: Department of Applied Mathematics
Employer Type(s): Academic
Position Type(s): Tenure or Tenure-Track Faculty
Mathematical Area(s): Computational Mathematics
Geographic Location of Position: Kaohsiung, Taiwan

Position Description:
The Department of Applied Mathematics in National Sun Yat-sen
University invites applications for up to 3 faculty openings starting
from Fall, 1999, at the ranks of Assistant, Associate or Full
professors. Our department offers B.Sc, M.Sc. and Ph.D. degree
programs. Candidates must have a Ph.D. in mathematics or
statistics before August 1999. It is a policy of the University
that successful candidates must have some published journal
papers. The ability to teach in Chinese Mandarin is also
essential. Applicants should send a letter of application,
curriculum vitae, transcripts, research summary, re/pre-prints of
publications, and also arrange to have three letters of
recommendation to be sent to Professor Ngai-Ching WONG
Co-ordinator of Searching committee Department of Applied
Mathematics National Sun Yat-sen University Kaohsiung, 80424,
Taiwan, R.O.C. Fax no.:
886-7-5253809. Tel: 886-7-5252000 ext. 3818. Applicants
should turn in their application as soon as possible in order to be
considered this semester.

For more information about the position or institution/company:


From: Francoise Chatelin <>
Date: Fri, 19 Mar 1999 09:58:01 +0100 (MET)
Subject: Postdoctoral Position at CERFACS

Qualitative Computing Group

A one-year post-doc research position is open at CERFACS in the
Qualitative Computing Group, whose main research activities are
- study of the stability and the reliability of numerical methods,
specifically in the neighbourhood of singularities,
- design of robust codes for computing some eigenelements of very large
and nonnormal matrices (Arnoldi Tchebycheff method),
- influence of high nonnormality on reliability of numerical methods,
- software tools for assessing the quality (reliability, robustness) of
numerical methods.
This Group is part of the Parallel Algorithms Project lead by Iain Duff.

The successful candidate is expected to have strong interest, background
and experience in scientific computing, numerical analysis and possibly
functional analysis. He/She will work on one or several aspects of the
different algorithmic behaviour in exact arithmetic and in finite

Starting date is October 1, 1999, at the latest.

For detailed information about CERFACS
URL address :
For more information about Toulouse, the city where CERFACS is located
URL address :

The CERFACS recruitment procedure is described at the URL address:
Send the application to Mme Campassens at CERFACS. For any scientific
question regarding this position, please send email to
Prof. Chaitin-Chatelin (


From: Vladik Kreinovich <>
Date: Sun, 14 Mar 99 22:43:51 MST
Subject: Contents, Reliable Computing

Contents of Reliable Computing, 1999, Vol. 5, No. 1:

Efficient Control of the Dependency Problem Based on Taylor Model
Kyoko Makino and Martin Berz

New Methods for High-Dimensional Verified Quadrature
Martin Berz and Kyoko Makino

Solving Underdetermined Systems with Interval Methods
Zhang Danqing, Li Weiguo and Shen Zuhe

Representing Knowledge within the Situation Calculus Using
Interval-Valued Epistemic Fluents
John Funge

How to Guarantee Finite Termination of Verifying Global Optimization
Gerhard Heindl

Expression Templates for Dot Product Expressions
Michael Lerch and J\"urgen Wolff von Gudenberg

Error Estimation for Indirect Measurements: Interval Computation Problem
Is (Slightly) Harder Than a Similar Probabilistic Computational Problem
Olga Kosheleva Vladik Kreinovich


From: Heinz Engl <>
Date: Fri, 19 Mar 1999 10:33:13 +0100
Subject: Contents, Surveys on Mathematics for Industry

Surveys on Mathematics for Industry, Vol.8,2 (1999)
Table of Contents

M.Guenther, U. Feldmann: CAD-based electric-circuit modeling
in industry:
- Part 1: Mathematical structure and index of network equations: 97-130
- Part 2: Impact of circuit configurations and parameter: 131-157

Heinz W. Engl, Linz, Austria


End of NA Digest