Published 1991
| Version v1
Report
Open
Domain decomposition method for solving elliptic problems in unbounded domains
Creators
- 1. Joint Inst. for Nuclear Research, Dubna (USSR). Lab. of Computing Techniques and Automation
Description
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
Availability note (English)
MF available from INIS under the Report Number.Files
24007996.pdf
Files
(411.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:fb24c0d1d6461d9f4057ac510e0ae783
|
411.4 kB | Preview Download |
Additional details
Publishing Information
- Imprint Pagination
- 19 p.
- Report number
- JINR-E--11-91-487
INIS
- Country of Publication
- Russian Federation
- Country of Input or Organization
- Russian Federation
- INIS RN
- 24007996
- Subject category
- S99: GENERAL AND MISCELLANEOUS;
- Descriptors DEI
- ALGORITHMS; BOUNDARY-VALUE PROBLEMS; DECOMPOSITION; FINITE DIFFERENCE METHOD; FINITE ELEMENT METHOD; INTEGRAL EQUATIONS; NONLINEAR PROBLEMS; PARTIAL DIFFERENTIAL EQUATIONS
- Descriptors DEC
- CALCULATION METHODS; CHEMICAL REACTIONS; DIFFERENTIAL EQUATIONS; EQUATIONS; ITERATIVE METHODS; NUMERICAL SOLUTION