An adaptive domain partitioning technique for meshfree-type methods (Q443104): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65N22 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65N30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6063493 / rank | |||
Normal rank | |||
Revision as of 01:31, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptive domain partitioning technique for meshfree-type methods |
scientific article |
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
