Faster convergence and higher accuracy for the Dirichlet-Neumann map

Research output: Contribution to journalArticlepeer-review

1 Citation (SciVal)
146 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)2578-2586
JournalJournal of Computational Physics
Volume228
Issue number7
DOIs
Publication statusPublished - 2009

Bibliographical note

The information about affiliations in this record was updated in December 2015.
The record was previously connected to the following departments: Numerical Analysis (011015004)

Subject classification (UKÄ)

  • Mathematics

Keywords

  • Fast multipole method
  • Integral equations
  • Dirichlet–Neumann map
  • Potential theory
  • Nyström method

Fingerprint

Dive into the research topics of 'Faster convergence and higher accuracy for the Dirichlet-Neumann map'. Together they form a unique fingerprint.

Cite this