On some extensions of the accelerated overrelaxation (AOR) theory.
A modification of the Nekrassov method for finding a solution of a linear system of algebraic equations is given and a numerical example is shown.* This paper is partly supported by project IS–M–4 of Department for Scientific Research, Paisii Hilendarski University of Plovdiv.
The paper is concerned with the iterative solution of sparse linear algebraic systems by the Stone incomplete factorization. For the sake of clarity, the algorithm of the Stone incomplete factorization is described and, moreover, some properties of the method are derived in the paper. The conclusion is devoted to a series of numerical experiments focused on the choice of iteration parameters in the Stone method. The model problem considered showe that we can, in general, choose appropriate values...
Many iterative methods for the solution of linear discrete ill-posed problems with a large matrix require the computed approximate solutions to be orthogonal to the null space of the matrix. We show that when the desired solution is not smooth, it may be possible to determine meaningful approximate solutions with less computational work by not imposing this orthogonality condition.