Parallel solution of bidiagonal systems coming from discretised PDEs

Standard algorithms for the solution of bidiagonal linear systems, which plays an important role in the numerical solution of discretized partial differential equations, are not very well suited for parallel or vector computers, and they often constitute a severe bottleneck on such machines. A number of parallel/vectorizable algorithms are considered. Performance limiting aspects of different (existing) architectures are considered, and it is shown that for many modern architectures suitable algorithms are presently available.<
>