arXiv subjects

Assyr Abdulle

Publications and source records attributed to Assyr Abdulle.

26 records · Page 2Linked to original sources

arXiv2018

A local discontinuous Galerkin gradient discretization method for linear and quasilinear elliptic equations

A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic problems in high gradient regions. Using the gradient discretization framework we prove convergence of the scheme for linear and quasilinear equations under minimal regularity assumptions. The error due to artificial boundary conditions is also analyzed, shown to be of higher order and shown to depend only locally on the regularity of the solution. Numerical experiments illustrate our theoretical findings and the local method's accuracy is compared against the non local approach

math.NA↗

arXiv2018

Optimal explicit stabilized integrator of weak order one for stiff and ergodic stochastic differential equations

A new explicit stabilized scheme of weak order one for stiff and ergodic stochastic differential equations (SDEs) is introduced. In the absence of noise, the new method coincides with the classical deterministic stabilized scheme (or Chebyshev method) for diffusion dominated advection-diffusion problems and it inherits its optimal stability domain size that grows quadratically with the number of internal stages of the method. For mean-square stable stiff stochastic problems, the scheme has an optimal extended mean-square stability domain that grows at the same quadratic rate as the deterministic stability domain size in contrast to known existing methods for stiff SDEs [A. Abdulle and T. Li. Commun. Math. Sci., 6(4), 2008, A. Abdulle, G. Vilmart, and K. C. Zygalakis, SIAM J. Sci. Comput., 35(4), 2013]. Combined with postprocessing techniques, the new methods achieve a convergence rate of order two for sampling the invariant measure of a class of ergodic SDEs, achieving a stabilized version of the non-Markovian scheme introduced in [B. Leimkuhler, C. Matthews, and M. V. Tretyakov, Proc. R. Soc. A, 470, 2014].

math.NA↗

arXiv2016

Multiscale methods for wave problems in heterogeneous media

In this paper we give a survey on various multiscale methods for the numerical solution of second order hyperbolic equations in highly heterogeneous media. We concentrate on the wave equation and distinguish between two classes of applications. First we discuss numerical methods for the wave equation in heterogeneous media without scale separation. Such a setting is for instance encountered in the geosciences, where natural structures often exhibit a continuum of different scales, that all need to be resolved numerically to get meaningful approximations. Approaches tailored for these settings typically involve the construction of generalized finite element spaces, where the basis functions incorporate information about the data variations. In the second part of the paper, we discuss numerical methods for the case of structured media with scale separation. This setting is for instance encountered in engineering sciences, where materials are often artificially designed. If this is the case, the structure and the scale separation can be explicitly exploited to compute appropriate homogenized/upscaled wave models that only exhibit a single coarse scale and that can be hence solved at significantly reduced computational costs.

math.NA↗

arXiv2015

Localized orthogonal decomposition method for the wave equation with a continuum of scales

This paper is devoted to numerical approximations for the wave equation with a multiscale character. Our approach is formulated in the framework of the Localized Orthogonal Decomposition (LOD) interpreted as a numerical homogenization with an $L^2$-projection. We derive explicit convergence rates of the method in the $L^{\infty}(L^2)$-, $W^{1,\infty}(L^2)$- and $L^{\infty}(H^1)$-norms without any assumptions on higher order space regularity or scale-separation. The order of the convergence rates depends on further graded assumptions on the initial data. We also prove the convergence of the method in the framework of G-convergence without any structural assumptions on the initial data, i.e. without assuming that it is well-prepared. This rigorously justifies the method. Finally, the performance of the method is demonstrated in numerical experiments.

math.NA↗

arXiv2015

A reduced basis localized orthogonal decomposition

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high dimensional Finite Element space into a low dimensional space with comparably good approximation properties and a remainder space with negligible information. The low dimensional space is spanned by locally supported basis functions associated with the node of a coarse mesh obtained by solving decoupled local problems. However, for parameter dependent multiscale problems, the local basis has to be computed repeatedly for each choice of the parameter. To overcome this issue, we propose an RB approach to compute in an "offline" stage LOD for suitable representative parameters. The online solution of the multiscale problems can then be obtained in a coarse space (thanks to the LOD decomposition) and for an arbitrary value of the parameters (thanks to a suitable "interpolation" of the selected RB). The online RB-LOD has a basis with local support and leads to sparse systems. Applications of the strategy to both linear and nonlinear problems are given.

math.NA↗

arXiv2012

A priori and a posteriori $W^{1,\infty}$ error analysis of a QC method for complex lattices

In this paper we prove a priori and a posteriori error estimates for a multiscale numerical method for computing equilibria of multilattices under an external force. The error estimates are derived in a $W^{1,\infty}$ norm in one space dimension. One of the features of our analysis is that we establish an equivalent way of formulating the coarse-grained problem which greatly simplifies derivation of the error bounds (both, a priori and a posteriori). We illustrate our error estimates with numerical experiments.

math.NA↗

arXiv2012

Numerical Methods for Multilattices

Among the efficient numerical methods based on atomistic models, the quasicontinuum (QC) method has attracted growing interest in recent years. The QC method was first developed for crystalline materials with Bravais lattice and was later extended to multilattices (Tadmor et al, 1999). Another existing numerical approach to modeling multilattices is homogenization. In the present paper we review the existing numerical methods for multilattices and propose another concurrent macro-to-micro method in the numerical homogenization framework. We give a unified mathematical formulation of the new and the existing methods and show their equivalence. We then consider extensions of the proposed method to time-dependent problems and to random materials.

math.NA↗

arXiv2010

Homogenization-based Analysis of Quasicontinuum Method for Complex Crystals

Among the efficient numerical methods based on atomistic models, the quasicontinuum (QC) method, introduced by Tadmor, Ortiz, and Phillips (1996), has attracted growing interest in recent years. Originally, the QC method was developed for materials with simple crystalline lattice (simple crystals) and later was extended to complex lattice (Tadmor et al, 1999). In the present paper we formulate the QC method for complex lattices in a homogenization framework and perform analysis of such a method in a 1D setting. We also present numerical examples showing that the convergence results are valid in a more general setting.

math.NA↗