Consistent SUPG-method for transient transport problems: Stability and convergence
By Erik Burman. 2010
149 citations recorded by the source corpus.
We consider the time/space discretization of the transient advection equation. Discretization in space is performed by the streamline upwind Petrov-Galerkin method and in time we use an A-stable finite difference operator. The formulation is strongly consistent in the sense that the time derivative is included in the stabilization term. Uniform stability of the general formulation is proved under a regularity condition on data, or a moderate inverse CFL-condition that allows for optimal choices of the discretization parameters. Both the backward Euler method (BDF1), the Crank-Nicolson scheme and the second-order backward differentiation formula (BDF2) enter the framework and quasi-optimal convergence is proved for these schemes.
Subfields: Computational Mechanics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/66e2c7d5463ae14c50baf05739957c465ef92810
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Numerical Analysis
Citations in the corpus
- An operator-splitting Galerkin/SUPG finite element method for population balance equations : stability and convergence (2012, background): “In [2], unconditional stability has been proved for smooth data.”