|
This article is cited in 5 scientific papers (total in 5 papers)
Parallel algorithms for solving tridiagonal network equations by encountering runs method
D. L. Golovashkinab a S. P. Korolyov Samara State Aerospace University
b Image Processing Systems Institute
Abstract:
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.
Received: 07.04.2004 Revised: 07.04.2005
Citation:
D. L. Golovashkin, “Parallel algorithms for solving tridiagonal network equations by encountering runs method”, Mat. Model., 17:11 (2005), 118–128
Linking options:
https://www.mathnet.ru/eng/mm2819 https://www.mathnet.ru/eng/mm/v17/i11/p118
|
|