Omar Lakkis

Dr. Omar Lakkis

Department of Mathematics, University of Sussex, Brighton GB-BN1 9QH, UK
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2006 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
Omar LakkisOmar Lakkis
Omar Lakkis
CMCharalambos Makridakis
Charalambos Makridakis
We derive a posteriori error estimates for fully discrete approximations to solutions of linear parabolic equations. The space discretization uses finite element spaces that are allowed to change in time. Our main tool is an appropriate adaptation of the elliptic reconstruction technique, introduced by Makridakis and Nochetto. We derive novel a posteriori estimates for the norms of L ∞ ⁡ ( 0 , T ; L 2 ⁡ ( Ω ) ) \operatorname {L}_\infty (0,T;\operatorname {L}_2(\Omega )) and the higher order spaces, L ∞ ⁡ ( 0 , T ; H 1 ⁡ ( Ω ) ) \operatorname {L}_\infty (0,T;\operatorname {H}^1(\Omega )) and H 1 ⁡ ( 0 , T ; L 2 ⁡ ( Ω ) ) \operatorname {H}^1(0,T;\operatorname {L}_2(\Omega )) , with optimal orders of convergence.

1 January 2013 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
Omar LakkisOmar Lakkis
Omar Lakkis
TPTristan Pryer
Tristan Pryer
We present a Galerkin method with piecewise polynomial continuous elements for fully nonlinear elliptic equations. A key tool is the discretization proposed in Lakkis and Pryer, 2011, allowing us to work directly on the strong form of a linear PDE. An added benefit to making use of this discretization method is that a recovered (finite element) Hessian is a byproduct of the solution process. We build on the linear method and ultimately construct two different methodologies for the solution of second order fully nonlinear PDEs. Benchmark numerical results illustrate the convergence properties of the scheme for some test problems as well as the Monge--Ampère equation and the Pucci equation.

1 January 2011 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
Omar LakkisOmar Lakkis
Omar Lakkis
TPTristan Pryer
Tristan Pryer
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements and applied directly to the nonvariational (nondivergence) form of a second order linear elliptic problem. The key tools are an appropriate concept of “finite element Hessian” and a Schur complement approach to solving the resulting linear algebra problem. The method is illustrated with computational experiments on three linear and one quasi-linear PDE, all in nonvariational form.

1 January 2013 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
Omar LakkisOmar Lakkis
Omar Lakkis
Anotida MadzvamuseAnotida Madzvamuse
Anotida Madzvamuse
CVChandrasekhar Venkataraman
Chandrasekhar Venkataraman
We present and analyze an implicit--explicit timestepping procedure with finite element spatial approximation for semilinear reaction--diffusion systems on evolving domains arising from biological models, such as Schnakenberg's (1979). We employ a Lagrangian formulation of the model equations which permits the error analysis for parabolic equations on a fixed domain but introduces technical difficulties, foremost the space-time dependent conductivity and diffusion. We prove optimal-order error estimates in the ${L}_{\infty}(0,T;{L}_{2}(\varOmega))$ and ${L}_{2}(0,T;{H}^{1}(\varOmega))$ norms, and a pointwise stability result. We remark that these apply to Eulerian solutions. Details on the implementation of the Lagrangian and the Eulerian scheme are provided. We also report on a numerical experiment for an application to pattern formation on an evolving domain.

1 January 2011 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
EGEmmanuil H. Georgoulis
Emmanuil H. Georgoulis
Omar LakkisOmar Lakkis
Omar Lakkis
JVJuha M. Virtanen
Juha M. Virtanen
We derive energy-norm a posteriori error bounds for an Euler time-stepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For accessibility, we address first the spatially semidiscrete case and then move to the fully discrete scheme by introducing the implicit Euler time-stepping. All results are presented in an abstract setting and then illustrated with particular applications. This enables the error bounds to hold for a variety of discontinuous Galerkin methods, provided that energy-norm a posteriori error bounds for the corresponding elliptic problem are available. To use this method in practice, we apply it to the interior penalty discontinuous Galerkin method, for which new a posteriori error bounds are derived. For the analysis of the time-dependent problems we use the elliptic reconstruction technique, and we deal with the nonconforming part of the error by deriving appropriate computable a posteriori bounds for it. We illustrate the theory with a series of numerical experiments aimed at (1) exploring practically the reliability and efficiency of the derived a posteriori estimates, and (2) testing them in an adaptive algorithm implementation.

1 January 2009 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
ADAlan Demlow
Alan Demlow
Omar LakkisOmar Lakkis
Omar Lakkis
CMCharalambos Makridakis
Charalambos Makridakis
We derive a posteriori error estimates in the $L_\infty((0,T];L_\infty(\Omega))$ norm for approximations of solutions to linear parabolic equations. Using the elliptic reconstruction technique introduced by Makridakis and Nochetto and heat kernel estimates for linear parabolic problems, we first prove a posteriori bounds in the maximum norm for semidiscrete finite element approximations. We then establish a posteriori bounds for a fully discrete backward Euler finite element approximation. The elliptic reconstruction technique greatly simplifies our development by allowing the straightforward combination of heat kernel estimates with existing elliptic maximum norm error estimators.