On the convergence of the SAOR method and the error bounds for its acceleration (Q1112552): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David J. Evans / rank
Normal rank
 
Property / author
 
Property / author: Chang-jun Li / rank
Normal rank
 
Property / author
 
Property / author: David J. Evans / rank
 
Normal rank
Property / author
 
Property / author: Chang-jun Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(88)90002-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014824478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric accelerated overrelaxation (saor) method / 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: Three-part splittings and Varca's type extensions of the successive overrelaxation (SOR) theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Overrelaxation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Accelerated Overrelaxation Method in a Special Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of extrapolation in connection with the accelerated overrelaxation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-adaptive and adaptive SAOR-CG algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:11, 19 June 2024

scientific article
Language Label Description Also known as
English
On the convergence of the SAOR method and the error bounds for its acceleration
scientific article

    Statements

    On the convergence of the SAOR method and the error bounds for its acceleration (English)
    0 references
    1988
    0 references
    The symmetric accelerated overrelaxation (SAOR) method is an iterative method similar to the symmetric successive overrelaxation (SSOR) method, but it differs from that better known method in that it requires the use to choose two rather than one acceleration parameter. If the two parameters are equal, the SAOR method is the same as the SSOR method. In this paper, the authors develop a theory similar to the SSOR theory for the SAOR scheme. Among other matters, they consider the use of semi- iterative methods to accelerate the convergence.
    0 references
    error bounds
    0 references
    convergence acceleration
    0 references
    symmetric accelerated overrelaxation
    0 references
    symmetric successive overrelaxation
    0 references
    acceleration parameter
    0 references
    semi-iterative methods
    0 references
    0 references
    0 references

    Identifiers