Improving the accuracy of LDG approximations on coarse meshes
From MaRDI portal
Publication:1997348
DOI10.1016/J.MATCOM.2018.08.010OpenAlexW2889764469WikidataQ129268322 ScholiaQ129268322MaRDI QIDQ1997348FDOQ1997348
Authors: Paul Castillo, Sergio Gómez, Sergio Manzanarez 
Publication date: 2 March 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2018.08.010
Recommendations
- Efficient Operator-Coarsening Multigrid Schemes for Local Discontinuous Galerkin Methods
- The $\cal P^k+1-\cal S^k$ Local Discontinuous Galerkin Method for Elliptic Equations
- Development of a LDG method on polytopal mesh with optimal order of convergence
- Two efficient and reliable a posteriori error estimates for the local discontinuous Galerkin method applied to linear elliptic problems on Cartesian grids
- A note on the local approximation properties of piecewise polynomials with applications to LDG methods
Numerical methods for partial differential equations, boundary value problems (65Nxx) Parabolic equations and parabolic systems (35Kxx)
Cites Work
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- An Interior Penalty Finite Element Method with Discontinuous Elements
- The Local Discontinuous Galerkin Method for Time-Dependent Convection-Diffusion Systems
- Superconvergence of the local discontinuous Galerkin method for elliptic problems on Cartesian grids
- A trust region method based on interior point techniques for nonlinear programming.
- An analysis of the minimal dissipation local discontinuous Galerkin method for convection-diffusion problems
- Moving Mesh Strategy Based on a Gradient Flow Equation for Two-Dimensional Problems
- The Runge-Kutta discontinuous Galerkin method for conservation laws. I: Multidimensional systems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- An \(hp\)-analysis of the local discontinuous Galerkin method for diffusion problems
- An a priori error analysis of the local discontinuous Galerkin method for elliptic problems
- Performance of Discontinuous Galerkin Methods for Elliptic PDEs
- Stencil reduction algorithms for the local discontinuous Galerkin method
- Title not available (Why is that?)
- Adaptive grid generation from harmonic maps on Riemannian manifolds
- An adaptive moving mesh method with static rezoning for partial differential equations
- A Discontinuous Galerkin Moving Mesh Method for Hamilton–Jacobi Equations
- Measuring Mesh Qualities and Application to Variational Mesh Adaptation
- Title not available (Why is that?)
- Moving mesh methods in multiple dimensions based on harmonic maps
- Sequential Minimax Search for a Maximum
- A two-dimensional moving finite element method with local refinement based on a posteriori error estimates
- Moving mesh discontinuous Galerkin method for hyperbolic conservation laws
- Optimization of finite element grids by direct energy search
- A New Moving Mesh Algorithm for the Finite Element Solution of Variational Problems
- An optimal triangulation for second-order elliptic problems
- An error indicator monitor function for an \(r\)-adaptive finite-element method
- A note on the optimal choice of finite element grids
- Analysis of an algorithm for generating locally optimal meshes for 𝐿₂ approximation by discontinuous piecewise polynomials
- Moving mesh discontinuous Galerkin methods for PDEs with traveling waves
- A pre-processing moving mesh method for discontinuous Galerkin approximations of advection-diffusion-reaction problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Improving the accuracy of LDG approximations on coarse meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997348)
