2018
DOI: 10.1002/nme.5943
|View full text |Cite
|
Sign up to set email alerts
|

Iterative coupling algorithms for large multidomain problems with the boundary element method

Abstract: A new parallel Robin-Robin adaptive iterative coupling algorithm with dynamic relaxation parameters is proposed for the boundary element method (BEM), and relaxation parameters are derived for other existing iterative coupling algorithms. The performances of the new algorithm and of the modified existing algorithms are investigated in terms of convergence properties with respect to the number of subdomains, mesh density, interface mesh conformity, and BEM element types. Results show that the number of subdomai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 42 publications
0
6
0
Order By: Relevance
“…where the partial derivatives of space coordinates are defined as and hence the CPU time can be drastically reduced [77,78]. Furthermore, the final assembly matrix is diagonally dominant, therefore the condition numbers of the resulting matrices significantly improve [74,79,80].…”
Section: Formulation For Stoke's Flowmentioning
confidence: 99%
See 2 more Smart Citations
“…where the partial derivatives of space coordinates are defined as and hence the CPU time can be drastically reduced [77,78]. Furthermore, the final assembly matrix is diagonally dominant, therefore the condition numbers of the resulting matrices significantly improve [74,79,80].…”
Section: Formulation For Stoke's Flowmentioning
confidence: 99%
“…Furthermore, the final assembly matrix is diagonally dominant, therefore the condition numbers of the resulting matrices significantly improve [74,79,80]. MDBEM was successfully employed for heat transfer [72,73,75,77,78,[81][82][83][84][85][86], elasticity [74,[87][88][89] and Stoke's flow [79,80,[90][91][92][93] in which some variables are eliminated and the size of the final system of equations are reduced. The selection of iterative schemes or variable condensation technique is problem specific.…”
Section: Formulation For Stoke's Flowmentioning
confidence: 99%
See 1 more Smart Citation
“…the assembly of a large system of equations, including the compatibility conditions at the interfaces among adjacent domains, may be too computationally demanding. In previous works, parallel DDMs were developed aimed at iteratively solving a series of small dense linear subsystems, rather than a coupled large unsymmetrical sparse linear system [9,10,11,46]. In DDM, conditions at interfaces are updated at each iteration, until obtaining a solution that fits the specified compatibility condition at each interface [46].…”
Section: Parallel Domain Decomposition Algorithm (Ddm)mentioning
confidence: 99%
“…19 are satisfied up to a given tolerance TOL, this quantity being directly associated with the mass flux balance over all intersections. The optimal relaxation parameter β k is defined as follows [46]:…”
Section: Parallel Domain Decomposition Algorithm (Ddm)mentioning
confidence: 99%