Efficient MFS algorithms in regular polygonal domains
From MaRDI portal
Recommendations
- Efficient MFS algorithms for inhomogeneous polyharmonic problems
- Efficient implementation of the MFS: The three scenarios
- A matrix decomposition MFS algorithm for problems in hollow axisymmetric domains
- Matrix Decomposition Algorithms Related to the MFS for Axisymmetric Problems
- Efficient MFS algorithms for problems in thermoelasticity
Cites work
- A matrix decomposition MFS algorithm for axisymmetric biharmonic problems
- A matrix decomposition MFS algorithm for axisymmetric potential problems
- A matrix decomposition RBF algorithm: approximation of functions and their derivatives
- Fast Fourier Methods in Computational Complex Analysis
- scientific article; zbMATH DE number 996190 (Why is no real title available?)
- scientific article; zbMATH DE number 4082904 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1472783 (Why is no real title available?)
- scientific article; zbMATH DE number 3806892 (Why is no real title available?)
- scientific article; zbMATH DE number 2097787 (Why is no real title available?)
- scientific article; zbMATH DE number 1424108 (Why is no real title available?)
- Matrix decomposition algorithms for separable elliptic boundary value problems in two space dimensions
- Matrix Decomposition Algorithms in Orthogonal Spline Collocation for Separable Elliptic Boundary Value Problems
- Numerical analysis of the MFS for certain harmonic problems
- Some aspects of the method of fundamental solutions for certain harmonic problems
- Some remarks concerning the shape of the source contour with application of the method of fundamental solutions to elastic torsion of prismatic rods
- The Approximate Solution of Elliptic Boundary-Value Problems by Fundamental Solutions
- The collocation points of the fundamental solution method for the potential problem
- 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 problems in potential flow
- The method of fundamental solutions for scattering and radiation problems.
- The Method of Fundamental Solutions for the Solution of Nonlinear Plane Potential Problems
- Trefftz method: An overview
Cited in
(9)- Efficient implementation of the MFS: The three scenarios
- A matrix decomposition MFS algorithm for axisymmetric biharmonic problems
- Kansa-RBF algorithms for elliptic problems in regular polygonal domains
- Efficient MFS algorithms for problems in thermoelasticity
- The method of fundamental solutions for elliptic problems in circular domains with mixed boundary conditions
- Singular matrices arising in the MFS from certain boundary and pseudo-boundary symmetries
- 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
This page was built for publication: Efficient MFS algorithms in regular polygonal domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014364)