Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 95
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by:
Paper 60
A Simultaneous Solution for General Linear Equations with Subspace Decomposition G. Molnárka and N. Varjasi
Department of Information Technology, Széchenyi István University, Gyor, Hungary , "A Simultaneous Solution for General Linear Equations with Subspace Decomposition", in , (Editors), "Proceedings of the Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 60, 2011. doi:10.4203/ccp.95.60
Keywords: parallel programming, linear equation, cluster computing, iterative method, LU decomposition.
Summary
HREF="#molnarka:3">3] are made. It was found, that the approach presented could be more efficient in a parallel environment than the classical methods. Moreover some peculiar speed up effects were observed.
The main feature of the algorithms presented is that for large ill-conditioned linear systems of equations, the algorithm works with a relative fast convergence speed. The algorithm is based on a residual minimisation technique [4,5] working with subspaces both for residuals and the original linear spaces. The structure of the parallel algorithm is a master-worker type [6] and the algorithm has some genetic features [7]. Computer tests have confirmed the theoretical results. The parallel implementation realized shows much better efficiency than any sequential one. Considerable speed-up effects were obtained using a parallel computer. The computer tests were obtained both in parallel and cluster computing environments. The goal of creating these algorithms is to provide an efficient parallel method for general large ill-conditioned linear systems of equations. Therefore it is a useful method for several practical and realistic problems such as optimization, finite element methods, control or simulation problems etc. even if it leads to generally large, dense ill-conditioned linear systems of equations. We have to note that the parallel algorithm proposed can easily be adjusted to the large scale of different parallel architectures, such as distributed and heterogeneous clusters or supercomputers. The test with more effective algorithms and new topological architectures will be the subject of forthcoming work. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|