BiCGSTAB for collocation systems on shared memory parallel architecturesBiCGSTAB for collocation systems on shared memory parallel architectures Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-10-162001enWe 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.http://creativecommons.org/licenses/by/4.0/International Conference on Numerical Algorithms Papadopoulou Eleni Παπαδοπουλου Ελενη Saridakis Ioannis Σαριδακης Ιωαννης E. N. Mathioudakis