The planar least gradient problem in convex domains: the discontinuous case (Q2657271)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7321630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The planar least gradient problem in convex domains: the discontinuous case |
scientific article; zbMATH DE number 7321630 |
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
0.9517951011657716
0 references
0.8848586678504944
0 references
0.8753504157066345
0 references
0.8718745708465576
0 references
