Parallel simulations using recurrence relations and relaxation
This thesis develops and evaluates a number of efficient algorithms for performing parallel simulations. These algorithms achieve approximate linear speed-up, in the sense that their run times are in the order of O(n/p), when n is the size of the problem and p is the number of processors employed. T...
| Main Author: | |
|---|---|
| Published: |
University of Newcastle Upon Tyne
2000
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340720 |