Günter   Mayer

A Survey on Properties and Algorithms for the Symmetric Solution Set

Preprint series:   Preprints aus dem Institut für Mathematik, Universität Rostock

MSC: 65G20   Algorithms with automatic result verification
  65G30   Interval and finite arithmetic

Abstract:   We give a survey on the symmetric solution set of linear systems of equations with perturbed input data starting with a description of its form and presenting several algorithms whose resulting interval vector encloses it. In particular, we derive the describing inequalities in a new way and represent them in a modified form as compared with a recent result by Hladík. This form enables us to improve a known upper bound for their number essentially. We thus end up with an Oettli-Prager like theorem for the symmetric solution set which we can prove by elementary means and completely different from Hladík's paper.

Keywords:   Interval analysis, linear system of equations with symmetric coefficient matrix, solution set, symmetric solution set, Oettli-Prager theorem, Oettli-Prager like theorem, Fourier-Motzkin elimination, interval Cholesky algorithm, incomplete interval Cholesky method, Jansson's method, Rohn's method, historical remarks.
Notes:   Dedicated to Professor Dr. Götz Alefeld on the occasion of his 70th birthday.

karin.martin@uni-rostock.de
Seite generiert am 15.02.2012,   09:10   Uhr