.png){kind=icon}
Return
An ACA accelerated MFS for potential problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.enganabound.2014.01.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Adaptive cross approximation
Method of fundamental solutions
Radial basis functions
Meshless boundary collocation methods
Fast algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.9K
Citations:
9.4K
Organization
Cited Papers
Melatonin Implant Decreases the Density of 2[<sup>125</sup>I]Iodomelatonin Binding Sites in the Chicken Spleen.png)
Neurosignals
NeurosignalsIF0
PREAI
ShareSave
ShareSaveShareSaveA sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matricesCOMPUTING
COMPUTINGIF2.8
PREAI
ShareSaveShareSaveShareSaveShareSave
View more