Abstract
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.
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.
