The Sassenfeld criterion revisited

01/14/2022
by   Thomas P. Wihler, et al.
0

The starting point of this article is a decades-old yet little-noticed sufficient condition, presented by Sassenfeld in 1951, for the convergence of the classical Gauss-Seidel method. The purpose of the present paper is to shed new light on Sassenfeld's criterion and to demonstrate that the original work can be perceived as a special case of a far more extensive concept in the context of preconditioners and iterative linear solvers. Our main result is a classification theorem for the set of all matrices which this general framework applies to.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

On a conjecture about a class of permutation quadrinomials

Very recently, Tu et al. presented a sufficient condition about (a_1,a_2...
research
11/08/2013

A new stopping criterion for the mean shift iterative algorithm

The mean shift iterative algorithm was proposed in 2006, for using the e...
research
01/01/2022

A new criterion for ℳ, 𝒩-adhesivity, with an application to hierarchical graphs

Adhesive categories provide an abstract framework for the algebraic appr...
research
01/30/2019

The Semialgebraic Orbit Problem

The Semialgebraic Orbit Problem is a fundamental reachability question t...
research
03/24/2021

Language learnability in the limit for general metrics: a Gold-Angluin result

In his pioneering work in the field of Inductive Inference, Gold (1967) ...
research
06/25/2021

The conjugate gradient algorithm on a general class of spiked covariance matrices

We consider the conjugate gradient algorithm applied to a general class ...
research
06/04/2018

Experimental Tests of Spirituality

We currently harness technologies that could shed new light on old philo...

Please sign up or login with your details

Forgot password? Click here to reset