Efficient algorithms for verified scientific computing: Numerical linear algebra using interval arithmetic - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Autre Publication Scientifique Année : 2011

Efficient algorithms for verified scientific computing: Numerical linear algebra using interval arithmetic

Hong Diep Nguyen
  • Fonction : Auteur
  • PersonId : 868508

Résumé

Interval arithmetic is a means to compute verified results. However, a naive use of interval arithmetic does not provide accurate enclosures of the exact results. Moreover, interval arithmetic computations can be time-consuming. We propose several accurate algorithms and efficient implementations in verified linear algebra using interval arithmetic. Two fundamental problems are addressed, namely the multiplication of interval matrices and the verification of a floating-point solution of a linear system. For the first problem, we propose two algorithms which offer new tradeoffs between speed and accuracy.For the second problem, which is the verification of the solution of a linear system, our main contributions are twofold. First, we introduce a relaxation technique, which reduces drastically the execution time of the algorithm. Second, we propose to use extended precision for few, well-chosen parts of the computations, to gain accuracy without losing much in term of execution time.
Fichier non déposé

Dates et versions

ensl-00560188 , version 1 (27-01-2011)

Identifiants

  • HAL Id : ensl-00560188 , version 1

Citer

Hong Diep Nguyen. Efficient algorithms for verified scientific computing: Numerical linear algebra using interval arithmetic. 2011. ⟨ensl-00560188⟩
80 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More