An adaptive domain partitioning technique for meshfree-type methods (Q443104)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6063493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive domain partitioning technique for meshfree-type methods |
scientific article; zbMATH DE number 6063493 |
Statements
An adaptive domain partitioning technique for meshfree-type methods (English)
0 references
6 August 2012
0 references
Summary: An overlapping domain partitioning based on adapting nodes is presented for the meshless-type methods. The decomposition of the domain is carried out based on the distribution of the nodes produced rather than the geometry of the problem. A set of adaptive nodes is first generated using the dimension reduction and equidistributing along the coordinate directions with respect to arc-length monitor. The domain is then partitioned in such a way that the same number of nodes are allocated to the subdomains. A radial basis function collocation method is applied to each subdomain followed by assembling the global solution from the subproblem's solutions. A generalized thin plate spline with sufficient smoothness is used as a basis function in the collocation method. Some numerical results will be presented to show the performance of the proposed method.
0 references
0 references
0 references
0 references
0 references
0.7949450612068176
0 references
0.7742388248443604
0 references
0.7735778093338013
0 references
0.7710174322128296
0 references
0.7514680027961731
0 references