Use this URL to cite this publication: https://hdl.handle.net/20.500.14911/136417
Parallel algorithms for parabolic problems on graphs
Publication Type (CRIS)
Straipsnis konferencijos medžiagoje Web of Science duomenų bazėje / Article in conference proceedings in Web of Science database (P1a1)
Publication Type (eLABa)
Straipsnis konferencijos darbų leidinyje Web of Science DB / Article in conference proceedings Web of Science DB (P1a)
Title [en]
Parallel algorithms for parabolic problems on graphs
Raimondas Čiegis, Natalija Tumanova
Is part of
Parallel processing and applied mathematics: 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011 : revised selected papers, Part II. Lecture Notes in Computer Science
Published In
| Year | Volume | Start Page | End Page |
|---|---|---|---|
2012 | 7204 | 333 | 342 |
Publisher
Berlin : Springer
Referenced in Database(s)(DBs)
Extent
p. 333-342
URI
| URI | Access Rights |
|---|---|
| https://hdl.handle.net/20.500.14911/136417 | |
| Straipsnis | Viso teksto dokumentas (institucijos intranete) / Full Text Document (Intranet Access) |
Cited references
22
Science / Art Area
Gamtos mokslai / Natural Sciences (N)
Field of Science / Art
Matematika / Mathematics (N001)
Abstract (en)
In this paper two parallel numerical algorithms for solution of parabolic problems on graphs are investigated. The fully implicit and predictor-corrector finite difference schemes are proposed to approximate the differential equations on the given graph. The parallelization of the discrete algorithm is based on the domain decomposition method. Scalability analysis of the parallel algorithms is done. Some results of numerical simulations are presented and the efficiency of the proposed parallel algorithms is investigated.
Resource Type (COAR)
TextConference outputConference proceedingsConference paper
Language
Anglų / English (en)
Country
Vokietija / Germany (DE)
Owning collection
ISSN (of the container)
0302-9743
WOS
000312988600034
eLABa ID
3986749