Matematicheskoe modelirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Model.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskoe modelirovanie, 2005, Volume 17, Number 11, Pages 118–128 (Mi mm2819)  

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
Full-text PDF (394 kB) Citations (5)
References:
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
Bibliographic databases:
Language: Russian
Citation: D. L. Golovashkin, “Parallel algorithms for solving tridiagonal network equations by encountering runs method”, Mat. Model., 17:11 (2005), 118–128
Citation in format AMSBIB
\Bibitem{Gol05}
\by D.~L.~Golovashkin
\paper Parallel algorithms for solving tridiagonal network equations by encountering runs method
\jour Mat. Model.
\yr 2005
\vol 17
\issue 11
\pages 118--128
\mathnet{http://mi.mathnet.ru/mm2819}
\zmath{https://zbmath.org/?q=an:1095.65021}
Linking options:
  • https://www.mathnet.ru/eng/mm2819
  • https://www.mathnet.ru/eng/mm/v17/i11/p118
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математическое моделирование
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025