Parallel Programming for Solving Linear BVP’s by Linear Superposition using CS_Tools

Section: Research Paper
Issue
Vol. 10 No. 1 (2013): Volume 10 Issue 1
Pages
29-42

Abstract

The objective of this paper is to speed the solution of linear Boundary Value Problem (LPVPs) by parallel Programming by using cs_tools where the solution methods is the linear superposition Algorithm.

Authors

Bashir Khalaf

College of Education, University of Mosul, Mosul, Iraq

Firas Saeed

College of Medicine, University of Mosul, Mosul, Iraq

Identifiers

DOI: 10.33899/csmj.2013.163422

Download this PDF file
PDF

Statistics

How to Cite

Parallel Programming for Solving Linear BVP’s by Linear Superposition using CS_Tools. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(1), 29-42. https://doi.org/10.33899/csmj.2013.163422
Copyright and Licensing
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Parallel Programming for Solving Linear BVP’s by Linear Superposition using CS_Tools. (2013). AL-Rafidain Journal of Computer Sciences and Mathematics, 10(1), 29-42. https://doi.org/10.33899/csmj.2013.163422