解Burgers方程的分裂型最小二乘混合元方法

Two Splitting Least-Squares Mixed Element Methods For Burgers Equations

本文对Burgers方程提出了Euler型分裂的最小二乘混合元格式,该格式最大的优点是将耦合的方程组系统分裂成为两个独立的子系统进行求解,从而在很大程度上降低了原问题的求解难度和规模,并通过引入适当的最小二乘泛函,得到原未知量的最优阶L2(Ω) 模误差估计。

Two splitting least-squares mixed element methods are proposed to simulate Burgers equation in this paper. The advantage of this methods is that the coupled system can be split into two independent sub-systems and then reduce the difficulty and scale of primal problems. Theoerical analysis shows that the methods yield the approximate solutions for the primal problems with optimal accuracy in L2(Ω) norm.