A Multigrid Algorithm for the p-Laplacian

From MaRDI portal
Publication:4509800

DOI10.1137/S1064827598339098zbMath0958.65132MaRDI QIDQ4509800

Rodolfo Bermejo, Juan-Antonio Infante

Publication date: 19 October 2000

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)




Related Items (17)

Quasi-Newton minimization for the \(p(x)\)-Laplacian problemPreconditioned descent algorithms for \(p\)-LaplacianAn effective finite element Newton method for 2D \(p\)-Laplace equation with particular initial iterative functionAn adaptive Newton multigrid method for a model of marine ice sheetsA preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operatorA Gradient Discretization Method to Analyze Numerical Schemes for Nonlinear Variational Inequalities, Application to the Seepage ProblemExistence and Approximation for Variational Problems Under Uniform Constraints on the Gradient by Power PenaltyFast gradient methods for uniformly convex and weakly smooth problemsComputing the first eigenpair of the \(p\)-Laplacian via inverse iteration of sublinear supersolutionsPreconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian termsExistence, multiplicity and numerical examples for Schrödinger systems with nonstandard \(p(x)\)-growth conditionsA multigrid optimization algorithm for the numerical solution of quasilinear variational inequalities involving the \(p\)-LaplacianNumerical comparison of nonlinear subgridscale models via adaptive mesh refinementCoiflet solution of strongly nonlinear \(p\)-Laplacian equationsON THE COMPLEX GINZBURG–LANDAU EQUATION WITH A DELAYED FEEDBACKQuasi-norm interpolation error estimates for the piecewise linear finite element approximation of \(p\)-Laplacian problemsMinimization techniques for p(x)-Laplacian problem using WEB-Spline based mesh-free method




This page was built for publication: A Multigrid Algorithm for the p-Laplacian