Displaying 61 – 80 of 152

Showing per page

On the choice of iteration parameters in the Stone incomplete factorization

Karel Segeth (1983)

Aplikace matematiky

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...

On the choice of subspace for iterative methods for linear discrete ill-posed problems

Daniela Calvetti, Bryan Lewis, Lothar Reichel (2001)

International Journal of Applied Mathematics and Computer Science

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.

Currently displaying 61 – 80 of 152