Abstract
Amongst the various approaches of `meshless' method, the Partition-of-unity concept married with the traditional finite-element method, namely PUFEM, has emerged to be competitive in solving the boundary-value problems. It inherits most of the advantages from both techniques except that the beauty of being `meshless' vanishes. This paper presents an alternative approach to solve singular boundary-value problems. It follows the basic PUFEM procedures. The salient feature is to enhance the quality of the influence functions, either over one single nodal cover or multi-nodal-covers. In the vicinity of the singularity, available asymptotic analytical solution is employed to enrich the influence function. The beauty of present approach is that it facilitates easy replacement of the influence functions. In other words, it favors the `influence-function refinement' procedure in a bid to search for more accurate solutions. It is analogous to the `p-version refinement' in the traditional finite-element procedures. The present approach can yield very accurate solution without adopting refined meshes. As a result, the quantities around the singularity can be evaluated directly once the nodal values are solved. No additional post-processing is needed. Firstly, the formulation of the present PUFEM approach is described. Subsequently, illustrative examples show the application to three classical singular benchmark problems having various orders of singularity. Results obtained through mesh refinements, single-nodal-cover refinements or multi-nodal-cover refinements are compared.
Accepted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
