STABLE PARALLEL SOLVERS FOR GENERAL TRIDIAGONAL LINEAR-SYSTEMS

We analyze the problem of solving tridiagonal linear systems on parall el computers. In the case where the coefficient matrix is symmetric po sitive definite and/or diagonally dominant, this problem has been exte nsively discussed. More difficult is the case where the coefficient ma trix does not satisfy the above requirements. Here we present two algo rithms which are able to handle general tridiagonal matrices, and comp are them on some test problems carried out on a distributed memory par allel computer.