A modified version of Jacobi approach

Authors:
Bikash Kanti Sarkar;Shib Sankar Sana;P. K. Mahanti
Affiliations:
Department of Information Technology, Birla Institute of Technology, Mesra, Ranchi, India.;Department of Mathematics, Bhangar Mahavidyalaya, University of Calcutta, Bhangar-743502, 24PGS (South), West Bengal, India.;Department of Computer Science & Applied Statistics, University of New Burnswick, Saint Jhon, New Brunswick, E2L 4L5, Canada
Venue:
International Journal of Innovative Computing and Applications
Year:
2009

Citing 8
Cited 0

Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes

IEEE Transactions on Computers
Parallel algorithms for sparse linear systems

SIAM Review
Parallel computing (2nd ed.): theory and practice

Parallel computing (2nd ed.): theory and practice
Communication optimizations for irregular scientific computations on distributed memory architectures

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
A Class of Parallel Algorithms for Solving Large Sparse Linear Systems on Multiprocessors

HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Sparse Tiling for Stationary Iterative Methods

International Journal of High Performance Computing Applications
Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System

ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several well-known approaches exist to solve a set of linear equations. This short paper introduces a modified version of the existing sequential Jacobi iterative method. The prime contribution of the present investigation is that the variables which achieve smaller than the prescribed accuracy in the earlier iteration will not be updated further as before. Although these are updated in a simpler way to filter the non-converged variables, consequently, it reduces execution time to a great extent. Results demonstrate that the proposed approach outperforms the most of the linear sets.