A floating-point technique for extending the available precision, Numerische Mathematik, vol.5, issue.3, pp.224-242, 1971. ,
DOI : 10.1007/BF01397083
Error bounds from extra-precise iterative refinement, ACM Transactions on Mathematical Software, vol.32, issue.2, pp.325-351, 2006. ,
DOI : 10.1145/1141885.1141894
Exploiting fast hardware floating point in high precision computation, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.111-118, 2003. ,
DOI : 10.1145/860854.860886
Iterative refinement for linear systems and LAPACK, Accuracy and Stability of Numerical Algorithms, pp.495-509, 1997. ,
DOI : 10.1093/imanum/17.4.495
Exploiting the Performance of 32 bit Floating Point Arithmetic in Obtaining 64 bit Accuracy (Revisiting Iterative Refinement for Linear Systems) -Article 113, Proc. ACM/IEEE conf. on Supercomputing, 2006. ,
SuperLU_DIST, ACM Transactions on Mathematical Software, vol.29, issue.2, pp.110-140, 2003. ,
DOI : 10.1145/779359.779361
Iterative Refinement in Floating Point, Journal of the ACM, vol.14, issue.2, pp.316-321, 1967. ,
DOI : 10.1145/321386.321394
Quasi double-precision in floating point addition, BIT, vol.7, issue.6, pp.37-50, 1965. ,
DOI : 10.1007/BF01975722
Interval analysis Methods and applications of interval analysis, SIAM Studies in Applied Mathematics, issue.11, 1966. ,
Interval Methods for Systems of Equations 13. , A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott Enclosure for Linear Interval Equations, Reliable Computing, vol.5, issue.2, pp.131-136, 1990. ,
DOI : 10.1023/A:1009997221089
Solving a linear system and certifying the solution, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00546856
Fast verification of solutions of matrix equations, Numerische Mathematik, vol.90, issue.4, pp.755-773, 2002. ,
DOI : 10.1007/s002110100310
A handbook of results on interval linear problems, 2005. ,
Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard, Handbook on Acuracy and Reliability in Scientific Computation ch. Computer-assisted Proofs and Self-validating Methods, pp.415-420, 1995. ,
DOI : 10.1137/S0895479893251198
Iterative refinement implies numerical stability for Gaussian elimination, Mathematics of Computation, vol.35, issue.151, pp.817-832, 1980. ,
DOI : 10.1090/S0025-5718-1980-0572859-4