Interval Systems -- Theory and Algorithms

Organizers:
G. Alefeld, Universität Karlsruhe, Germany
G. Mayer, Universität Rostock, Germany

Summary: If the coefficient matrix A of a linear system Ax=b is known to vary between A_1 and A_2 and correspondingly the right hand side between b_1 and b_2 one is interested in the set S of all possible solutions.

The minisymposium will focus on the description and on effective methods for the inclusion of S. A series of new results will be presented especially in the case of a symmetric matrix A.

Day: July 6, 1995 Time: 15.30

J. Rohn, Charles University, Czech Republic:
Solving linear interval equations

G. Heindl, Bergische Universität-GH Wuppertal, Germany:
Some inclusion results based on generalized versions of the Oettli-Prager-theorem

G. Mayer, Universität Rostock, Germany;
G. Alefeld, Universität Karlsruhe, Germany:
On the solution set of symmetric interval systems

C. Jansson, Technische Universität Hamburg-Harburg, Germany:
A verification algorithm for symmetric systems with interval data


Last modified: 2 June 1995
Imprint