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



Matem. Mod.:
Year:
Volume:
Issue:
Page:
Find






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


Matem. Mod., 2005, Volume 17, Number 11, Pages 118–128 (Mi mm2819)  

This article is cited in 4 scientific papers (total in 4 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.

Full text: PDF file (394 kB)
References: PDF file   HTML file

Bibliographic databases:
Received: 07.04.2004
Revised: 07.04.2005

Citation: D. L. Golovashkin, “Parallel algorithms for solving tridiagonal network equations by encountering runs method”, Matem. Mod., 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 Matem. Mod.
\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:
  • http://mi.mathnet.ru/eng/mm2819
  • http://mi.mathnet.ru/eng/mm/v17/i11/p118

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. D. L. Golovashkin, L. V. Loganova, “Vektornyi algoritm metoda vstrechnykh progonok potoka zadach”, Trudy chetvertoi Vserossiiskoi nauchnoi konferentsii s mezhdunarodnym uchastiem (29–31 maya 2007 g.). Chast 4, Informatsionnye tekhnologii v matematicheskom modelirovanii, Matem. modelirovanie i kraev. zadachi, SamGTU, Samara, 2007, 25–28  mathnet
    2. L. V. Loganova, D. L. Golovashkin, O. S. Syagailo, “Parallelnyi algoritm metoda tsiklicheskoi reduktsii dlya periodicheskoi kraevoi zadachi”, Vestn. Sam. gos. tekhn. un-ta. Ser. Fiz.-mat. nauki, 1(20) (2010), 197–204  mathnet  crossref
    3. Degtyarev A.A., Kozlova E.S., “Issledovanie pogreshnosti raznostnogo resheniya odnonapravlennogo uravneniya gelmgoltsa metodom vychislitelnogo eksperimenta”, Kompyuternaya optika, 36:1 (2012), 36–45  mathscinet  elib
    4. Golovashkin D.L., Loganova L.V., “Reshenie setochnykh uravnenii neyavnykh raznostnykh skhem s tsiklicheskimi kraevymi usloviyami na dvumernykh setochnykh oblastyakh s ispolzovaniem neskolkikh graficheskikh vychislitelnykh ustroistv”, Kompyuternaya optika, 36:4 (2012), 534–540  elib
  • Математическое моделирование
    Number of views:
    This page:846
    Full text:357
    References:49
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020