4.7 Article

Analysis of a superconvergent recursive moving least squares approximation

期刊

APPLIED MATHEMATICS LETTERS
卷 133, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.aml.2022.108223

关键词

Moving least squares approximation; Recursive gradients; Error analysis; Superconvergence; Meshless collocation method

资金

  1. National Natural Science Foundation of China [11971085]
  2. Natural Science Foundation of Chongqing, China [cstc2021jcyj-jqX0011, cstc2021ycjh-bgzxm0065]
  3. Chongqing Municipal Education Commission, China [CXQT19018, yjg203063]

向作者/读者索取更多资源

This paper analyzes the computational formulas, properties, and theoretical error of the recursive MLS approximation, revealing that the high-order derivatives of the approximation have the same convergence order as the first-order derivative. Numerical results confirm the superconvergence of the recursive MLS approximation.
The recursive moving least squares (MLS) approximation is a superconvergent technique for constructing shape functions in meshless methods. Computational formulas, properties and theoretical error of the recursive MLS approximation are analyzed in this paper. Theoretical results reveal that high order derivatives of the approximation have the same convergence order as the first order derivative. Numerical results confirm the superconvergence of the recursive MLS approximation. (C) 2022 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据