Please look at my parallel program gsp.pas inside the zip file, compile and execute it. And please take a look at my article on my Parallel Gauss-Seidel with relaxation algorithm: The benchmarks here. For example the direct method of the Gauss algorithm takes O(n^2) in the forward elimination process and is dominated by the O(n^3) back substitution process, that means, if for example an operation takes 10^9 second and we have 1000 equations, the elimination process in the Gauss algorithm will takes 0.7 second, but if we have 10000 equations in the system, the elimination process in the Gauss algorithm will take 11 minutes! This is why i have develloped for you the Parallel Gauss-Seidel with relaxation iterative algorithm in Object Pascal, that is very fast. Hello, Description: The Parallel iterative with relaxation method that i programmed here is designed to be used to solve large sparse systems of linear equations where the direct methods can exceed available machine memory and/or be extremely time-consuming.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |