2007
DOI: 10.1016/j.jcp.2006.09.028
|View full text |Cite
|
Sign up to set email alerts
|

Generation of curvilinear coordinates on multiply connected regions with boundary singularities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 11 publications
(22 citation statements)
references
References 21 publications
0
22
0
Order By: Relevance
“…As explained above, this leads to failure of computations, and more so in moving boundary problems. The second method [27][28][29] transforms the domain into a simply connected one by introducing as many branch-cuts as needed at arbitrary positions to connect once the inclusions with each other and another branch-cut to connect one of the internal bodies with the external boundary of the domain. Typically, one of the coordinates is assigned the same constant value on all the internal interfaces and all the branch-cuts between the bodies and another value at the external boundary, whereas the other coordinate takes two different constant values on the cut between one of the bodies and the outer interface.…”
Section: Introductionmentioning
confidence: 99%
“…As explained above, this leads to failure of computations, and more so in moving boundary problems. The second method [27][28][29] transforms the domain into a simply connected one by introducing as many branch-cuts as needed at arbitrary positions to connect once the inclusions with each other and another branch-cut to connect one of the internal bodies with the external boundary of the domain. Typically, one of the coordinates is assigned the same constant value on all the internal interfaces and all the branch-cuts between the bodies and another value at the external boundary, whereas the other coordinate takes two different constant values on the cut between one of the bodies and the outer interface.…”
Section: Introductionmentioning
confidence: 99%
“…(2) can be used for mesh generation to satisfy specific requirements. For examples, Kaul [16] proposed a new set of boundary constraints (control functions) to automatically cluster the grid points; and, Vikkanizar et al [17] derived the control functions to adapt to the multiply connected domains. If the orthogonal condition is applied (b = g 12 = g 21 = 0) and the following control functions are selected:…”
Section: Elliptic Generation Systemsmentioning
confidence: 99%
“…(48) and (49) has been used to generate elliptic boundary-fitted grids. More details on the grid generation process and other grid generation alternatives can be found in [39,34,35,13,40] for similar domains.…”
Section: Numerical Grid Generation: Elliptic-polar Gridsmentioning
confidence: 99%
“…The medium is homogeneous, i.e., n 1. This problem was previously treated in [7] using boundary conforming grids [13] coupled with local absorbing boundary conditions [8]. The wavenumber was k = 2p.…”
Section: Three Complexly Shaped Obstaclesmentioning
confidence: 99%