Cited by
- BibTex
- RIS
- TXT
We analyze a least-squares asymmetric radial basis function collocation method for solving the modified Helmholtz equations. In the theoretical part, we proved the convergence of the proposed method providing that the collocation points are sufficiently dense. For numerical verification, direct solver and a subspace selection process for the trial space (the so-called adaptive greedy algorithm) is employed, respectively, for small and large scale problems.
}, issn = {2075-1354}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/aamm/8375.html} }We analyze a least-squares asymmetric radial basis function collocation method for solving the modified Helmholtz equations. In the theoretical part, we proved the convergence of the proposed method providing that the collocation points are sufficiently dense. For numerical verification, direct solver and a subspace selection process for the trial space (the so-called adaptive greedy algorithm) is employed, respectively, for small and large scale problems.