An iterative method applied to nonsymmetric linear systems (Q1922227): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Relaxation Methods for Non-Hermitian Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Accelerated Overrelaxation (AOR) Method for Systems with Positive Definite Coefficient Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sharpness of some upper bounds for the spectral radii of S.O.R. iteration matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a relaxed SOR-method applied to nonsymmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Different Splittings and the Associated Iteration Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403637 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 24 May 2024

scientific article
Language Label Description Also known as
English
An iterative method applied to nonsymmetric linear systems
scientific article

    Statements

    An iterative method applied to nonsymmetric linear systems (English)
    0 references
    0 references
    0 references
    0 references
    24 February 1997
    0 references
    A two-stage Gauss-Seidel method for solving systems of linear equations with coefficient matrices being the identity plus a skew-symmetric part is reported. The most popular in this case, the extrapolated iterative methods, need an estimation of the optimum extrapolation parameter, which is often a difficult part of the problem. The iterative method proposed in this paper works without a parameter estimation. The idea is to apply two times the classical Gauss-Seidel method. The convergence theorems for this two-stage Gauss-Seidel method are proven. Two numerical examples are added to present the behaviour of the new algorithm. The results show that the number of iterations needed of the two-stage Gauss-Seidel method is quite smaller than of the classical variant and does not depend on the order of the coefficient matrix.
    0 references
    extrapolation methods
    0 references
    Gauss-Seidel method
    0 references
    extrapolated iterative methods
    0 references
    parameter estimation
    0 references
    convergence
    0 references
    numerical examples
    0 references

    Identifiers