Boundary element method for Laplace equation in a ring domain

In this paper, we present a rapid procedure for approximating the solution to the Laplace equation in a ring domain. We develop a new formulation of boundary integral operators and implement an efficient solution approach using the Galerkin boundary element method for Dirichlet and mixed boundary value problems. The corresponding matrix entries are computed efficiently and accurately, and the resulting circulant block structure allows the matrices of the discrete boundary integral operators to be expressed as a product of sparse matrices. Therefore the fast Fourier transform (FFT) has significantly accelerated matrix-to-vector product. Moreover, the discrete Fourier transform (DFT) enables the construction of efficient preconditioners for conjugate gradient algorithms, and provides a robust direct approach for solving the Dirichlet problem. Numerical experiments for both Dirichlet and mixed problems demonstrate the exceptional efficiency and accuracy of the proposed algorithms.

Authors

Publication Details

Journal
Partial Differential Equations in Applied Mathematics
Published
2025-12-13
DOI
https://doi.org/10.1016/j.padiff.2025.101334
Primary Topic
Numerical methods in engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Boundary element method for Laplace equation in a ring domain

Laurent Tchoualag, Jean Daniel Mukam
Partial Differential Equations in Applied Mathematics
Numerical methods in engineering
article

Boundary element method for Laplace equation in a ring domain

Laurent Tchoualag, Jean Daniel Mukam
article en

Abstract

In this paper, we present a rapid procedure for approximating the solution to the Laplace equation in a ring domain. We develop a new formulation of boundary integral operators and implement an efficient solution approach using the Galerkin boundary element method for Dirichlet and mixed boundary value problems. The corresponding matrix entries are computed efficiently and accurately, and the resulting circulant block structure allows the matrices of the discrete boundary integral operators to be expressed as a product of sparse matrices. Therefore the fast Fourier transform (FFT) has significantly accelerated matrix-to-vector product. Moreover, the discrete Fourier transform (DFT) enables the construction of efficient preconditioners for conjugate gradient algorithms, and provides a robust direct approach for solving the Dirichlet problem. Numerical experiments for both Dirichlet and mixed problems demonstrate the exceptional efficiency and accuracy of the proposed algorithms.

Partial Differential Equations in Applied MathematicsVol. 17
Openalex Percentile: Top 56%
Numerical methods in engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.