Efficient MFS algorithms in regular polygonal domains

DOI10.1007/s11075-008-9224-5zbMath1162.65409OpenAlexW2065891444MaRDI QIDQ1014364

Andreas Karageorghis

Publication date: 27 April 2009

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-008-9224-5

zbMATH Keywords

numerical examplesfast Fourier transformbiharmonic equationLaplace equationcirculant matricesmethod of fundamental solutionsmatrix decomposition algorithms

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Boundary value problems for higher-order elliptic equations (35J40) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05)

Related Items (4)

Efficient MFS algorithms for inhomogeneous polyharmonic problems ⋮ Matrix decomposition algorithms for elliptic boundary value problems: A survey ⋮ Efficient Kansa-type MFS algorithm for elliptic problems ⋮ Kansa-RBF algorithms for elliptic problems in regular polygonal domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks concerning the shape of the source contour with application of the method of fundamental solutions to elastic torsion of prismatic rods
• The method of fundamental solutions for problems in potential flow
• A matrix decomposition RBF algorithm: approximation of functions and their derivatives
• The fast Fourier transform and the numerical solution of one-dimensional boundary integral equations
• 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 matrix decomposition MFS algorithm for axisymmetric biharmonic problems
• Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
• The collocation points of the fundamental solution method for the potential problem
• A matrix decomposition MFS algorithm for axisymmetric potential problems
• Fast Fourier Methods in Computational Complex Analysis
• The Method of Fundamental Solutions for the Solution of Nonlinear Plane Potential Problems
• The Approximate Solution of Elliptic Boundary-Value Problems by Fundamental Solutions
• Matrix Decomposition Algorithms in Orthogonal Spline Collocation for Separable Elliptic Boundary Value Problems
• Numerical analysis of the MFS for certain harmonic problems
• Trefftz method: An overview

This page was built for publication: Efficient MFS algorithms in regular polygonal domains