A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains

DOI10.1007/s10915-005-9006-3zbMath1098.65117MaRDI QIDQ2503135

Yiorgos-Sokratis Smyrlis, Andreas Karageorghis, Th. Tsangaris

Publication date: 14 September 2006

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-005-9006-3

zbMATH Keywords

numerical examples; fast Fourier transform; biharmonic equation; Laplace equation; collocation; circulant matrices; matrix decomposition algorithms; Method of fundamental solutions; hollow axisymmetric domains

Mathematics Subject Classification ID

65N35: Spectral, collocation and related methods for boundary value problems involving PDEs

35J40: Boundary value problems for higher-order elliptic equations

35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation

Related Items

Matrix decomposition algorithms for elliptic boundary value problems: A survey, The under-determined version of the MFS: taking more sources than collocation points, Matrix decomposition MFS algorithms for elasticity and thermo-elasticity problems in axisymmetric domains, A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• \(T\)- and \(D\)-matrix methods for electromagnetic scattering by impedance obstacles
• A matrix decomposition MFS algorithm for axisymmetric potential problems
• A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains