Parallel algorithm for solving the system of simultaneous linear equations by Jacobi method on star graph
Summary :
Table of Contents
- Abstract
- Introduction
- Jacobi Method [10]
- The star graph
- Processor ordering
- Routing in the star graph
- Building Hamiltonian circuit and path
- The parallel algorithm
- The initialization phase
- The main phase
- Computation statistics
- Conclusion
- References
Abstract
The problem of solving the system of simultaneous linear equations with large number of unknowns often takes more time in unprocessed systems. Since parallel computing systems are now available, these can be solved exploiting the large processing power of the system. Thus we need an efficient parallel algorithm to solve the problem using parallel computing system. Many numerical techniques have been suggested for an exact solution like matrix inversion method, Gauss elimination method, Cramer method.
However, systems with large number of unknowns many iterative methods have been developed, where approximate solution with a tolerable accuracy is obtained starting with an initial approximation.
Latest in the category : Math
1
Parallel algorithm for solving the system of simultaneous linear equations by Jacobi method on star graph
Term papers | 10/08/2009 | en | .pdf | 4 pages
From the same author : Math
2
Modified locally delayed latching approach for data synchronization in GALS SOC's
Term papers | 10/08/2009 | en | .pdf | 5 pages
5
An application layer communication interface for a combat management system for naval ships
Term papers | 10/08/2009 | en | .pdf | 5 pages
Change Currency
Our guarantee :
How it works?
Quality guaranteed
Refunds
Secure payment
Who are we ?
