On an accelerated overrelaxation iterative method for linear systems with strictly diagonally dominant matrix
On an accelerated overrelaxation iterative method for linear systems with strictly diagonally dominant matrix
We consider a linear system <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A x equals b"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mi>x</mml:mi> <mml:mo>=</mml:mo> <mml:mi>b</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">Ax = b</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of <italic>n</italic> simultaneous equations, where <italic>A</italic> is a strictly diagonally dominant matrix. We get bounds for the spectral radius of the matrix …