Additional Information
| Author(s) | Finta Bela |
|---|
The SOR method for infinite systems of linear equations (III)
Bela Finta
Abstract
carpathian_2006_22_049_055_abstractFull PDF
carpathian_2006_22_049_055In [3], [4] we presented the extension of the Jacobi and Gauss-Seidel iterative numerical method from the case of finite linear systems to the case of infinite systems. The purpose of this paper is to extend the classical SOR (successiv over relaxation) method, known for finite linear systems, to infinite systems.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration