Geodesic
Parallel algorithms for solving tridiagonal network equations by encountering runs method
Matematičeskoe modelirovanie, Tome 17 (2005) no. 11, pp. 118-128

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MM_2005_17_11_a9,
     author = {D. L. Golovashkin},
     title = {Parallel algorithms for solving tridiagonal network equations by encountering runs method},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {118--128},
     publisher = {mathdoc},
     volume = {17},
     number = {11},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2005_17_11_a9/}
}
TY  - JOUR
AU  - D. L. Golovashkin
TI  - Parallel algorithms for solving tridiagonal network equations by encountering runs method
JO  - Matematičeskoe modelirovanie
PY  - 2005
SP  - 118
EP  - 128
VL  - 17
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_2005_17_11_a9/
LA  - ru
ID  - MM_2005_17_11_a9
ER  - 
%0 Journal Article
%A D. L. Golovashkin
%T Parallel algorithms for solving tridiagonal network equations by encountering runs method
%J Matematičeskoe modelirovanie
%D 2005
%P 118-128
%V 17
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_2005_17_11_a9/
%G ru
%F MM_2005_17_11_a9
D. L. Golovashkin. Parallel algorithms for solving tridiagonal network equations by encountering runs method. Matematičeskoe modelirovanie, Tome 17 (2005) no. 11, pp. 118-128. http://geodesic.mathdoc.fr/item/MM_2005_17_11_a9/