.png){kind=icon}
返回
An ACA accelerated MFS for potential problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.enganabound.2014.01.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The MFS is a popular meshless boundary collocation method but encounters troublesome fully-populated interpolation matrix, whose operation count and memory requirement for interpolation matrices buildup are of order O(N-2). This is computationally prohibitively expensive. The adaptive cross approximation (ACA), a kernel-independent fast algorithm, was devised to reduce both CPU time and memory requirement in solving dense matrix systems from O(N-2) to O(N log(beta)N) by a pseudo-skeletal entries approximation. This paper makes a first attempt to apply the ACA to remedy the expensive matrix computation and accelerate the solution of the MFS in potential problems, and further improves the ACA in generating the admissible cluster pairs. The MFS accelerated by the present improved ACA are tested to three benchmark cases. Numerical results show that the proposed methodology is computationally more efficient than the conventional scheme. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Adaptive cross approximation
Method of fundamental solutions
Radial basis functions
Meshless boundary collocation methods
Fast algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.9K
被引数:
9.4K
机构
引用论文
Melatonin Implant Decreases the Density of 2[<sup>125</sup>I]Iodomelatonin Binding Sites in the Chicken Spleen.png)
Neurosignals
NeurosignalsIF0
PREAI
分享收藏
A sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matricesCOMPUTING
COMPUTINGIF2.8
PREAI
分享收藏Joint Image Registration and Super-Resolution From Low-Resolution Images With Zooming Motion具有缩放运动的低分辨率图像的联合图像配准和超分辨率
PREAI
分享收藏分享收藏
查看更多内容