Displaying similar documents to “Stabilization methods in relaxed micromagnetism”

Robust error estimates for finite element discretizations of the heat equation with discontinuous coefficients

Stefano Berrone (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this work we derive error estimates based on equations residuals for the heat equation with discontinuous diffusivity coefficients. The estimates are based on a fully discrete scheme based on conforming finite elements in each time slab and on the A-stable -scheme with 1/2 ≤ ≤ 1. Following remarks of [Picasso, . (1998) 223–237; Verfürth, (2003) 195–212] it is easy to identify a time-discretization error-estimator and a space-discretization error-estimator. In...

Finite element approximations of a glaciology problem

Sum S. Chow, Graham F. Carey, Michael L. Anderson (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper we study a model problem describing the movement of a glacier under Glen's flow law and investigated by Colinge and Rappaz [Colinge and Rappaz, (1999) 395–406]. We establish error estimates for finite element approximation using the results of Chow [Chow, (1992) 769–780] and Liu and Barrett [Liu and Barrett, (1996) 98–106] and give an analysis of the convergence of the successive approximations used in [Colinge and Rappaz,...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...