2016
DOI: 10.1016/j.camwa.2016.10.004
|View full text |Cite
|
Sign up to set email alerts
|

Gradient schemes for the Signorini and the obstacle problems, and application to hybrid mimetic mixed methods

Abstract: Gradient schemes is a framework which enables the unified convergence analysis of many different methods -such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -for 2 nd order diffusion equations. We show in this work that the gradient schemes framework can be extended to variational inequalities involving mixed Dirichlet, Neumann and Signorini boundary conditions. This extension allows us to provide error estimates for numerical approximations of such models, recovering kno… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 38 publications
0
11
0
1
Order By: Relevance
“…The schemes (2.10) or (3.4) are then modified by replacing the set K D by K D,a D in the Signorini case, or by K D,ψ D in the obstacle case. The convergence results for this case of approximate barriers are given in the following theorems, whose proofs are identical to that of Theorem 2.9 (see [2,Section 6] for the case of approximate barriers in gradient schemes for linear VIs). Under the assumptions of Theorem 2.9, let (D m ) m∈N be a sequence of gradient discretisations in the sense of Definition 2.3, such that (D m ) m∈N is coercive, limitconforming, compact, and GD-consistent (with S D defined using K D,a D instead of K D ).…”
Section: Approximate Barriersmentioning
confidence: 92%
See 1 more Smart Citation
“…The schemes (2.10) or (3.4) are then modified by replacing the set K D by K D,a D in the Signorini case, or by K D,ψ D in the obstacle case. The convergence results for this case of approximate barriers are given in the following theorems, whose proofs are identical to that of Theorem 2.9 (see [2,Section 6] for the case of approximate barriers in gradient schemes for linear VIs). Under the assumptions of Theorem 2.9, let (D m ) m∈N be a sequence of gradient discretisations in the sense of Definition 2.3, such that (D m ) m∈N is coercive, limitconforming, compact, and GD-consistent (with S D defined using K D,a D instead of K D ).…”
Section: Approximate Barriersmentioning
confidence: 92%
“…We presented in [2] three properties called coercivity, GD-consistency and limitconformity to assess the accuracy of gradient schemes for VIs. These properties were sufficient to establish error estimates and prove the convergence of the GDM for VIs based on linear differential operator.…”
Section: 2mentioning
confidence: 99%
“…We begin with defining the discrete space and operators. These discrete elements are slightly different from the ones defined in [2,3], in particular, χ D , I D , and J D are introduced to deal with the non constant barrier χ and the initial solutions A ini and B ini . (1) The discrete set X D,0 is a finite-dimensional vector space on R, taking into account the homogenous Dirichlet boundary condition (1.1e).…”
Section: Discrete Settingmentioning
confidence: 99%
“…( Ā, B) = (0, 0) on (∂Ω × (0, T )) 2 , (1.1e) ( Ā(x x x, 0), B(x x x, 0)) = (A ini , B ini ) in (Ω × {0}) 2 .…”
Section: Introductionunclassified
See 1 more Smart Citation