Lobachevskii Journal of Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Lobachevskii J. Math.:
Year:
Volume:
Issue:
Page:
Find






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


Lobachevskii Journal of Mathematics, 2002, Volume 10, Pages 27–44 (Mi ljm122)  

This article is cited in 1 scientific paper (total in 1 paper)

On the parallel domain decomposition algorithms for time-dependent problems

A. V. Lapina, J. Pieskäb

a Kazan State University, The Faculty of Computer Science and Cybernetics
b Department of Mathematical Sciences, University of Oulu
Full-text PDF (286 kB) Citations (1)
References:
Abstract: Several new finite-difference schemes for a nonlinear convection-diffusion problem are constructed and numerically studied. These schemes are constructed on the basis of non-overlapping domain decomposition and predictor-corrector approach. Our study was motivated by the article [8], where so-called EPIC (explicit predictor-implicit corrector) method have been proposed for a linear one-dimensional problem and founded to be stable and scalable when solving on big number of processors. We construct the predictor-corrector schemes for a nonlinear problem, which serves as a mathematical model for the continuous casting problem (see [1], [2], [4], [5], where implicit and characteristic grid approximations of the continuous casting problem have been theoretically and experimentally studied). We use different non-overlapping decomposition of a domain, with cross-points and angles, schemes with grid refinement in time in some subdomains. All proposed algorithms are extensively numerically tested and are founded stable and accurate under natural assumptions for time and space grid steps. Also, the parallel algorithms scales well as the number of processors increases.
Received: 25.04.2002
Bibliographic databases:
Language: English
Citation: A. V. Lapin, J. Pieskä, “On the parallel domain decomposition algorithms for time-dependent problems”, Lobachevskii J. Math., 10 (2002), 27–44
Citation in format AMSBIB
\Bibitem{LapPie02}
\by A.~V.~Lapin, J.~Piesk\"a
\paper On the parallel domain decomposition algorithms for time-dependent problems
\jour Lobachevskii J. Math.
\yr 2002
\vol 10
\pages 27--44
\mathnet{http://mi.mathnet.ru/ljm122}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1903665}
\zmath{https://zbmath.org/?q=an:1003.65109}
Linking options:
  • https://www.mathnet.ru/eng/ljm122
  • https://www.mathnet.ru/eng/ljm/v10/p27
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Lobachevskii Journal of Mathematics
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025