Mitchell Luskin
University of Minnesota
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Mitchell Luskin.
Acta Numerica | 1996
Mitchell Luskin
Microstructure is a feature of crystals with multiple symmetry-related energy-minimizing states. Continuum models have been developed explaining microstructure as the mixture of these symmetry-related states on a fine scale to minimize energy. This article is a review of numerical methods and the numerical analysis for the computation of crystalline microstructure.
SIAM Journal on Numerical Analysis | 1982
Mitchell Luskin; Rolf Rannacher
We analyze the Galerkin approximation of the general second-order parabolic initial-boundary value problem. For the second-order continuous time method with initial data only in
Mathematics of Computation | 2003
Bernardo Cockburn; Mitchell Luskin; Chi-Wang Shu; Endre Süli
L^2
Applicable Analysis | 1982
Mitchell Luskin; Rolf Rannacher; Wolfgang L. Wendland
we prove an
SIAM Journal on Numerical Analysis | 1991
Charles Collins; David Kinderlehrer; Mitchell Luskin
L^2
SIAM Journal on Numerical Analysis | 2009
Matthew Dobson; Mitchell Luskin
error estimate of order
SIAM Journal on Numerical Analysis | 1992
Mitchell Luskin; Ling Ma
O({{h^2 } / t})
Acta Numerica | 2013
Mitchell Luskin; Christoph Ortner
. Analogous results are shown to hold for the error in negative Sobolev norms and for the time derivative of the error. Our analysis uses only elementary energy techniques and the same techniques are shown to give a simple analysis of the backward Euler time discretization.
Mathematics of Computation | 1991
Charles Collins; Mitchell Luskin
We consider the enhancement of accuracy, by means of a simple post-processing technique, for finite element approximations to transient hyperbolic equations. The post-processing is a convolution with a kernel whose support has measure of order one in the case of arbitrary unstructured meshes; if the mesh is locally translation invariant, the support of the kernel is a cube whose edges are of size of the order of Δx only. For example, when polynomials of degree k are used in the discontinuous Galerkin (DG) method, and the exact solution is globally smooth, the DG method is of order k+1/2 in the L2-norm, whereas the post-processed approximation is of order 2k + 1; if the exact solution is in L2 only, in which case no order of convergence is available for the DG method, the post-processed approximation converges with order k + 1/2 in L2(Ω0), where Ω0 is a subdomain over which the exact solution is smooth. Numerical results displaying the sharpness of the estimates are presented.
Journal of Differential Equations | 1991
Eugene B. Fabes; Mitchell Luskin; George R. Sell
The Crank-Nicolson scheme for discretizing linear parabolic equations converges at the rate of only o(1) in L 2 for initial data in L 2. It is shown that smoothing by adding four backward Euler steps to the scheme improves the convergence rate to 0(k 2/t 2). AMS(MOS): 65M10