Iteration Methods for Linear Systems with Positive Definite Matrix

Telecommunication Computing Electronics and Control

Iteration Methods for Linear Systems with Positive Definite Matrix

Abstract

Two classical first order iteration methods, Richardson iteration and HSS iteration for linear systems with positive definite matrix, are demonstrated. Theoretical analyses and computational results show that the HSS iteration has the advantages of fast convergence speed, high computation efficiency, and without requirement of symmetry.

Discover Our Library

Embark on a journey through our expansive collection of articles and let curiosity lead your path to innovation.

Explore Now
Library 3D Ilustration