A multigrid algorithm for the p-Laplacian



Downloads per month over past year

Infante del Río, Juan Antonio and Bermejo, R. (2000) A multigrid algorithm for the p-Laplacian. SIAM journal on scientific computing, 21 (5). pp. 1774-1789. ISSN 1064-8275

Official URL: http://epubs.siam.org/doi/pdf/10.1137/S1064827598339098


We introduce a full approximation storage (FAS) multigrid algorithm to find the finite element solution for a class of nonlinear monotone elliptic problems. Since the solution of the problem is equivalent to minimize a strictly convex functional, we use a Polak-Ribiere conjugate gradient method as the nonlinear smoother in our algorithm. The advantage in so doing is that we do not have to calculate derivatives of operators. We prove local convergence of our algorithm and illustrate its performance by solving benchmark problems.

Item Type:Article
Uncontrolled Keywords:p-Laplacian, nonlinear monotone operators, finite elements, FAS multigrid, Polak--Ribiere conjugate gradient
Subjects:Sciences > Mathematics > Differential equations
ID Code:23311
Deposited On:22 Oct 2013 10:38
Last Modified:12 Dec 2018 15:07

Origin of downloads

Repository Staff Only: item control page