Displaying similar documents to “New SOR-like methods for solving the Sylvester equation”

Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations

Zahari Zlatev, Krassimir Georgiev (2013)

Open Mathematics

Similarity:

Many problems arising in different fields of science and engineering can be reduced, by applying some appropriate discretization, either to a system of linear algebraic equations or to a sequence of such systems. The solution of a system of linear algebraic equations is very often the most time-consuming part of the computational process during the treatment of the original problem, because these systems can be very large (containing up to many millions of equations). It is, therefore,...

Using successive approximations for improving the convergence of GMRES method

Jan Zítko (1998)

Applications of Mathematics

Similarity:

In this paper, our attention is concentrated on the GMRES method for the solution of the system ( I - T ) x = b of linear algebraic equations with a nonsymmetric matrix. We perform m pre-iterations y l + 1 = T y l + b before starting GMRES and put y m for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the m th powers of eigenvalues of the matrix T . Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and...

Influence of preconditioning and blocking on accuracy in solving Markovian models

Beata Bylina, Jarosław Bylina (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The article considers the effectiveness of various methods used to solve systems of linear equations (which emerge while modeling computer networks and systems with Markov chains) and the practical influence of the methods applied on accuracy. The paper considers some hybrids of both direct and iterative methods. Two varieties of the Gauss elimination will be considered as an example of direct methods: the LU factorization method and the WZ factorization method. The Gauss-Seidel iterative...

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