2012
DOI: 10.1051/m2an/2012003
|View full text |Cite
|
Sign up to set email alerts
|

Adaptivity and variational stabilization for convection-diffusion equations

Abstract: Abstract. In this paper we propose and analyze stable variational formulations for convection diffusion problems starting from concepts introduced by Sangalli. We derive efficient and reliable a posteriori error estimators that are based on these formulations. The analysis of resulting adaptive solution concepts, when specialized to the setting suggested by Sangalli's work, reveals partly unexpected phenomena related to the specific nature of the norms induced by the variational formulation. Several remedies, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
105
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 114 publications
(108 citation statements)
references
References 22 publications
2
105
0
Order By: Relevance
“…Second, it suggests an "ideal setting" for Petrov-Galerkin schemes from which numerically feasible versions can be derived in a systematic manner. A slightly different but related approach has been proposed in [9] for a more restricted scope of problems.…”
Section: Abstract Frameworkmentioning
confidence: 99%
“…Second, it suggests an "ideal setting" for Petrov-Galerkin schemes from which numerically feasible versions can be derived in a systematic manner. A slightly different but related approach has been proposed in [9] for a more restricted scope of problems.…”
Section: Abstract Frameworkmentioning
confidence: 99%
“…In fact, in the linear case it is well known that there is a mixed form of the DPG scheme, and this is precisely the method proposed (for a specific model problem) by Cohen et al [11]. As we will see, our scheme can also be viewed as an extension of this mixed form.…”
mentioning
confidence: 71%
“…Introducing (11) in the stationary condition associated with problem (10), one can derive a gradient-type algorithm that can be viewed as an extension of algorithms introduced in [17,14] to nonlinear approximation in S M . This algorithm reads at a given iteration Ă°k Ăž 1Þ: knowing u…”
Section: Direct Construction With Low-rank Approximation Of An Auxilimentioning
confidence: 99%