Rump, Siegfried M.Siegfried M.RumpOgita, TakeshiTakeshiOgita2021-02-192021-02-192006-02-17Journal of Computational and Applied Mathematics 199 (2): 199-206 (2007)http://hdl.handle.net/11420/8866Validated solution of a problem means to compute error bounds for a solution in finite precision. This includes the proof of existence of a solution. The computed error bounds are to be correct including all possible effects of rounding errors. The fastest known validation algorithm for the solution of a system of linear equations requires twice the computing time of a standard (purely) numerical algorithm. In this paper we present a super-fast validation algorithm for linear systems with symmetric positive definite matrix. This means that the entire computing time for the validation algorithm including computation of an approximated solution is the same as for a standard numerical algorithm. Numerical results are presented.en0377-042720062199206North-HollandINTLABSelf-validating methodsSparse linear systemsVerified error boundsInformatikJournal Article10.1016/j.cam.2005.07.038Journal Article