The Electrostatic Problem for Piecewise Constant Conductivities in Two Dimensions: Numerical Methods and Optimal Regularity
Bibliographic record
Abstract
We present a numerical method for solving the elliptic partial differential equation problem for the electrostatic potential with piecewise constant conductivity and a Neumann boundary condition. This setting is often considered in studies of the Electrical Impedance Tomography (EIT) inverse problem. Our aim is to provide an accessible and self-contained presentation of both an integral equation formulation of the problem and a numerical method for solving it, which we hope will facilitate the adoption of such methods in the EIT community. Our method employs an integral equation approach for which we derive a system of well-conditioned integral equations by representing the solution as a sum of single layer potentials. The fast multipole method is used to accelerate the generalized minimal residual method solution of the integral equations. For efficiency, we adapt the grid of the Nystrom method based on the spectral resolution of the layer charge density. Additionally, we present a method for evaluating the solution, based on up-sampling and the boundary element method, that is efficient and accurate throughout the domain, circumventing the close-evaluation problem. To support the design choices of the numerical method, we derive regularity estimates with bounds explicitly in terms of the conductivities and the geometries of the boundaries between their regions. The resulting method is fast and accurate for solving for the electrostatic potential in media with piecewise constant conductivities. We also provide analytical results for the system of equations for the charge densities. Firstly, we establish existence and uniqueness to this system of equations. Secondly, we derive regularity for the charge densities along each interface. We show that assuming that the interface has C^k regularity, then the charge density is of regularity H^k (i.e., in the Hilbert space of order k). Furthermore, we generalize our results by considering the case where the piecewise constant regions of conductivity overlap, and we study the behaviour of the solution to leading order at points of intersection between two transversely intersecting interfaces of regions of piecewise constant conductivity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".