Faster convergence and higher accuracy for the Dirichlet-Neumann map

Summary, in English

New techniques allow for more efficient boundary integral algorithms to compute the Dirichlet–Neumann map for Laplace’s equation in two-dimensional exterior domains. Novelties include a new post-processor which reduces the need for discretization points with 50%, a new integral equation which reduces the error for resolved geometries with a factor equal to the system size, systematic use of regularization which reduces the error even further, and adaptive mesh generation based on kernel resolution.

• Författare: Johan Helsing
• Avdelning/ar: Matematik LTH; Harmonic Analysis and Applications
• Publiceringsår: 2009
• Språk: Engelska
• Sidor: 2578-2586
• Publikation/Tidskrift/Serie: Journal of Computational Physics
• Volym: 228
• Issue: 7
• Fulltext: - 198 kB; Download statistics
• Länkar: http://www.maths.lth.se/na/staff/helsing/JCP09a.pdf; http://dx.doi.org/10.1016/j.jcp.2008.12.025
• Dokumenttyp: Artikel i tidskrift
• Förlag: Elsevier
• Ämne: Mathematics
• Nyckelord: Fast multipole method; Integral equations; Dirichlet–Neumann map; Potential theory; Nyström method
• Status: Published
• Forskningsgrupp: Harmonic Analysis and Applications; Harmonic Analysis and Applications
• ISBN/ISSN/Övrigt: ISSN: 0021-9991