期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Local MFS Matrix Decomposition Algorithms for Elliptic BVPs in Annuli
1
作者 C.S.Chen Andreas Karageorghis Min Lei 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE CSCD 2024年第1期93-120,共28页
We apply the local method of fundamental solutions(LMFS)to boundary value problems(BVPs)for the Laplace and homogeneous biharmonic equations in annuli.By appropriately choosing the collocation points,the LMFS discreti... We apply the local method of fundamental solutions(LMFS)to boundary value problems(BVPs)for the Laplace and homogeneous biharmonic equations in annuli.By appropriately choosing the collocation points,the LMFS discretization yields sparse block circulant system matrices.As a result,matrix decomposition algorithms(MDAs)and fast Fourier transforms(FFTs)can be used for the solution of the systems resulting in considerable savings in both computational time and storage requirements.The accuracy of the method and its ability to solve large scale problems are demonstrated by applying it to several numerical experiments. 展开更多
关键词 Local method of fundamental solutions Poisson equation biharmonic equation matrix decomposition algorithms fast Fourier transforms
原文传递
Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains 被引量:1
2
作者 C.S.Chen Andreas Karageorghis 《Communications in Computational Physics》 SCIE 2019年第1期41-67,共27页
A local radial basis function method(LRBF)is applied for the solution of boundary value problems in annular domains governed by the Poisson equation,the inhomogeneous biharmonic equation and the inhomogeneous Cauchy-N... A local radial basis function method(LRBF)is applied for the solution of boundary value problems in annular domains governed by the Poisson equation,the inhomogeneous biharmonic equation and the inhomogeneous Cauchy-Navier equations of elasticity.By appropriately choosing the collocation points we obtain linear systems in which the coefficient matrices possess block sparse circulant structures and which can be solved efficiently using matrix decomposition algorithms(MDAs)and fast Fourier transforms(FFTs).The MDAs used are appropriately modified to take into account the sparsity of the arrays involved in the discretization.The leave-one-out cross validation(LOOCV)algorithm is employed to obtain a suitable value for the shape parameter in the radial basis functions(RBFs)used.The selection of the nearest centres for each local influence domain is carried out using a modification of the kdtree algorithm.In several numerical experiments,it is demonstrated that the proposed algorithm is both accurate and capable of solving large scale problems. 展开更多
关键词 Radial basis functions Kansa method Poisson equation biharmonic equation Cauchy-Navier equations of elasticity matrix decomposition algorithms fast Fourier transforms
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部