A Two-Way BSP Algorithm for Tridiagonal Systems

摘要

A two-way parallel recursive method is prsented for solving a tridiagonal linear system. The algorithm is based on the parallel segment recursive method proposed in (9). The comutation and communication costs of the algorithm are analysed using the BSP (Bulk Synchronous Parallel) model.