Abstract
Computational aspects of the box domain decomposition (DD) method for solving boundary value problems in an unbounded domain are discussed. A new variant of the DD-method for elliptic problems in unbounded domains is suggested. It is based on the partitioning of an unbounded domain adapted to the given asymptotic decay of an unknown function at infinity. The comparison of computational expenditures is given for boundary integral method and the suggested DD-algorithm. 29 refs.; 2 figs.; 2 tabs.
Khoromskij, B N;
Mazurkevich, G E;
Zhidkov, E P
[1]
- Joint Inst. for Nuclear Research, Dubna (USSR). Lab. of Computing Techniques and Automation
Citation Formats
Khoromskij, B N, Mazurkevich, G E, and Zhidkov, E P.
Domain decomposition method for solving elliptic problems in unbounded domains.
JINR: N. p.,
1991.
Web.
Khoromskij, B N, Mazurkevich, G E, & Zhidkov, E P.
Domain decomposition method for solving elliptic problems in unbounded domains.
JINR.
Khoromskij, B N, Mazurkevich, G E, and Zhidkov, E P.
1991.
"Domain decomposition method for solving elliptic problems in unbounded domains."
JINR.
@misc{etde_10119319,
title = {Domain decomposition method for solving elliptic problems in unbounded domains}
author = {Khoromskij, B N, Mazurkevich, G E, and Zhidkov, E P}
abstractNote = {Computational aspects of the box domain decomposition (DD) method for solving boundary value problems in an unbounded domain are discussed. A new variant of the DD-method for elliptic problems in unbounded domains is suggested. It is based on the partitioning of an unbounded domain adapted to the given asymptotic decay of an unknown function at infinity. The comparison of computational expenditures is given for boundary integral method and the suggested DD-algorithm. 29 refs.; 2 figs.; 2 tabs.}
place = {JINR}
year = {1991}
month = {Dec}
}
title = {Domain decomposition method for solving elliptic problems in unbounded domains}
author = {Khoromskij, B N, Mazurkevich, G E, and Zhidkov, E P}
abstractNote = {Computational aspects of the box domain decomposition (DD) method for solving boundary value problems in an unbounded domain are discussed. A new variant of the DD-method for elliptic problems in unbounded domains is suggested. It is based on the partitioning of an unbounded domain adapted to the given asymptotic decay of an unknown function at infinity. The comparison of computational expenditures is given for boundary integral method and the suggested DD-algorithm. 29 refs.; 2 figs.; 2 tabs.}
place = {JINR}
year = {1991}
month = {Dec}
}