摘要
节点的支撑域半径求取和计算点的邻域确定是移动最小二乘近似中的关键环节。已有文献中大都是通过排序的方法来进行,结合计算复杂度对其进行分析,用迭代的思想提出1种新的支撑域动态控制的方法,该方法降低了计算复杂度,并应用于加权最小二乘无网格法求解偏微分方程,数值算例表明:该方法计算量较小,能够保证较高的精度。
It's the key segment in moving Least-Square Approximation that computing the radius of node's support field and fixing the neighborhood of node.The most of papers finished it by sorting nodes according to distance which takes a lot of computation.This paper analyses the complexity and develops a new method to compute the radius based on the iterative process.It can dynamically control the radius and decreases the complexity.Finally,it is applied to solve partial differential equations.The numerical example ...
出处
《西安科技大学学报》
CAS
北大核心
2009年第5期613-616,共4页
Journal of Xi’an University of Science and Technology
基金
陕西省教育厅专项基金项目(2008JK365)
陕西省自然科学基金项目(2006A10)
关键词
支撑域
移动最小二乘近似
动态控制
加权最小二乘法
Poisson问题
support field
moving least-square approximation
dynamical control
meshless weighted Least-Square method
poisson problem
