2013
DOI: 10.1142/s0218202513500358
|View full text |Cite
|
Sign up to set email alerts
|

Gradient Schemes: A Generic Framework for the Discretisation of Linear, Nonlinear and Nonlocal Elliptic and Parabolic Equations

Abstract: Gradient schemes are nonconforming methods written in discrete variational formulation and based on independent approximations of functions and gradients, using the same degrees of freedom. Previous works showed that several well-known methods fall in the framework of gradient schemes. Four properties, namely coercivity, consistency, limit-conformity and compactness, are shown in this paper to be sufficient to prove the convergence of gradient schemes for linear and nonlinear elliptic and parabolic problems, i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
194
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 109 publications
(196 citation statements)
references
References 25 publications
2
194
0
Order By: Relevance
“…Remark 3.1 (The scheme for Richards' equation) The scheme is obtained by Scheme (14), replacing (14d) by…”
Section: Remark 212 An Important Example Of Space-time Discretisationmentioning
confidence: 99%
See 1 more Smart Citation
“…Remark 3.1 (The scheme for Richards' equation) The scheme is obtained by Scheme (14), replacing (14d) by…”
Section: Remark 212 An Important Example Of Space-time Discretisationmentioning
confidence: 99%
“…x ∈ Ω j , and all q ∈ R and j ∈ J. We also have (14), and there exists C 1 > 0, only depending on the data introduced in Hypotheses (4), on any C P ∈ (0, +∞) greater than C D (defined by (8)), and on…”
Section: Remark 212 An Important Example Of Space-time Discretisationmentioning
confidence: 99%
“…We follow here the same approach used in [3]. Define the mapping T : v −→ u where for any v ∈ X D,0 , u ∈ K D is defined as the solution to…”
Section: Theorem 2 (Convergence)mentioning
confidence: 99%
“…Using Lemma 1.13 in [2] (see also the proof of Theorem 3.5 in [3]), there exists a subsequence, still denoted by…”
Section: Theorem 2 (Convergence)mentioning
confidence: 99%
See 1 more Smart Citation