๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Direct Method in the Calculus of Variations for Convex Bodies

โœ Scribed by David Jerison


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
435 KB
Volume
122
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

โœฆ Synopsis


The purpose of this paper is to calculate the first variation of capacity and of the lowest eigenvalue for the Dirichlet problem in convex domains in R N . These formulas are well known in the smooth case and are due to Poincare and Hadamard, respectively. The point is to prove them in sufficient generality to make it possible to apply the direct method of the calculus of variations to variational problems involving these functionals. This project was proposed in [CJL] where uniqueness (up to translation) for the variational problem associated to capacity was proved.

The analogous first variation formula for volume was proved by Alexandrov [S, Lemma 6.5.3]. It yields a direct variational proof of the classical theorem of Minkowski. The more typical approach to existence in Minkowski-type problems is to prove it for a dense family of measures and to pass to the limit. In the case of capacity, such an existence proof was carried out in [J].

We begin the paper with an outline of the direct variational approach to the classical Minkowski problem and the statement of the corresponding problem and results for capacity in dimensions N 3. The third section presents the main technical lemma, an elementary lemma for perturbations of support functions. We then deduce the generalized variational formula for capacity and existence in the Minkowski-type variational problem. In the sixth section we present the two-dimensional case, in which the quantity replacing the area is the logarithmic capacity or the transfinite diameter. In the final section we discuss the eigenvalue problem.

It should be mentioned that the proof of the generalized variational formula given here depends on the variational formula for capacity for convex combinations of convex sets proved in [J]. (See Lemma 4.3 below.) It would be nice to have a more direct argument. The argument in [J] leading to this preliminary variational formula is special in several ways. It depends indirectly on Brunn Minkowski-type inequalities of [B] and on article no.


๐Ÿ“œ SIMILAR VOLUMES


An Alternative Method for a Classical Pr
โœ Gamal Elnagar; Mohsen Razzaghi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 230 KB ๐Ÿ‘ 2 views

## Communicated by G. F. Roach A numerical technique for determining the solution of the brachistochrone problem is presented. The brachistochrone problem is first formulated as a non-linear optimal control problem. Using Chebyshev nodes, we construct the Mth degree polynomial interpolation to ap

The Complete Solution for Constrained De
โœ Om Prakash Agrawal; John Gregory ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

This paper has two main ideas. The first idea is that general constrained problems with delay in the calculus of variations can be associated with unconstrained calculus of variations problems by using multipliers. This allows us to obtain a true Lagrange multiplier rule where the original variables

Natural boundary conditions in the calcu
โœ Agnieszka B. Malinowska; Delfim F. M. Torres ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 171 KB

We prove necessary optimality conditions for problems of the calculus of variations on time scales with a Lagrangian depending on the free end-point.

Multiple Solutions for a Classical Probl
โœ I. Ekeland; N. Ghoussoub; H. Tehrani ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 455 KB

The book by Bolza, in fact, became so popular that the fixed-endpoint problem we stated became known as the article no. 0162