Parallel algorithms for solving tridiagonal network equations by encountering runs method

The article is devote to use of the encountering runs method for synthesis of a parallel algorithms (in a frame of functional decomposition) for solving tridiagonal network equations. Comparison with known algorithms is resulted, merits and demerits of the offered algorithms are revealed.