Quasi-optimal degree distribution for a quadratic programming problem arising from the \(p\)-version finite element method for a one-dimensional obstacle problem

DOI10.1016/j.dam.2013.08.040zbMath1331.90049MaRDI QIDQ496661

Andreas Krebs, Matthias Maischak, Ernst Peter Stephan

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.040

zbMATH Keywords

quadratic programming; \(p\)-version; obstacle problem; finite-dimensional approximation

Mathematics Subject Classification ID

90C20: Quadratic programming

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• maiprogs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D
• Adaptive \(hp\)-versions of boundary element methods for elastic contact problems
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• Polynomial interpolation results in Sobolev spaces
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• Adaptive \(hp\)-versions of BEM for Signorini problems
• Variationally consistent discretization schemes and numerical algorithms for contact problems
• A Posteriori Error Estimates Based on Hierarchical Bases
• Error Estimates for the Approximation of a Class of Variational Inequalities
• An Introduction to Variational Inequalities and Their Applications
• Linear functional analysis. An application oriented introduction