Fast verification of solutions for sparse monotone matrix equations

Authors Takeshi Ogita, Shin'ichi Oishi, Yasunori Ushiro

Publication date 29 September 2002

\(M\)-matrices inclusion of the solution interval arithmetic inverse monotone matrices result verification sparse matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Algorithms with automatic result verification (65G20) Interval and finite arithmetic (65G30)

Review text

A matrix \(A\) is called inverse monotone (here only monotone) if the matrix \(A^{-1}\) has nonnegative entries. Let \(e:=(1, 1, \ldots , 1)^T\) and \(\widetilde y\) be an approximation of the solution of \(Ay=e\), i.e. \(A\widetilde y -e=s\) and \(\|s\|_\infty <1\). Then the inverse monotonicity admits an inclusion of the solution of \(Ax=b\) that is based on the residue of a computed approximate solution. The results are generalizations of results for \(M\)-matrices. The arguments are from interval arithmetic. For the entire collection see [Zbl 0973.00063].

Recommendations

Cited in

(7)

This page was built for publication: Fast verification of solutions for sparse monotone matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765620)