Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
470810 | Computers & Mathematics with Applications | 2016 | 14 Pages |
Abstract
This article is concerned with the numerical solution of convex variational problems. More precisely, we develop an iterative minimisation technique which allows for the successive enrichment of an underlying discrete approximation space in an adaptive manner. Specifically, we outline a new approach in the context of hphp-adaptive finite element methods employed for the efficient numerical solution of linear and nonlinear second-order boundary value problems. Numerical experiments are presented which highlight the practical performance of this new hphp-refinement technique for both one- and two-dimensional problems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Paul Houston, Thomas P. Wihler,