Previous Page 2

Displaying 21 – 29 of 29

Showing per page

Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids

Tijmen P. Collignon, Martin B. Van Gijzen (2010)

International Journal of Applied Mathematics and Computer Science

Efficient iterative solution of large linear systems on grid computers is a complex problem. The induced heterogeneity and volatile nature of the aggregated computational resources present numerous algorithmic challenges. This paper describes a case study regarding iterative solution of large sparse linear systems on grid computers within the software constraints of the grid middleware GridSolve and within the algorithmic constraints of preconditioned Conjugate Gradient (CG) type methods. We identify...

Two simple derivations of universal bounds for the C.B.S. inequality constant

Owe Axelsson, Radim Blaheta (2004)

Applications of Mathematics

Universal bounds for the constant in the strengthened Cauchy-Bunyakowski-Schwarz inequality for piecewise linear-linear and piecewise quadratic-linear finite element spaces in 2 space dimensions are derived. The bounds hold for arbitrary shaped triangles, or equivalently, arbitrary matrix coefficients for both the scalar diffusion problems and the elasticity theory equations.

Two step extrapolation and optimum choice of relaxation factor of the extrapolated S.O.R. method

Jan Zítko (1988)

Aplikace matematiky

Limits of the extrapolation coefficients are rational functions of several poles with the largest moduli of the resolvent operator R ( λ , T ) = ( λ I - T ) - 1 and therefore good estimates of these poles could be calculated from these coefficients. The calculation is very easy for the case of two coefficients and its practical effect in finite dimensional space is considerable. The results are used for acceleration of S.O.R. method.

Currently displaying 21 – 29 of 29

Previous Page 2