Preconditioning for radial basis functions with domain decomposition methods

90Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

Abstract

In our previous work, an effective preconditioning scheme that is based upon constructing least-squares approximation cardinal basis functions (ACBFs) from linear combinations of the RBF-PDE matrix elements has shown very attractive numerical results. The preconditioner costs O(N2) flops to set up and O(N) storage. The preconditioning technique is sufficiently general that it can be applied to different types of different operators. This was applied to the 2D multiquadric method, with c∼1/√N on the Poisson test problem, the preconditioned GMRES converges in tens of iterations. In this paper, we combine the RBF methods and the ACBF preconditioning technique with the domain decomposition method (DDM). We studied different implementations of the ACBF-DDM scheme and provide numerical results for N > 10,000 nodes. We shall demonstrate that the efficiency of the ACBF-DDM scheme improves dramatically as successively finer partitions of the domain are considered. © 2005 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Ling, L., & Kansa, E. J. (2004). Preconditioning for radial basis functions with domain decomposition methods. Mathematical and Computer Modelling, 40(13), 1413–1427. https://doi.org/10.1016/j.mcm.2005.01.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free