Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Search by expertise, name or affiliation
A hybridizable discontinuous Galerkin method for the p-Laplacian
Bernardo Cockburn
, Jiguang Shen
School of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
32
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A hybridizable discontinuous Galerkin method for the p-Laplacian'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Space
50%
Convergence Property
50%
First Problem
50%
Frozen Coefficients
50%
Hybridizable Discontinuous Galerkin Method
100%
L1-norm
50%
Lp-norm
50%
Minimization Algorithm
50%
Minimization Problem
50%
New Approximation
50%
Nonlinear Minimization
50%
Numerical Experiments
50%
Numerical Results
50%
Order of Convergence
50%
Order-k
50%
P-Laplacian
100%
Mathematics
Convergence Order
50%
Convergence Property
50%
Minimization Problem
50%
Numerical Experiment
50%
p-Laplacian
100%
Polynomial
50%