English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The paper is concerned with variants of the successive overrelaxation method (SOR method) for solving the linear system Au = b. Necessary and sufficient conditions are given for the convergence of the symmetric and unsymmetric SOR methods when A is symmetric. The modified SOR, symmetric SOR, and unsymmetric SOR methods are also considered for systems of the form Diu, - CuU2 = bi, - CLU1 + D2u2 = b2 where DI and D2 are square diagonal matrices. Different values of the relaxation factor are used on each set of equations. It is shown that if the matrix corresponding to the Jacobi method of iteration has real eigenvalues and has spectral radius ji < 1, then the spectral radius of the matrix G associated with any of the methods is not less than that of the ordinary SOR method with w = 2(1 + (1 - TA2)112)-l. Moreover, if the eigenvalues of G are real then no improvement is possible by the use of semi-iterative methods. Introduction. In this paper we study convergence properties of several iterative methods for solving the linear system (1.1) Au- b, where A is a given real nonsingular N X N matrix with nonvanishing diagonal elements, b is a given column vector, and u is a column vector to be determined. Each method can be characterized by an equation

Convergence properties of the symmetric and unsymmetric successive overrelaxation methods and related methods