arrow
返回

Consistent SUPG-method for transient transport problems: Stability and convergence

delete2010-03-01
delete82
PRE
AI
E
Erik Burman *
DOI:10.1016/j.cma.2009.11.023delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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. (c) 2009 Elsevier B.V. All rights reserved.
Keyword:
SUPG
Time discretization
Crank-Nicolson
Backward Euler
Stability
Convergence
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computer Methods in Applied Mechanics and Engineering 封面图
Computer Methods in Applied Mechanics and Engineering
IF:
7.3
论文数:
1.3W
被引数:
5.6W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
学者 查看更多内容