A second‐order energy stable backward differentiation formula method for the epitaxial thin film equation with slope selection
In this article, we study a new second‐order energy stable Backward Differentiation Formula
(BDF) finite difference scheme for the epitaxial thin film equation with slope selection (SS) …
(BDF) finite difference scheme for the epitaxial thin film equation with slope selection (SS) …
A variationally derived, depth-integrated approximation to a higher-order glaciological flow model
DN Goldberg - Journal of Glaciology, 2011 - cambridge.org
An approximation to the first-order momentum balance with consistent boundary conditions
is derived using variational methods. Longitudinal and lateral stresses are treated as depth …
is derived using variational methods. Longitudinal and lateral stresses are treated as depth …
Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms
We describe and analyze preconditioned steepest descent (PSD) solvers for fourth and sixth-
order nonlinear elliptic equations that include p-Laplacian terms on periodic domains in 2 …
order nonlinear elliptic equations that include p-Laplacian terms on periodic domains in 2 …
[HTML][HTML] Quasi-Newton minimization for the p (x)-Laplacian problem
We propose a quasi-Newton minimization approach for the solution of the p (x)-Laplacian
elliptic problem, x∈ Ω⊂ R m. This method outperforms those existing for the p (x)-variable …
elliptic problem, x∈ Ω⊂ R m. This method outperforms those existing for the p (x)-variable …
The adaptive finite element method for the P-Laplace problem
DJ Liu, ZR Chen - Applied Numerical Mathematics, 2020 - Elsevier
We consider the adaptive finite element method (AFEM) for the P-Laplace problem,− div (|∇
u| p− 2∇ u)= f. A posteriori and priori error analysis of conforming and nonconforming finite …
u| p− 2∇ u)= f. A posteriori and priori error analysis of conforming and nonconforming finite …
The steepest descent algorithm without line search for p-Laplacian
G Zhou, C Feng - Applied Mathematics and Computation, 2013 - Elsevier
In this paper, the steepest descent algorithm without line search is proposed for p-Laplacian.
Its search direction is the weighted preconditioned steepest descent one, and step length is …
Its search direction is the weighted preconditioned steepest descent one, and step length is …
A high-order local discontinuous Galerkin method for the -Laplace equation
We study the high-order local discontinuous Galerkin (LDG) method for the $ p $-Laplace
equation. We reformulate our spatial discretization as an equivalent convex minimization …
equation. We reformulate our spatial discretization as an equivalent convex minimization …
[HTML][HTML] A hk mortar spectral element method for the p-Laplacian equation
We present a constrained-vertex variant of the mortar spectral element method to solve the p-
Laplacian equation. To show reliability of the method, first we investigate convergence rate …
Laplacian equation. To show reliability of the method, first we investigate convergence rate …
Coiflet solution of strongly nonlinear p-Laplacian equations
C Xu, J Wang, X Liu, L Zhang, Y Zhou - Applied Mathematics and …, 2017 - Springer
A new boundary extension technique based on the Lagrange interpolating polynomial is
proposed and used to solve the function approximation defined on an interval by a series of …
proposed and used to solve the function approximation defined on an interval by a series of …
Approximation of p-Biharmonic Problem using WEB-Spline based Mesh-Free Method
N Rajashekar, S Chaudhary… - International Journal of …, 2019 - degruyter.com
We describe and analyze the weighted extended b-spline (WEB-Spline) mesh-free finite
element method for solving the p-biharmonic problem. The WEB-Spline method uses …
element method for solving the p-biharmonic problem. The WEB-Spline method uses …