A new class of modified line-SOR algorithms (Q5939864): 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: Line Iterative Methods for Cyclically Reduced Discrete Convection-Diffusion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On numerical analysis of conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the Optimum Relaxation Factors in Partial Factorization Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sigma-Sor Algorithm and the Optimal Strategy for the Utilization of the Sor Iterative Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative splitting theory / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 18:40, 3 June 2024

scientific article; zbMATH DE number 1623348
Language Label Description Also known as
English
A new class of modified line-SOR algorithms
scientific article; zbMATH DE number 1623348

    Statements

    A new class of modified line-SOR algorithms (English)
    0 references
    5 February 2002
    0 references
    The paper presents modified versions of the line-successive overrelaxation (SOR) method, firstly proposed in \textit{R. S. Varga} [Matrix iterative analysis, Prentice-Hall (Englewood Cliffs, NJ) (1963; Zbl 0133.08602)] and developed and extended by \textit{Z. I. Woźnicki} [Math. Comput. 62, No. 206, 619-644 (1994; Zbl 0802.65036)]. For these new algorithms, convergence results are proved and an algorithm for determining the optimal value of the modified line-SOR relaxation parameter is described. The authors also present numerical experiments with the modified algorithms on some classes of elliptic boundary value problems, discretized by finite-differences methods on rectangular, hexagonal and triangular mesh structures.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    successive overrelaxation
    0 references
    sparse matrices
    0 references
    convergence
    0 references
    line SOR algorithms
    0 references
    relaxation parameter
    0 references
    comparison
    0 references
    numerical experiments
    0 references
    elliptic boundary value problems
    0 references
    finite-differences methods
    0 references