A Multigrid Algorithm for the p-Laplacian

DOI10.1137/S1064827598339098MaRDI QIDQ4509800zbMATH OpenFDO

Authors Rodolfo Bermejo, Juan-Antonio Infante

Publication date 19 October 2000

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

Full work available at URL https://doi.org/10.1137/S1064827598339098

zbMATH Keywords

\(p\)-LaplacianDirichlet problemfinite elementslocal convergencenonlinear monotone operatorsnonlinear multigrid algorithmnumerical examplesPolak-Ribiere conjugate gradient method

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Recommendations

• scientific article; zbMATH DE number 2058611
• Convergent adaptive finite elements for the nonlinear Laplacian
• A finite difference method for the variational \(p\)-Laplacian
• Preconditioned descent algorithms for \(p\)-Laplacian
• Finite volume schemes for the p-Laplacian on Cartesian meshes

Cited in

(30)

• Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms
• A multigrid optimization algorithm for the numerical solution of quasilinear variational inequalities involving the \(p\)-Laplacian
• A \(p\)-cycle analysis of multigrid method
• Computing the first eigenpair of the \(p\)-Laplacian via inverse iteration of sublinear supersolutions
• Coiflet solution of strongly nonlinear \(p\)-Laplacian equations
• Existence, multiplicity and numerical examples for Schrödinger systems with nonstandard p(x)-growth conditions
• Efficient algorithms for solving the p-Laplacian in polynomial time
• Preconditioned descent algorithms for \(p\)-Laplacian
• A preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operator
• Numerical comparison of nonlinear subgridscale models via adaptive mesh refinement
• Quasi-norm interpolation error estimates for the piecewise linear finite element approximation of \(p\)-Laplacian problems
• Fast gradient methods for uniformly convex and weakly smooth problems
• The steepest descent algorithm without line search for \(p\)-Laplacian
• A Multigrid Algorithm for an Elliptic Problem with a Perturbed Boundary Condition
• Existence and approximation for variational problems under uniform constraints on the gradient by power penalty
• A geometric multigrid method based on L-shaped coarsening for PDEs on stretched grids
• Quasi-Newton minimization for the p(x)-Laplacian problem
• An effective finite element Newton method for 2D p-Laplace equation with particular initial iterative function
• An adaptive Newton multigrid method for a model of marine ice sheets
• Algebraic multigrid for k‐form Laplacians
• A Meshless Solution to the p-Laplace Equation
• PLTMGC: A Multigrid Continuation Program for Parameterized Nonlinear Elliptic Systems
• scientific article; zbMATH DE number 2058611 (Why is no real title available?)
• A multigrid algorithm for the p-version of the virtual element method
• A gradient discretization method to analyze numerical schemes for nonlinear variational inequalities, application to the seepage problem
• Minimization techniques for p(x)-Laplacian problem using WEB-spline based mesh-free method
• ON THE COMPLEX GINZBURG–LANDAU EQUATION WITH A DELAYED FEEDBACK
• Accelerated multigrid for graph Laplacian operators
• On the linear convergence of additive Schwarz methods for the p-Laplacian
• Two-level discretization of the 3D stationary Navier-Stokes equations with damping based on a difference finite element method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509800)