Moving least-square reproducing kernel methods ( I ) Methodology and convergence

@inproceedings{WingKam1995MovingLR,
title={Moving least-square reproducing kernel methods ( I ) Methodology and convergence},
author={Wing-Kam and ’ Liu and Shaofan and J Li and Ted Belytschko},
year={1995}
}

This paper formulates the moving least-square interpolation scheme in a framework of the so-called moving least-square reproducing kernel (MLSRK) representation. In this study, the procedure of constructing moving least square interpolation function is facilitated by using the notion of reproducing kernel formulation, which, ‘as a generalization of the early discrete approach, establishes a continuous basis for a partition of unity. This new formulation possesses the quality of simplicity, and… CONTINUE READING