English

Computing the first eigenpair of the p-Laplacian via inverse iteration of sublinear supersolutions

Analysis of PDEs 2012-06-05 v2 Numerical Analysis

Abstract

We introduce an iterative method for computing the first eigenpair (λp,ep)(\lambda_{p},e_{p}) for the pp-Laplacian operator with homogeneous Dirichlet data as the limit of (μq,uq)(\mu_{q,}u_{q}) as qpq\rightarrow p^{-}, where uqu_{q} is the positive solution of the sublinear Lane-Emden equation Δpuq=μquqq1-\Delta_{p}u_{q}=\mu_{q}u_{q}^{q-1} with same boundary data. The method is shown to work for any smooth, bounded domain. Solutions to the Lane-Emden problem are obtained through inverse iteration of a super-solution which is derived from the solution to the torsional creep problem. Convergence of uqu_{q} to epe_{p} is in the C1C^{1}-norm and the rate of convergence of μq\mu_{q} to λp\lambda_{p} is at least O(pq)O(p-q). Numerical evidence is presented.

Keywords

Cite

@article{arxiv.1011.3172,
  title  = {Computing the first eigenpair of the p-Laplacian via inverse iteration of sublinear supersolutions},
  author = {Rodney Josué Biezuner and Grey Ercole and Eder Marinho Martins},
  journal= {arXiv preprint arXiv:1011.3172},
  year   = {2012}
}

Comments

Section 5 was rewritten. Jed Brown was added as author