CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Splitting method for elliptic equations with line sources
Authors
Ingeborg G. Gjerde
Kundan Kumar
Jan M. Nordbotten
Barbara Wohlmuth
Publication date
30 October 2018
Publisher
Doi
Cite
View
on
arXiv
Abstract
In this paper, we study the mathematical structure and numerical approximation of elliptic problems posed in a (3D) domain
Ω
\Omega
Ω
when the right-hand side is a (1D) line source
Λ
\Lambda
Λ
. The analysis and approximation of such problems is known to be non-standard as the line source causes the solution to be singular. Our main result is a splitting theorem for the solution; we show that the solution admits a split into an explicit, low regularity term capturing the singularity, and a high-regularity correction term
w
w
w
being the solution of a suitable elliptic equation. The splitting theorem states the mathematical structure of the solution; in particular, we find that the solution has anisotropic regularity. More precisely, the solution fails to belong to
H
1
H^1
H
1
in the neighbourhood of
Λ
\Lambda
Λ
, but exhibits piecewise
H
2
H^2
H
2
-regularity parallel to
Λ
\Lambda
Λ
. The splitting theorem can further be used to formulate a numerical method in which the solution is approximated via its correction function
w
w
w
. This approach has several benefits. Firstly, it recasts the problem as a 3D elliptic problem with a 3D right-hand side belonging to
L
2
L^2
L
2
, a problem for which the discretizations and solvers are readily available. Secondly, it makes the numerical approximation independent of the discretization of
Λ
\Lambda
Λ
; thirdly, it improves the approximation properties of the numerical method. We consider here the Galerkin finite element method, and show that the singularity subtraction then recovers optimal convergence rates on uniform meshes, i.e., without needing to refine the mesh around each line segment. The numerical method presented in this paper is therefore well-suited for applications involving a large number of line segments. We illustrate this by treating a dataset (consisting of
∼
3000
\sim 3000
∼
3000
line segments) describing the vascular system of the brain
Similar works
Full text
Available Versions
EDP Sciences OAI-PMH repository (1.2.0)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:edpsciences.org:dkey/10.10...
Last time updated on 10/04/2020