A posteriori error estimation and adaptive node refinement for fast moving least square reproducing kernel (FMLSRK) method
From MaRDI portal
Publication:3551815
zbMATH Open1184.65098MaRDI QIDQ3551815FDOQ3551815
Authors: Chany Lee, Chang-Hwan Im, Hyun-Kyo Jung, Hong-Kyu Kim, Do Wan Kim 
Publication date: 16 April 2010
Recommendations
- A posteriori error estimates and an adaptive scheme of least-squares meshfree method
- An automatic adaptive refinement procedure for the reproducing kernel particle method. I: Stress recovery and a posteriori error estimation
- Moving least-square reproducing kernel methods. I: Methodology and convergence
- An automatic adaptive refinement procedure for the reproducing kernel particle method. II: Adaptive refinement
- A posteriori error estimator and an adaptive technique in meshless finite points method
error estimationelectrostaticsmeshless methodsadaptive node refinementfast moving least square reproducing kernel (FMLSRK) method
Cited In (7)
- A posteriori error estimates and an adaptive scheme of least-squares meshfree method
- A Kriging‐based error‐reproducing and interpolating kernel method for improved mesh‐free approximations
- Coupling of point collocation meshfree method and FEM for EEG forward solver
- Novel approach to spectral methods for irregular domains
- An adaptive interpolation element free Galerkin method based on a posteriori error estimation of FEM for Poisson equation
- An automatic adaptive refinement procedure for the reproducing kernel particle method. I: Stress recovery and a posteriori error estimation
- A multi-space error estimation approach for meshfree methods.
This page was built for publication: A posteriori error estimation and adaptive node refinement for fast moving least square reproducing kernel (FMLSRK) method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3551815)
