Optimization of the relaxation parameter for S. S. O. R. and A. D. I. preconditioning (Q5961060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1014876410019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1655476355 / rank
 
Normal rank

Latest revision as of 08:40, 30 July 2024

scientific article; zbMATH DE number 1732220
Language Label Description Also known as
English
Optimization of the relaxation parameter for S. S. O. R. and A. D. I. preconditioning
scientific article; zbMATH DE number 1732220

    Statements

    Optimization of the relaxation parameter for S. S. O. R. and A. D. I. preconditioning (English)
    0 references
    0 references
    0 references
    23 April 2002
    0 references
    The authors present and compare three different approaches for an optimization of the relaxation parameters both for symmetric successive overrelaxation (SSOR) and alternating directions implicit (ADI) basic iteration and the preconditioned conjugate gradient method. A description of the SSOR and ADI basic iterative methods viewed as a relaxation algorithm and as a preconditioned Richardson's type algorithm can be found in this paper. The detailed link between estimates of the spectral radius of the iteration matrix and the condition number of the preconditioning matrix, which is given in the paper, allows to choose the best approach in order to obtain the optimal relaxation parameter and the corresponding optimal estimates in different situations.
    0 references
    optimal relaxation parameters
    0 references
    ADI
    0 references
    SSOR
    0 references
    iterative methods
    0 references
    preconditioning
    0 references
    conjugate gradientjugate gradient method
    0 references
    symmetric successive overrelaxation
    0 references
    alternating directions implicit
    0 references
    Richardson's type algorithm
    0 references
    condition number
    0 references

    Identifiers