Computing the first eigenpair of the p-Laplacian in annuli.

We propose a method for computing the first eigenpair of the Dirichlet p-Laplacian, p > 1, in the annulus ?a,b = {x ? RN : a 1. For each t ? (a, b), we use an inverse iteration method to solve two radial eigenvalue problems: one in the annulus ?a,t, with the corresponding eigenvalue ??(t) and boundary conditions u(a) = 0 = u (t); and the other in the annulus ?t,b, with the corresponding eigenvalue ?+(t) and boundary conditions u (t) = 0 = u(b). Next, we adjust the parameter t using a matching procedure to make ??(t) coincide with ?+(t), thereby obtaining the first eigenvalue ?p. Hence, by a simple splicing argument, we obtain the positive, L?-normalized, radial first eigenfunction up. The matching parameter is the maximum point ? of up. In order to apply this method, we derive estimates for ??(t) and ?+(t), and we prove that these functions are monotone and (locally Lipschitz) continuous. Moreover, we derive upper and lower estimates for the maximum point ?, which we use in the matching procedure, and we also present a direct proof that up converges to the L?-normalized distance function to the boundary as p ? ?. We also present some numerical results obtained using this method