Paper Info
Title
Refining and verifying the solution of a linear system
Abstract
The problem considered here is to refine an approximate, numerical, solution of a linear system and simultaneously give 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. A new algorithm is given, which has been designed with these desirable properties in mind. It is based on iterative refinement for accuracy, with well-chosen computing precisions, and uses interval arithmetic for verification.
Year
DOI
Venue
2011
10.1145/2331684.2331711
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Keywords
DocType
Citations 
approximate solution,verification step,iterative refinement,desirable property,linear system,actual implementation,well-chosen computing precision,new algorithm,interval arithmetic,accuracy,numerical linear algebra,floating point arithmetic,scientific computing,precision
Conference
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Hong Diep Nguyen11388.93
Nathalie Revol210315.29