Relaxed Kačanov Scheme for the p-Laplacian with Large Exponent
From MaRDI portal
Publication:6091101
Abstract: We introduce a globally convergent relaxed Kacanov scheme for the computation of the discrete minimizer to the -Laplace problem with . The iterative scheme is easy to implement since each iterate results only from the solve of a weighted, linear Poisson problem. It neither requires an additional line search nor involves unknown constants for the step length. The rate of convergence is independent of the underlying mesh.
Recommendations
- A relaxed Kačanov iteration for the \(p\)-Poisson problem
- A damped Kačanov scheme for the numerical solution of a relaxed p(x)-Poisson equation
- Relaxation model for the p-Laplacian problem with stiffness
- Finite volume schemes for the p-Laplacian on Cartesian meshes
- Efficient algorithms for solving the p-Laplacian in polynomial time
Cites work
- A p-Laplacian approximation for some mass optimization problems
- A boundary estimate for nonlinear equations with discontinuous coefficients.
- A finite difference method for the variational \(p\)-Laplacian
- A pointwise differential inequality and second-order regularity for nonlinear elliptic systems
- A posteriori error estimation for the dual mixed finite element method for the p-Laplacian in a polygonal domain
- A Posteriori Finite Element Error Control for the P-Laplace Problem
- A relaxed Kačanov iteration for the \(p\)-Poisson problem
- Adaptive Optimization of Convex Functionals in Banach Spaces
- Adaptive regularization, linearization, and discretization and a posteriori error control for the two-phase Stefan problem
- An Inexpensive Method for the Evaluation of the Solution of the Lowest Order Raviart–Thomas Mixed Method
- Automated solution of differential equations by the finite element method. The FEniCS book
- Bean's critical-state model as the p limit of an evolutionary p-Laplacian equation
- Best approximation property in the $W^1_{\infty }$ norm for finite element methods on graded meshes
- Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs
- Efficient algorithms for solving the p-Laplacian in polynomial time
- Energy contraction and optimal convergence of adaptive iterative linearized finite element methods
- Explicit and efficient error estimation for convex minimization problems
- Finite Element Approximation of the Parabolic p-Laplacian
- Finite Element Interpolation of Nonsmooth Functions Satisfying Boundary Conditions
- Fractional estimates for non-differentiable elliptic systems with general growth
- Global regularity in Nikolskij spaces for elliptic equations with p-structure on polyhedral domains
- Higher order Calderón-Zygmund estimates for the p-Laplace equation
- scientific article; zbMATH DE number 2129319 (Why is no real title available?)
- scientific article; zbMATH DE number 2132148 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interpolation operators in Orlicz--Sobolev spaces
- Iterative Galerkin discretizations for strongly monotone problems
- Linear Convergence of an Adaptive Finite Element Method for the p-Laplacian Equation
- Nonconforming discretizations of convex minimization problems and precise relations to mixed methods
- Nonconforming FEMs for an optimal design problem
- Optimal second-order regularity for the \(p\)-Laplace system
- Optimality of an adaptive finite element method for the p-Laplacian equation
- Pointwise Calderón-Zygmund gradient estimates for the \(p\)-Laplace system
- Preconditioned descent algorithms for \(p\)-Laplacian
- Quasi-Newton minimization for the p(x)-Laplacian problem
- Quasi-norm interpolation error estimates for the piecewise linear finite element approximation of \(p\)-Laplacian problems
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Rate optimality of adaptive finite element methods with respect to overall computational costs
- Regularity for minimizers of non-quadratic functionals: The case \(1<p<2\)
- Second-order two-sided estimates in nonlinear elliptic problems
- The steepest descent algorithm without line search for \(p\)-Laplacian
- Unconditional stability of semi-implicit discretizations of singular flows
Cited in
(9)- A relaxed Kačanov iteration for the \(p\)-Poisson problem
- Solving minimal residual methods in \(W^{-1,p'}\) with large exponents \(p\)
- Numerical approximation of variational problems with orthotropic growth
- Error analysis for a Crouzeix-Raviart approximation of the variable exponent Dirichlet problem
- Pressure-robust finite element discretizations of the nonlinear Stokes equations
- Guaranteed upper bounds for iteration errors and modified Kačanov schemes via discrete duality
- On full linear convergence and optimal complexity of adaptive FEM with inexact solver
- Global convergence of adaptive least-squares finite element methods for nonlinear PDEs
- Numerical analysis for geometric and nonlinear PDEs. Abstracts from the workshop held February 1--6, 2026
This page was built for publication: Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091101)
