An Adaptive Domain Partitioning Technique for Meshfree-Type Methods
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 dimensio...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/817026 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832567614173347840 |
---|---|
author | Kamal Shanazari |
author_facet | Kamal Shanazari |
author_sort | Kamal Shanazari |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-b6fe6553212744428060a5727d9e286e |
institution | Kabale University |
issn | 1110-757X 1687-0042 |
language | English |
publishDate | 2012-01-01 |
publisher | Wiley |
record_format | Article |
series | Journal of Applied Mathematics |
spelling | doaj-art-b6fe6553212744428060a5727d9e286e2025-02-03T01:00:59ZengWileyJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/817026817026An Adaptive Domain Partitioning Technique for Meshfree-Type MethodsKamal Shanazari0Department of Mathematics, University of Kurdistan, Sanandaj, IranAn 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.http://dx.doi.org/10.1155/2012/817026 |
spellingShingle | Kamal Shanazari An Adaptive Domain Partitioning Technique for Meshfree-Type Methods Journal of Applied Mathematics |
title | An Adaptive Domain Partitioning Technique for Meshfree-Type Methods |
title_full | An Adaptive Domain Partitioning Technique for Meshfree-Type Methods |
title_fullStr | An Adaptive Domain Partitioning Technique for Meshfree-Type Methods |
title_full_unstemmed | An Adaptive Domain Partitioning Technique for Meshfree-Type Methods |
title_short | An Adaptive Domain Partitioning Technique for Meshfree-Type Methods |
title_sort | adaptive domain partitioning technique for meshfree type methods |
url | http://dx.doi.org/10.1155/2012/817026 |
work_keys_str_mv | AT kamalshanazari anadaptivedomainpartitioningtechniqueformeshfreetypemethods AT kamalshanazari adaptivedomainpartitioningtechniqueformeshfreetypemethods |