Skip to content
Licensed Unlicensed Requires Authentication Published by Oldenbourg Wissenschaftsverlag September 7, 2013

Solution of the Dirichlet problem for G-minimal graphs with a continuity and approximation method

  • Claudia Szerement EMAIL logo
From the journal Analysis


We consider the Dirichlet problem for so-called G-minimal graphs in two dimensions. These are immersions of minimal surface type which can be presented as graphs over a planar domain. With the aid of a weight matrix G we derive a quasilinear elliptic and homogeneous differential equation for this height function. Then we solve the Dirichlet problem over convex domains Ω without differentiability assumptions and continuous boundary data with a constructive continuity and approximation method.

We firstly establish an a priori C1+α-estimate up to the boundary of the solution as we take the dense problem class of strictly convex C2+α-domains and C2+α-boundary data. By proving theorems on stability and compactness of graphs we solve this boundary value problem with a nonlinear continuity method. Then we introduce weighted conformal parameters in the graph and consider the parametric problem on the unit disc. Finally, we solve the original Dirichlet problem by using an approximation argument and the important parametric compactness theorem.

Published Online: 2013-09-07
Published in Print: 2013-09

© 2013 Oldenbourg Wissenschaftsverlag GmbH, Rosenheimer Str. 145, 81671 München

Downloaded on 6.12.2023 from
Scroll to top button