Domain decomposition method for solving elliptic problems in unbounded domains
Khoromskij, B N; Mazurkevich, G E; Zhidkov, E P [Joint Inst. for Nuclear Research, Dubna (USSR). Lab. of Computing Techniques and Automation]
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; BOUNDARY-VALUE PROBLEMS; FINITE DIFFERENCE METHOD; FINITE ELEMENT METHOD; ALGORITHMS; DECOMPOSITION; INTEGRAL EQUATIONS; NONLINEAR PROBLEMS; PARTIAL DIFFERENTIAL EQUATIONS; 990200; MATHEMATICS AND COMPUTERS
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.
Joint Inst. for Nuclear Research, Dubna (Russian Federation)
OSTI; NTIS (US Sales Only); INIS
JINR
1992-12-31
English
Technical Report
Other Information: PBD: 1991
Medium: X; Size: [19] p.
ON: DE93612903
JINR-E-11-91-487
Other: ON: DE93612903; TRN: RU9207242007996
INIS; SCA: 990200; PA: AIX-24:007996; SN: 93000932752
2008-02-12
10119319