Displaying similar documents to “A modification of minimal residual iterative method to solve linear systems.”

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

Similarity:

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.

Experiments with Krylov subspace methods on a massively parallel computer

Martin Hanke, Marlis Hochbruck, Wilhelm Niethammer (1993)

Applications of Mathematics

Similarity:

In this note, we compare some Krylov subspace iterative methods on the MASPAR, a massively parallel computer with 16K processors. In particular, we apply these methods to solve large sparse nonsymmetric linear systems arising from elliptic partial differential equations. The methods under consideration include conjugate gradient type methods, semiiterative methods, and a hybrid variant. Our numerical results show that, on the MASPAR, one should compare iterative methods rather on the...

Self-correcting iterative methods for computing 2 -inverses

Stanimirović, Predrag S. (2003)

Archivum Mathematicum

Similarity:

In this paper we construct a few iterative processes for computing { 2 } -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.

New SOR-like methods for solving the Sylvester equation

Jakub Kierzkowski (2015)

Open Mathematics

Similarity:

We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.

Fast multigrid solver

Petr Vaněk (1995)

Applications of Mathematics

Similarity:

In this paper a black-box solver based on combining the unknowns aggregation with smoothing is suggested. Convergence is improved by overcorrection. Numerical experiments demonstrate the efficiency.