Oishi, Shin’ichiShin’ichiOishiRump, Siegfried M.Siegfried M.Rump2021-04-272021-04-272002-02-01Numerische Mathematik 90 (4): 755-773 (2002-02-01)http://hdl.handle.net/11420/9381In this paper, we are concerned with a matrix equation Ax = b where A is an n × n real matrix and x and b are n-vectors. Assume that an approximate solution x is given together with an approximate LU decomposition. We will present fast algorithms for proving nonsingularity of A and for calculating rigorous error bounds for ∥A b - x̃∥ . The emphasis is on rigour of the bounds. The purpose of this paper is to propose different algorithms, the fastest with 2/3n flops computational cost for the verification step, the same as for the LU decomposition. The presented algorithms exclusively use library routines for LU decomposition and for all other matrix and vector operations. -1 3 ∞en0945-324520024755773SpringerInformatikMathematikJournal Article10.1007/s002110100310Other