.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Meshless approximation
Kernel methods
Adaptive algorithms
Refinement schemes
Partial differential equations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
分享收藏Menopausal-type symptoms among breast cancer patients on aromatase inhibitor therapy.png)
Climacteric
ClimactericIF0
PREAI
分享收藏
查看更多内容