A priori bounds and a Liouville theorem on a half-space for higher order elliptic Dirichlet problems

Mathematics – Analysis of PDEs

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages

Scientific paper

We consider the $2m$-th order elliptic boundary value problem $Lu=f(x,u)$ on a bounded smooth domain $\Omega$ in $R^N$ with Dirichlet boundary conditions. The operator $L$ is a uniformly elliptic operator of order $2m$. We assume that for $s\to \pm\infty$ the nonlinearity $f(x,s)$ behaves like $|s|^q$ multiplied by a continuous and positive function of $x$. Here the exponent $q$ is subcritical, i.e., $q>1$ if $N<=2m$, $12m$. We prove a priori bounds, i.e, we show that the $L^\infty$-norm of every solution $u$ is bounded by a constant independent of $u$. The solutions are allowed to be sign-changing. The proof is done by a blow-up argument which relies on the following new Liouville-type theorem on a half-space: if $u$ is a classical, bounded, non-negative solution of $(-\Delta)^m u = u^q$ in a half-space with Dirichlet boundary conditions and if $q>1$ is subcritical then $u$ vanishes identically.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A priori bounds and a Liouville theorem on a half-space for higher order elliptic Dirichlet problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A priori bounds and a Liouville theorem on a half-space for higher order elliptic Dirichlet problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A priori bounds and a Liouville theorem on a half-space for higher order elliptic Dirichlet problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-457033

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.