A gradient reproducing kernel collocation method for boundary value problems

檔案

日期

2013-03-30

類型

期刊名稱

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING

卷期與頁次

第 93 卷第 13 期,頁 1381–1402

ISSN

0029-5981

語言

英文

摘要

The earlier work in the development of direct strong form collocation methods, such as the reproducing kernel collocation method (RKCM), addressed the domain integration issue in the Galerkin type meshfree method, such as the reproducing kernel particle method, but with increased computational complexity because of taking higher order derivatives of the approximation functions and the need for using a large number of collocation points for optimal convergence. In this work, we intend to address the computational complexity in RKCM while achieving optimal convergence by introducing a gradient reproduction kernel approximation. The proposed gradient RKCM reduces the order of differentiation to the first order for solving second-order PDEs with strong form collocation. We also show that, different from the typical strong form collocation method where a significantly large number of collocation points than the number of source points is needed for optimal convergence, the same number of collocation points and source points can be used in gradient RKCM. We also show that the same order of convergence rates in the primary unknown and its first-order derivative is achieved, owing to the imposition of gradient reproducing conditions. The numerical examples are given to verify the analytical prediction. Copyright (c) 2012 John Wiley & Sons, Ltd.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chi, S.-W., Chen, J.-S., Hu, H.-Y., & Yang, J. P. (2013). A gradient reproducing kernel collocation method for boundary value problems. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 93(13), 1381–1402. https://doi.org/10.1002/nme.4432

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/21169