Comparison Theorems for Iterative Methods Based on Strong Splittings
- 1 February 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 24 (1) , 215-227
- https://doi.org/10.1137/0724018
Abstract
By means of strong splittings of an $n \times n$ interval M-matrix $\mathcal {A}$ one can construct iterative methods to enclose the solution set $\{ x\} : = \{ x|Ax = b,A \in A,b \in \mathfrak{b}\} $, where $\mathfrak{b}$ is an interval vector and $x \in \mathbb{R}^n $. We derive comparison theorems for an upper bound of the asymptotic convergence factor and for the fixpoints resulting from those methods.
Keywords
This publication has 4 references indexed in Scilit:
- Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositionsComputing, 1985
- New techniques for the analysis of linear interval equationsLinear Algebra and its Applications, 1984
- Comparisons of regular splittings of matricesNumerische Mathematik, 1984
- Topological proofs for certain theorems on matrices with non-negative elementsMonatshefte für Mathematik, 1958