Refining and verifying efficiently the solution of a linear system

Nathalie Revol 1 Hong Diep Nguyen 1
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The problem considered in this talk is to solve and mainly to refine an approximate, numerical, solution of a linear system. The refinement step is computed simultaneously with an enclosure of the error between this approximate solution and the exact one: this is the verification step. Desirable properties for an algorithm solving this problem are accuracy of the results, complexity and performance of the actual implementation. In this talk, an algorithm is presented, which aims at satisfying these properties. It is based on the use of BLAS3 optimized routines for performances. It employs iterative refinement for accuracy, with well-chosen computing precisions, and it uses interval arithmetic for verification.
Type de document :
Communication dans un congrès
Dagstuhl Seminar 11371: Uncertainty modeling and analysis with intervals: Foundations, tools, applications, Sep 2011, Dagstuhl, Germany. 2011
Liste complète des métadonnées

https://hal.inria.fr/hal-00641669
Contributeur : Nathalie Revol <>
Soumis le : mercredi 16 novembre 2011 - 14:02:02
Dernière modification le : samedi 21 avril 2018 - 01:27:14

Identifiants

  • HAL Id : hal-00641669, version 1

Collections

Citation

Nathalie Revol, Hong Diep Nguyen. Refining and verifying efficiently the solution of a linear system. Dagstuhl Seminar 11371: Uncertainty modeling and analysis with intervals: Foundations, tools, applications, Sep 2011, Dagstuhl, Germany. 2011. 〈hal-00641669〉

Partager

Métriques

Consultations de la notice

165