首页|Adaptive LOOCV-based kernel methods for solving time-dependent BVPs
Adaptive LOOCV-based kernel methods for solving time-dependent BVPs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
In this article we propose an adaptive algorithm for the solution of time-dependent boundary value problems (BVPs). To solve numerically these problems, we consider the kernel- based method of lines that allows us to split the spatial and time derivatives, dealing with each separately. This adaptive scheme is based on a leave-one-out cross validation (LOOCV) procedure, which is employed as an error indicator. By this technique, we can first detect the domain areas where the error is estimated to be too large - generally due to steep variations or quick changes in the solution - and then accordingly enhance the numerical solution by applying a two-point refinement strategy. Numerical experiments show the efficacy and performance of our adaptive refinement method. (C) 2022 Elsevier Inc. All rights reserved.
Meshless approximationKernel methodsAdaptive algorithmsRefinement schemesPartial differential equationsBASIS FUNCTION INTERPOLATIONRBF COLLOCATIONSCHEMEALGORITHM
NSTL
Elsevier
