๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A projection method of the cimmino type for linear algebraic systems

โœ Scribed by Fridrich Sloboda


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
283 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

โœฆ Synopsis


Sloboda, F. A projection method the Cimmino type for linear algebraic systems, Parallel Computing 17 (1991) 435-442.

A projection method of the Cimmino type for the minimum norm solution of a system of linear algebraic equations Ax = b, where A is an m x n matrix, m ~< n and rank(A) = m and where b ~ R(A) the range of A is described_ The algorithm converges provided certain practical estimations of the dominance of AA T hold. It is shown that a = 1 is the optimal step-size choice for systems with AA T k-diagonally dominant matrix with k >1 1. The algorithm in these cases converges fast also when A is not diagonally dominant. The algorithm, owing to its natural parallelism, is effectively implementable on vector computers such as CRAY-1 and CYBER 205 and on multiprocessors systems such as CRAY X-MP/48 and ALLIANT FX/80.


๐Ÿ“œ SIMILAR VOLUMES


A projection method for semidefinite lin
โœ Tommy Elfving ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 234 KB

We study the solution of consistent, semidefinite and symmetric linear systems by iterative techniques. Given a finite sequence of subspaces a block-iterative projection type algorithm is considered. For two specific choices of iteration parameters we show convergence. We apply our results to over a