Solving Linear Recurrence Systems Using Level 2 and 3 BLAS Routines

The aim of this paper is to present a new efficient BLAS-based algorithm for solving linear recurrence systems with constant coefficients, which can be easily and efficiently implemented on shared or distributed memory machines and clusters of workstations. The algorithm is based on level 3 and level 2 BLAS routines _GEMM, _GEMV and _TRMV, which are crucial for its efficiency even when the order of a system is relatively high. The results of experiments performed on a dual-processor Pentium III computer are also presented and discussed.