scholarly journals On approximating minimizers of convex functionals with a convexity constraint by singular Abreu equations without uniform convexity

Author(s):  
Nam Q. Le

Abstract We revisit the problem of approximating minimizers of certain convex functionals subject to a convexity constraint by solutions of fourth order equations of Abreu type. This approximation problem was studied in previous articles of Carlier–Radice (Approximation of variational problems with a convexity constraint by PDEs of Abreu type. Calc. Var. Partial Differential Equations58 (2019), no. 5, Art. 170) and the author (Singular Abreu equations and minimizers of convex functionals with a convexity constraint, arXiv:1811.02355v3, Comm. Pure Appl. Math., to appear), under the uniform convexity of both the Lagrangian and constraint barrier. By introducing a new approximating scheme, we completely remove the uniform convexity of both the Lagrangian and constraint barrier. Our analysis is applicable to variational problems motivated by the original 2D Rochet–Choné model in the monopolist's problem in Economics, and variational problems arising in the analysis of wrinkling patterns in floating elastic shells in Elasticity.

2006 ◽  
Vol 216 (1) ◽  
pp. 216-246 ◽  
Author(s):  
John B. Greer ◽  
Andrea L. Bertozzi ◽  
Guillermo Sapiro

Author(s):  
B. V. Rathish Kumar ◽  
Gopal Priyadarshi

We describe a wavelet Galerkin method for numerical solutions of fourth-order linear and nonlinear partial differential equations (PDEs) in 2D and 3D based on the use of Daubechies compactly supported wavelets. Two-term connection coefficients have been used to compute higher-order derivatives accurately and economically. Localization and orthogonality properties of wavelets make the global matrix sparse. In particular, these properties reduce the computational cost significantly. Linear system of equations obtained from discretized equations have been solved using GMRES iterative solver. Quasi-linearization technique has been effectively used to handle nonlinear terms arising in nonlinear biharmonic equation. To reduce the computational cost of our method, we have proposed an efficient compression algorithm. Error and stability estimates have been derived. Accuracy of the proposed method is demonstrated through various examples.


Sign in / Sign up

Export Citation Format

Share Document