NANADec 21, 2020

Zur iterativen Loesung von linearen Gleichungssystemen

arXiv:1301.24811.2h-index: 1
Originality Synthesis-oriented
AI Analysis

It addresses a fundamental limitation in numerical linear algebra for researchers and practitioners solving linear systems, but the method appears to be an incremental extension without concrete performance numbers.

The paper presents a method that guarantees convergence of fixed-point iterations for solving linear equation systems even when the spectral radius of the iteration matrix is not less than one, demonstrated through calculation examples.

It is well known that a fixed point iteration for solving a linear equation system converges if and only if the spectral radius of the iteration matrix is less than one. A method is presented which guarantees the Fixed Point, even if this condition is not ("spectral radius <1") fulfilled and demonstrated through calculation examples.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes