We present an implementation of a finite-difference approxi mation for the solution of partial di... more We present an implementation of a finite-difference approxi mation for the solution of partial differential equations on trans puter networks. The grid structure associated with the finite-difference appro ximation is exploited by using geometric partitioning of the data among the processors. This pro- vides a very low degree of communication between the processors. The resultant system of linear equations is
this report appeared as [5]. In addition, this report also containsthe full GAMS classification o... more this report appeared as [5]. In addition, this report also containsthe full GAMS classification of each algorithm (Chapter 3), the GAMS classification list (Chapter 4),a description of how to obtain tools to operate on the database to generate a number of more usefuloutput forms, where to obtain sources of the algorithms, and details of the database from which theindex of
This report contains a cumulative index to the Collected Algorithms of the ACM. The algorithms ar... more This report contains a cumulative index to the Collected Algorithms of the ACM. The algorithms areclassified using the modified SHARE classification, several different views of which are provided inChapter 1. The source codes of these routines originally appeared in the Communications of the ACMand, from Algorithm 493, in the ACM Transactions on Mathematical Software. All algorithms upto and including those
We present an implementation of a finite-difference approxi mation for the solution of partial di... more We present an implementation of a finite-difference approxi mation for the solution of partial differential equations on trans puter networks. The grid structure associated with the finite-difference appro ximation is exploited by using geometric partitioning of the data among the processors. This pro- vides a very low degree of communication between the processors. The resultant system of linear equations is
this report appeared as [5]. In addition, this report also containsthe full GAMS classification o... more this report appeared as [5]. In addition, this report also containsthe full GAMS classification of each algorithm (Chapter 3), the GAMS classification list (Chapter 4),a description of how to obtain tools to operate on the database to generate a number of more usefuloutput forms, where to obtain sources of the algorithms, and details of the database from which theindex of
This report contains a cumulative index to the Collected Algorithms of the ACM. The algorithms ar... more This report contains a cumulative index to the Collected Algorithms of the ACM. The algorithms areclassified using the modified SHARE classification, several different views of which are provided inChapter 1. The source codes of these routines originally appeared in the Communications of the ACMand, from Algorithm 493, in the ACM Transactions on Mathematical Software. All algorithms upto and including those
Uploads
Papers by Tim Hopkins