Comparative analysis of Jacobi and Gauss-Seidel iterative methods

07/19/2023
by   Pavel Khrapov, et al.
0

The paper presents a comparative analysis of iterative numerical methods of Jacobi and Gauss-Seidel for solving systems of linear algebraic equations (SLAEs) with complex and real matrices. The ranges of convergence for both methods for SLAEs in two and three unknowns, as well as the interrelationships of these ranges are obtained. An algorithm for determining the convergence of methods for SLAEs using the complex analog of the Hurwitz criterion is constructed, the realization of this algorithm in Python in the case of SLAEs in three unknowns is given. A statistical comparison of the convergence of both methods for SLAEs with a real matrices and the number of unknowns from two to five is carried out.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2020

Preconditioned MHSS iterative algorithm and its accelerated method for solving complex Sylvester matrix equations

This paper introduces and analyzes a preconditioned modified of the Herm...
research
05/31/2023

Kaczmarz-Type Methods for Solving Matrix Equations

In this paper, several Kaczmarz-type numerical methods for solving the m...
research
01/01/2022

Challenges of sampling and how phylogenetic comparative methods help: With a case study of the Pama-Nyungan laminal contrast

Phylogenetic comparative methods are new in our field and are shrouded, ...
research
01/08/2020

A quadratically convergent iterative scheme for locating conical degeneracies in the spectra of parametric self-adjoint matrices

A simple iterative scheme is proposed for locating the parameter values ...
research
01/24/2019

Convergent Dynamics for Solving the TAP Equations of Ising Models with Arbitrary Rotation Invariant Coupling Matrices

We propose an iterative algorithm for solving the Thouless-Anderson-Palm...
research
09/17/2020

Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second Order Recurrence Formula

In this paper, we investigate the convergence speed of the Arimoto-Blahu...
research
12/11/2020

The Complexity of Comparative Text Analysis – "The Gardener is always the Murderer" says the Fourth Machine

There is a heated debate about how far computers can map the complexity ...

Please sign up or login with your details

Forgot password? Click here to reset