![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/B40A9773-5535-48C4-A011-606761EBC076 | ||
| Έτος | 2001 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | E. Mathioudakis, E. P. Papadopoulou ,Y. G. Saridakis.(2001). BiCGSTAB for collocation systems on shared memory parallel architectures.Presented at International Conference on Numerical Algorithms .[online].Available:http://www.amcl.tuc.gr/_stuff/BiCGSTABshared.pdf | ||
| Εμφανίζεται στις Συλλογές |
We consider the computationally intense problem of solving the large, sparse and non- symmetric system of equations arising from the discretization of Elliptic BVPs by the Col- location finite element method using Hermite Bi-Cubic elements. The size of the problem and a Ritz value analysis suggests the usage of the Symmetric Successive Over-relaxation (SSOR) preconditioned Bi-Conjugate Gradient Stabilized (BiCGSTAB) iterative method for its solution. To induce scalability to our computation, we restructure the Collocation matrix from its block tridiagonal form to a particular red-black ordered form, leading to the development of a well-structured parallel algorithm for the method. The realization of the said algorithm took place on a SGI Origin 2000 shared memory parallel computer. Speed-up measurements are used to reveal the efficiency of our parallel implementation.
Copyright © DIAS 2013
