#### Filter Results:

#### Publication Year

1992

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Lars B. Wahlbin
- SIAM Review
- 1992

- Wolfgang Hoffmann, Alfred H. Schatz, Lars B. Wahlbin, Gabriel Wittum
- Math. Comput.
- 2001

A class of a posteriori estimators is studied for the error in the maximum-norm of the gradient on single elements when the finite element method is used to approximate solutions of second order elliptic problems. The meshes are unstructured and, in particular, it is not assumed that there are any known superconvergent points. The estimators are based on… (More)

- Nikolai Yu. Bakaev, Vidar Thomée, Lars B. Wahlbin
- Math. Comput.
- 2003

Let Ω be a convex domain with smooth boundary in R d. It has been shown recently that the semigroup generated by the discrete Laplacian for quasi-uniform families of piecewise linear finite element spaces on Ω is analytic with respect to the maximum-norm, uniformly in the mesh-width. This implies a resolvent estimate of standard form in the maximum-norm… (More)

- Vidar Thomée, Lars B. Wahlbin
- Math. Comput.
- 2008

In 1973, H. Fujii investigated discrete versions of the maximum principle for the model heat equation using piecewise linear finite elements in space. In particular, he showed that the lumped mass method allows a maximum principle when the simplices of the triangulation are acute, and this is known to generalize in two space dimensions to triangulations of… (More)

- Vidar Thomée, Lars B. Wahlbin
- Numerische Mathematik
- 2000

- Alfred H. Schatz, Lars B. Wahlbin
- Math. Comput.
- 2004

We extend results from Part I about estimating gradient errors elementwise a posteriori, given there for quadratic and higher elements, to the piecewise linear case. The key to our new result is to consider certain technical estimates for differences in the error, e(x 1) − e(x 2), rather than for e(x) itself. We also give a posteriori estimators for second… (More)

- Stig Larsson, Vidar Thomée, Lars B. Wahlbin
- Math. Comput.
- 1998

The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontin-uous Galerkin method with piecewise constant or piecewise linear approximating functions. The analysis presented allows variable time steps which, as will be shown, can then efficiently be selected to match… (More)

- Alfred H. Schatz, Vidar Thomée, Lars B. Wahlbin
- Comput. Meth. in Appl. Math.
- 2010

- Ricardo H. Nochetto, Lars B. Wahlbin
- Math. Comput.
- 2002

We consider finite element operators defined on " rough " functions in a bounded polyhedron Ω in R N. Insisting on preserving positivity in the approximations, we discover an intriguing and basic difference between approximating functions which vanish on the boundary of Ω and approximating general functions which do not. We give impossibility results for… (More)

- Alfred H. Schatz, Lars B. Wahlbin
- SIAM J. Numerical Analysis
- 2003