Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
471258 | Computers & Mathematics with Applications | 2014 | 30 Pages |
Abstract
We discuss well-posedness and convergence theory for the DPG method applied to a general system of linear Partial Differential Equations (PDEs) and specialize the results to the classical Stokes problem. The Stokes problem is an iconic troublemaker for standard Bubnov–Galerkin methods; if discretizations are not carefully designed, they may exhibit non-convergence or locking. By contrast, DPG does not require us to treat the Stokes problem in any special manner. We illustrate and confirm our theoretical convergence estimates with numerical experiments.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nathan V. Roberts, Tan Bui-Thanh, Leszek Demkowicz,