Saturday, May 15

Possible Future Directions in Applications of Interval Computations

10:30 AM-12:30 PM
Room: Atlanta 3

In many scientific computing problems, it is desirable to get guaranteed estimates. For such problems, researchers have developed computational methods with automatic results verification (also known as "interval computations"). These methods have been successfully applied to many practical problems, but at present, they are not yet so widely applied as more traditional computational techniques. One of the possible ways to drastically increase the scope of verified methods is to combine them with more traditional techniques. In this minisymposium, the speakers describe how interval computations can be combined with traditional numerical techniques, with (probability-motivated) maximum entropy methods, and with geometric computations.

Organizers: Vladik Kreinovich and Scott A. Starks
University of Texas, El Paso

10:30-10:55 Numerical Accuracy of Fast Rational Interpolation Algorithms
Vadim Olshevsky, Georgia State University
11:00-11:25 Combining Maximum Entropy Approach and Interval Computations in Nonsmooth Optimization
Zhenyu Huang and Zuhe Shen, Nanjing University, People's Republic of China; Scott A. Starks and UpdatedVladkik Kreinovich, Organizers
11:30-11:55 Geometric Construction Problems with Interval Parameters: Algorithms and NP-Hardness Results
Núria Mata and Robert Joan-Arinyo, Universidad Politecnica de Catalunya, Barcelona, Spain
12:00-12:25 Adaptive Interval Algorithm for Nonlinear Singular Perturbation Problem
Guoqing Liu, Nanjing University of Chemical Technology, People's Republic of China

AN99 Home


Program Updates

Speaker Index




MMD, 3/26/99
tjf, 1/19/99