The planar least gradient problem in convex domains: the discontinuous case (Q2657271): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00030-021-00678-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00030-021-00678-8 / rank | |||
Normal rank | |||
Latest revision as of 13:47, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The planar least gradient problem in convex domains: the discontinuous case |
scientific article |
Statements
The planar least gradient problem in convex domains: the discontinuous case (English)
0 references
12 March 2021
0 references
In this paper, the discontinuous case associated with the planar least gradient problem in convex domains is investigated. More precisely, the corresponding solutions are constructed by a limiting process, which uses solutions to known problems.
0 references
least gradient
0 references
\textit{BV} functions
0 references
convex but not strictly convex domains
0 references
trace solutions
0 references
0 references
0 references
0 references
