.png){kind=icon}
返回
Results on meshless collocation techniques
.png){kind=icon}
PRE
AI
DOI：10.1016/j.enganabound.2005.08.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Though the technique introduced by Kansa is very successful in engineering applications, there were no proven results so far on the unsymmetric meshless collocation method for solving PDE boundary value problems in strong form. While the original method cannot be proven to be fail-safe in general, we prove asymptotic feasibility for a generalized variant using separated trial and test spaces. Furthermore, a greedy variation of this technique is provided, allowing a fully adaptive matrix-free and data-dependent meshless selection of the test and trial spaces. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
Kansa's methods
asymptotic feasibility
matrix-free algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.8K
被引数:
9.4K
机构
暂无机构信息
引用论文
Residual Structure in Islet Amyloid Polypeptide Mediates Its Interactions with Soluble Insulin.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
Bridge–Pier Caisson foundations subjected to normal and thrust faulting: physical experiments versus numerical analysisMeccanica
MeccanicaIF0
PREAI
分享收藏
分享收藏
查看更多内容