Efficient Kansa-type MFS algorithm for elliptic problems
DOI10.1007/s11075-009-9334-8zbMath1190.65184OpenAlexW2064482754MaRDI QIDQ973855
Publication date: 26 May 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9334-8
numerical examplesfast Fourier transformsHelmholtz equationelliptic boundary value problemscirculant matricesmethod of fundamental solutionsmatrix decomposition algorithm
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical methods for discrete and fast Fourier transforms (65T50) Direct numerical methods for linear systems and matrix inversion (65F05) Fundamental solutions, Green's function methods, etc. for boundary value problems involving PDEs (65N80)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the choice of source points in the method of fundamental solutions
- Matrix decomposition RBF algorithm for solving 3D elliptic problems
- Some remarks concerning the shape of the source contour with application of the method of fundamental solutions to elastic torsion of prismatic rods
- A time-marching MFS scheme for heat conduction problems
- A matrix decomposition RBF algorithm: approximation of functions and their derivatives
- Efficient MFS algorithms in regular polygonal domains
- The method of fundamental solutions for elliptic boundary value problems
- The method of fundamental solutions for scattering and radiation problems.
- Some aspects of the method of fundamental solutions for certain harmonic problems
- A new method of fundamental solutions applied to nonhomogeneous elliptic problems
- Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
- Multiquadrics -- a scattered data approximation scheme with applications to computational fluid-dynamics. II: Solutions to parabolic, hyperbolic and elliptic partial differential equations
- A Kansa Type Method Using Fundamental Solutions Applied to Elliptic PDEs
- Matrix Decomposition Algorithms Related to the MFS for Axisymmetric Problems
This page was built for publication: Efficient Kansa-type MFS algorithm for elliptic problems