The monotone convergence rate of the parallel nonlinear AOR method (Q1912855): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel nonlinear AOR method and its convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Nonlinear Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the parallel multisplitting AOR algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of relaxed parallel multisplitting methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular splittings and monotone iteration functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of parallel multisplitting iterative methods for M-matrices / rank
 
Normal rank

Latest revision as of 12:14, 24 May 2024

scientific article
Language Label Description Also known as
English
The monotone convergence rate of the parallel nonlinear AOR method
scientific article

    Statements

    The monotone convergence rate of the parallel nonlinear AOR method (English)
    0 references
    26 November 1996
    0 references
    Systems of nonlinear equations (1) \(Ax+ \varphi(x)= b\) are solved iteratively using a combination of an accelerated overrelaxation (AOR) and a multisplitting method. The resulting algorithm is called ``Parallel nonlinear AOR method'' by the author. In (1) \(A\) is a real nonsingular \(n\times n\) matrix, \(b\), \(x= (x_i)\in \mathbb{R}^n\) are vectors and \(\varphi= (\varphi_i): \mathbb{R}^n\to \mathbb{R}^n\) is a continuous, diagonal and isotone function where diagonal means that \(\varphi_i\) depends on \(x_i\) only. For \(M\)-matrices \(A\) conditions on the underlying splittings and on the AOR-parameters are listed for the sequence \(\{x^m\}\) of iterates to converge to the unique solution of (1). Moreover, a comparison result is proved and a numerical example is given.
    0 references
    0 references
    monotone convergence rate
    0 references
    systems of nonlinear equations
    0 references
    parallel computation
    0 references
    accelerated overrelaxation
    0 references
    multisplitting method
    0 references
    \(M\)-matrices
    0 references
    numerical example
    0 references
    0 references
    0 references
    0 references