We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that interior solution set is nonempty and certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works in this area, which require divergent series overrelaxations, our approach allows us consider some summable serie...

Solving dense linear systems of equations is quite time consuming and requires an efficient parallel implementation on powerful supercomputers. Du, Zheng Wang presented some new iterative methods for [Journal Applied Analysis Computation, 2011, 1(3): 351-360]. This paper shows that their are suitable solving system equations, compared with the classical Jacobi Gauss-Seidel methods.

in this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. this approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. the method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...

This paper gives a new approach to decoding Hermite codes using the key equation, avoiding the use of majority voting. Our approach corrects up to (dmin − 1)/2 errors, and works up to some extent also beyond. We present an efficient implementation of our algorithm based on a Sugiyamatype iterative procedure for computing solutions of a key equation.