A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains
DOI10.1007/s10915-005-9006-3zbMath1098.65117OpenAlexW2126313786MaRDI QIDQ2503135
Andreas Karageorghis, Th. Tsangaris, Yiorgos-Sokratis Smyrlis
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
numerical examplesfast Fourier transformbiharmonic equationLaplace equationcollocationcirculant matricesmatrix decomposition algorithmsMethod of fundamental solutionshollow axisymmetric domains
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 (5)
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
This page was built for publication: A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains