.png){kind=icon}
.png){kind=icon}
Return
Adaptive LOOCV-based kernel methods for solving time-dependent BVPs
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2022.127228.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Meshless approximation
Kernel methods
Adaptive algorithms
Refinement schemes
Partial differential equations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W