 Research
 Open Access
 Published:
Convergence of an explicit iterative leapfrog discontinuous Galerkin method for timedomain Maxwell’s equations in anisotropic materials
Journal of Mathematics in Industry volume 8, Article number: 9 (2018)
Abstract
We propose an explicit iterative leapfrog discontinuous Galerkin method for timedomain Maxwell’s equations in anisotropic materials and derive its convergence properties. The a priori error estimates are illustrated by numerical means in some experiments. Motivated by a real application which encompasses modeling electromagnetic wave’s propagation through the eye’s structures, we simulate our model in a 2D domain aiming to represent a simple example of light scattering in the outer nuclear layer of the retina.
Introduction
The human retina is a complex structure in the eye that is responsible for the sense of vision. It is part of the central nervous system and it is composed by several layers, namely the outer nuclear layer that comprises the cells bodies of light sensitive photoreceptors cells, rods and cones (see Fig. 1) [11]. For many diseases that affect the eye, the diagnosis is not straightforward. The sensitivity of this structure makes medical analysis particularly complicated. Most of the diagnoses are made either by direct observation, with the possible injection of dyes, to enhance certain parts of the organ, or by numbing the eye and directly measuring its inner pressure or thickness. There are a number of eyerelated pathologies that can be identified by the detailed analysis of the retinal layers [16].
Optical Coherence Tomography (OCT) is an increasingly popular noninvasive technique that has been successfully used as a diagnostic tool in ophthalmology in the past decades. This method allows the assessment of the human retina in vivo and has been shown to provide functional information. By analysing data acquired through OCT, several retinal pathologies, such as diabetic retinopathy, or macular edema, can be detected in their early stages, before noticeable morphologic alterations on the retina [16]. As OCT standard techniques only provide structural information [14], it is necessary to expand OCT data analysis to account for both structural and functional information. OCT provides also the possibility of evaluating different elements in measuring the retinal nerve fiber layer (RNFL), namely the tendency of RNFL thinning in glaucoma and other diseases that involve optic nerve atrophy. Waveguides with induced anisotropy may worth to be considered for modeling biological waveguides [10].
Maxwell’s equations are a fundamental set of partial differential equations which describe electromagnetic wave interactions with materials. The electromagnetic fields in space are classically described by two field vectors, E and H, respectively electric field and magnetic field. Here we shall consider the time domain Maxwell’s equations in the transverse electric mode, as in [8], where the only nonvanishing components of the electromagnetic fields are \(E_{x}\), \(E_{y}\) and \(H_{z}\). Using the following notation for the vector and scalar curl operators
and assuming no conductivity effects, the equations in the nondimensional form are
where \(E=(E_{x},E_{y})^{T}\) represents the electric field components and \(H=(H_{z})\) represents the magnetic field component. These equations are set and solved on a bounded polygonal domain \(\Omega\subset\mathbb{R}^{2}\).
The electric permittivity of the medium, ϵ, and the magnetic permeability of the medium, μ, are varying in space, being μ a scalar function and ϵ an anisotropic tensor
We assume that electric permittivity tensor ϵ is symmetric and uniformly positive definite for almost every \((x,y) \in\Omega\), and that it is uniformly bounded with a strictly positive lower bound, i.e., there are constants \(\underline{\epsilon}>0\) and \(\overline{\epsilon}> 0\) such that, for almost every \((x,y)\in\Omega\), \(\underline{\epsilon}\xi^{2}\le\xi^{T}\epsilon(x,y)\xi\le\overline{\epsilon}\xi^{2}, \forall\xi\in\mathbb{R}^{2}\). We also assume that there are constants \(\underline{\mu}>0\) and \(\overline{\mu}> 0\) such that, for almost every \((x,y) \in\Omega\), \(\underline{\mu}\le\mu(x,y) \le\overline{\mu}\).
Equations (1) must be complemented by initial conditions \(E(x,y,0) = E_{0}(x,y)\) and \(H(x,y,0)= H_{0}(x,y)\), \((x,y)\in\Omega\), and by proper boundary conditions. Motivated by our application of interest, here we consider absorbing boundary conditions which mimic an open space by absorbing the incident radiation in the truncated computational domain. The first order SilverMüller absorbing boundary conditions (SMABC) are defined by
where \(n=(n_{x},n_{y})^{T}\) is the unit outward normal vector to the boundary and c is the speed with which a wave travels along the direction of the unit normal, defined, using the effective permittivity \(\epsilon _{\mathrm{eff}}=\det(\epsilon)/(n^{T} \epsilon n)\) (see [8]), by \(c =1/\sqrt{\mu\epsilon_{\mathrm{eff}}}\).
We can write Maxwell’s equations (1) in a conservation form
with
The attention to the development of explicit highorder accurate methods for solving timedomain Maxwell’s equations in complex geometries brings to the use of discontinuous Galerkin (DG) methods with finite difference schemes for time discretization. Those methods for timedependent Maxwell’s equations are derived considering them either in firstorder hyperbolic form (see, e.g. [1, 4, 7]) or alternatively in secondorder form as wave equations (see, e.g. [6]). Generally, highorder explicit schemes for time discretizations require restrictive stability conditions. For these reasons, the onestep explicit time integration methods, like leapfrog schemes, are usually considered since they are computationally efficient per update cycle and easy to implement (see, e.g. [4, 5] and the references therein). The treatment of anisotropic materials within a DGTD framework was discussed for instance in [4] (with central fluxes) and in [8] (with upwind fluxes). The stability analysis of DGTD methods for Maxwell’s equations was considered in [4], where the scheme that is defined with the central fluxes leads to a locally implicit time method in the case of SMABC, and [9], where the scheme is defined with the upwind fluxes leading to an implicit method. In [1] we extends the results in [4] and [9] to a fully explicit in time method for both cases, central fluxes and upwind fluxes. The error estimates derived therein show that the method is only first order convergent in time when SMABC are considered.
In the present work we propose an iterative predictorcorrector method based on the explicit method investigated in [1], resulting a fully explicit method that is second order convergent in time for the SMABC case. In the Sect. 2 we prove that the explicit iterative method converges to a second order in time implicit method and we deduce the a priori error estimates for the fully discrete scheme. In Sect. 3 we illustrate the theoretical results with some numerical examples and, in Sect. 4, we apply the numerical method to a computational model that aims to simulate the light scattering through the outer nuclear layer of the retina.
This work was developed in the framework of a more general project that aims to develop a computational model to simulate the electromagnetic wave’s propagation through the eye’s structures in order to create a virtual optical coherence tomography scan [13].
An explicit iterative leapfrog discontinuous Galerkin method
Numerical scheme
Assume that the computational domain Ω is a bounded polygonal set that is partitioned into K triangular elements \(T_{k}\) such that \(\overline{\Omega}= \bigcup_{k} T_{k}\). The finite element space is then taken to be \(V_{N}=\{v \in L^{2}(\Omega )^{3}: v_{T_{k}} \in P_{N}(T_{k})^{3}\}\), where \(P_{N}(T_{k})\) denotes the space of polynomials of degree less than or equal to N defined on \(T_{k}\). On each element \(T_{k}\), the solution fields \({q}_{k}(x,y,t)= (E_{x}(x,y,t), E_{y}(x,y,t), H_{z}(x,y,t))^{T}\) are approximated by the piecewise polynomial functions \(\hat{q}_{k}(x,y,t) = (\hat{E}_{xk}(x,y,t),\hat{E}_{yk}(x,y,t), \hat{H}_{zk}(x,y,t))^{T}\).
In order to deduce the method, we start by multiplying equation (4) by test functions \(v \in V_{N}\), usually the Lagrange polynomials, and integrate over each element \(T_{k}\). The next step is to employ one integration by parts and to substitute in the resulting contour integral the flux F by a numerical flux \(F^{*}\). Reversing the integration by parts yields
where n is the outward pointing unit normal vector of the contour.
The approximate fields are allowed to be discontinuous across element boundaries. In this way, we introduce the notation for the jumps of the field values across the interfaces of the elements, \([\hat{E}]=\hat{E}^{}\hat{E}^{+}\) and \([\hat{H}]=\hat{H}^{}\hat{H}^{+}\), where the superscript “+” denotes the neighboring element and the superscript “−” refers to the local cell. Furthermore we introduce, respectively, the cellimpedances and cellconductances \(Z^{\pm}=\mu^{\pm}c^{\pm}\) and \(Y^{\pm}= (Z^{\pm} )^{1}\). At the outer cell boundaries we set \(Z^{+}=Z^{}\).
The coupling between elements is introduced via numerical flux, defined by
The parameter \(\alpha\in[0,1]\) in the numerical flux can be used to control dissipation. Taking \(\alpha=0\) yields a non dissipative central flux while \(\alpha=1\) corresponds to the classic upwind flux.
To define the fully discrete scheme, we divide the time interval into M subintervals by the points \(0=t^{0}< t^{1}<\cdots<t^{M}=T\), where \(t^{m}=m \Delta t\), Δt is the time step size and \(T+ \Delta t/2 \leq T_{f}\). The unknowns related to the electric field are approximated at integer timestations \(t^{m}\) and are denoted by \(\hat{E}_{k}^{m}=\hat{E}_{k}(\cdot,t^{m})\). The unknowns related to the magnetic field are approximated at halfinteger timestations \(t^{m+1/2}=(m+ \frac{1}{2}) \Delta t\) and are denoted by \(\hat{H}_{k}^{m+1/2}=\hat{H}_{k}(\cdot,t^{m+1/2})\).
With the above setting, we can now formulate the iterative leapfrog DG method. The process starts with an approximation to the initial data which we denote by \((\hat{E}_{x}^{0}, \hat{E}_{y}^{0}, \hat{H}_{z}^{1/2})^{T} \in V_{N}\). For each \(m=0,1,\ldots, M1\), we initialize the iterative process by
The iterative scheme consists in calculating \((\hat{E}_{x}^{m+1},\hat{E}_{y}^{m+1}, \hat{H}_{z_{k}}^{m+3/2})^{T}\in V_{N}\), for all \((u, v, w)^{T} \in V_{N}\), in the following way. For \(n=0,1,2, \ldots\) , we find \(\hat{E}_{x_{k}}^{m+1,n+1}\) and \(\hat{E}_{y_{k}}^{m+1,n+1}\) such that
until the stopping criterion \(\\hat{E}^{m+1,n+1}\hat{E}^{m+1,n}\_{L^{2}(\Omega)}<\operatorname{tol}\) is satisfied for some predefined small constant tol. Then the correspondent numerical solution is denoted by \((\hat{E}_{x_{k}}^{m+1}, \hat{E}_{y_{k}}^{m+1})\). In the same way, we find \(\hat{H}_{z_{k}}^{m+3/2}\) by calculating \(\hat{H}_{z_{k}}^{m+3/2,n+1}\), for \(n=0,1,2, \ldots\) , such that
until the stopping criterion \(\\hat{H}^{m+1,n+1}\hat{H}^{m+1,n}\_{L^{2}(\Omega)}<\operatorname{tol}\) is satisfied. Here, \((\cdot,\cdot)_{T_{k}}\) and \((\cdot,\cdot)_{\partial T_{k}}\) denote the classical \(L^{2}(T_{k})\) and \(L^{2}(\partial T_{k})\) innerproducts and \(\hat{E}^{[m+1/2,n]}\) and \(\hat{H}^{[m+1,n]}\) are the average approximations
The SMABC are discretised as in [1, 5], that is, for both upwind and central fluxes, consider \(\alpha=1\) for the numerical flux at the outer boundary and \([\tilde{E}_{x}]=\tilde{E}_{x}^{}\), \([\tilde{E}_{y}]=\tilde{E}_{y}^{}\) and \([\tilde{H}_{z}]=\tilde{H}_{z}^{}\). We want to remark that for the case \(\alpha=0\), the inner iterations change the solution only in the triangles which have boundary edges, accordingly to the discretization of the SMABC.
This iterative scheme may be viewed as a predictorcorrector type method of the form P(C)^{niter}, where P represents the predictor step (the iteration \(n=0\)), C the correction steps (iterations \(n=1,2,\ldots \)), and niter the number of correction steps needed until the stopping criteria is verified. If we consider no inner iterations (\(\operatorname{niter}=0\)) we obtain the explicit method considered in [1].
Convergence result
We will show that, under a suitable stability condition, the solution of the iterative predictorcorrector scheme (5)–(7) converges to the solution of the underlying implicit method. The implicit method is defined as follows: given an initial approximation \((\tilde{E}_{x}^{0}, \tilde{E}_{y}^{0}, \tilde{H}_{z}^{1/2})^{T} \in V_{N}\), for each \(m=0,1,\ldots, M1\), we compute \((\tilde{E}_{x}^{m+1}, \tilde{E}_{y}^{m+1}, \tilde{H}_{z}^{m+3/2})^{T} \in V_{N}\) such that, for all \((u, v, w)^{T} \in V_{N}\),
where we consider the average approximations \(\tilde{E}^{[m+1/2]}\) for \(\tilde{E}^{m+1/2}\) and \(\tilde{H}^{[m+1]}\) for \(\tilde{H}^{m+1}\) given by
We note that the numerical solutions are defined implicitly, since the upwind fluxes involve the unknowns \(\tilde{E}_{x}^{m+1}\), \(\tilde{E}_{y}^{m+1}\) and \(\tilde{H}_{z}^{m+3/2}\).
Let \(h_{k}\) be the diameter of the triangle \(T_{k} \in\mathcal {T}_{h}\), and h be the maximum element diameter, that is, \(h_{k}=\sup_{P_{1},P_{2} \in T_{K}} \P_{1}P_{2}\\), \(h=\max_{T_{k} \in\mathcal {T}_{h}}\{h_{k}\}\). We assume that the mesh is regular in the sense that there exists a constant \(\tau>0\) such that for all \(T_{k} \in\mathcal {T}_{h}\), \(\frac {h_{k}}{\tau_{k}} \leq\tau\), where \(\tau_{k}\) denotes the maximum diameter of a ball inscribed in \(T_{k}\). It may be proved (see [12]) that, for any \(u \in P_{N}(T_{k})\), the following trace inequality holds
where \(f_{k}\) is an edge of \(T_{k}\) and \(C_{\tau}\) a positive constant independent of \(h_{k}\) and N but dependent on the shaperegularity τ.
Let us now define the difference between two successive numeric values of the electromagnetic fields by
for \(n = 0, 1, 2, \ldots \) .
We prove the following theorem by finding upper bounds for \(\delta_{n} \hat{E}_{x_{k}}^{m+1}\), \(\delta_{n} \hat{E}_{y_{k}}^{m+1}\) and \(\delta_{n} \hat{H}_{z_{k}}^{m+3/2}\).
Theorem 1
The solution of the iterative predictorcorrector scheme (5)–(7) converges to the solution of the method (8)–(10) provided that the stability condition of the underlying explicit method (i.e., (5)–(7) taking only the iteration \(n=0\)) is satisfied, that is (see [1])
with
where \(C_{\tau}\) satisfies the trace inequality (12), \(C_{\mathrm{inv}}\) is a positive constant independent of \(h_{k}\) and N, and \(Z_{k}\) and \(Y_{k}\) denote respectively the cellimpedance Z and the cellconductance Y inside the triangle \(T_{k} \in\mathcal {T}_{h}\).
Proof
For simplicity of the prove, we consider that the mesh \(\mathcal {T}_{h}\) is conforming.
The stability condition (13) ensures that \(\\delta_{0}\hat{E}^{m+1}\_{L^{2}(\Omega)}\) and \(\\delta _{0}\hat{H}_{z}^{m+3/2}\_{L^{2}(\Omega)}\) are bounded for all \(m=0,1,\ldots,M1\).
Let us denote by \(F^{\mathrm{int}}\) the set of internal edges and \(F^{\mathrm{ext}}\) the set of edges that belong to the boundary δΩ. Let \(v_{k}\) be the set of indices of the neighbouring elements of \(T_{k}\). For each \(i\in v_{k}\), we consider the internal edge \(f_{ik} = T_{i}\cap T_{k}\), and we denote by \(n_{ik}\) the unit normal oriented from \(T_{i}\) towards \(T_{k}\). For each boundary edge \(f_{k} = T_{k} \cap\delta\Omega\), \(n_{k}\) is taken to be the unitary outer normal vector to \(f_{k}\).
Taking the difference of (5)–(7) between two successive iterations, \(n+1\) and n, and replacing \(u_{k}\), \(v_{k}\) and \(w_{k}\) by, respectively, \(\delta_{n} \hat{E}_{x_{k}}^{m+1}\), \(\delta_{n} \hat{E}_{y_{k}}^{m+1}\) and \(\delta_{n} \hat{H}_{z_{k}}^{m+3/2}\) and summing over all elements \(T_{k} \in\mathcal {T}_{h}\), we obtain
Then
and
So
Consequently, considering (12), we obtain
Taking the following condition into account (that results from (13))
we conclude that the sequences of general terms \(\ \delta_{n} \hat{E}^{m+1} \_{L^{2}(\Omega)}\) and \(\ \delta_{n} \hat{H}_{z_{k}}^{m+3/2}\_{L^{2}(\Omega)}\), \(n=0,1,\ldots\) , are decreasing and converge to 0. Then, the limit solution, as n tends to the infinity, of the iterative predictorcorrector scheme (5)–(7) converges to the unique solution of the method (8)–(10). □
From the proof of the previous theorem, if (13) is satisfied, we have that
and
where \(C_{*}\) is dependent on the material properties ϵ and μ, on the properties of the space discretization namely N and h and on the time step Δt,
For a given m, it is possible to have an estimate for the number of inner iterations needed to satisfy the stopping criterion defined by tol, considering the approximation
and so
The next theorem establishes that the implicit method is second order convergent in time and arbitrary high order in space. So, with the previous result, we may conclude that, if a sufficient number of inner iterations is performed, i.e, if niter is sufficiently large, the iterative predictorcorrector scheme has, in practice, similar convergence properties.
Theorem 2
Let us consider the implicit leapfrog DG method (8)–(10) complemented with the discrete boundary conditions defined in Sect. 2.1 and suppose that the solution of the Maxwell’s equations (1) complemented by (3) has the following regularity: \(E_{x}, E_{y}, H_{z} \in L^{\infty}(0,T_{f};H^{s+1}(\Omega))\), \(\frac{\partial E_{x}}{\partial t}, \frac{\partial E_{y}}{\partial t}, \frac{\partial H_{z}}{\partial t} \in L^{2} (0,T_{f};H^{s+1}(\Omega) \cap L^{\infty}(\partial \Omega))\) and \(\frac{\partial^{2} E_{x}}{\partial t^{2}}\), \(\frac {\partial^{2} E_{y}}{\partial t^{2}}\), \(\frac{\partial^{2} H_{z}}{\partial t^{2}}\) ∈ \(L^{2}(0,T_{f};H^{1}(\Omega))\), \(s \geq0\). If the time step Δt satisfies
where \(C_{\mathrm{inv}}\) and \(C_{\tau}\) are the positive constants defined in the previous theorem, then
holds, where C is a generic positive constant independent of Δt and the mesh size h.
Proof
Follows the steps of the proof of Theorem 4.2 in [1]. □
Numerical results and discussion
To illustrate the theoretical results of the previous section, we consider the model problem (1) defined in the square \(\Omega= (1,1)^{2}\), complemented by initial conditions and SMABC (3). In order to make it easier to find examples with known exact solution and consequently with the possibility to compute the error of the numerical solution, source terms were introduced in the model. The simulation time is fixed at \(T = 1\) and in all tests we set \(\mu= 1\) and ϵ is given by (2), with \(\epsilon _{xx}=4x^{2}+y^{2}+1\), \(\epsilon_{yy}=x^{2}+1\) and \(\epsilon_{xy}=\epsilon _{yx}=\sqrt{x^{2}+y^{2}}\). The source terms are defined in such way that the problem has the exact solution
To illustrate the order of convergence in space, we fix \(\Delta t = 10^{5 }\), except when \(N=4\) where we consider \(\Delta t=10^{6}\). In Fig. 2 we plot the discrete \(L^{2}\)error of the \(\tilde{E}_{x}\) component of electric field for the explicit leapfrog method depending on the maximum element diameter of each mesh, for different degrees for the polynomial approximation, for both central and upwind fluxes. The vertical and horizontal axis are scaled logarithmically. The numerical convergence rate is approximated by the slope of the linear regression line. For central flux, the numerical convergence rate is close to the value estimated in Theorem 2, \(\mathcal{O}(h^{N})\), and for upwind flux we observe higher order of convergence, up to \(\mathcal {O}(h^{N+1})\) in some cases. Similar results were obtained for \(\tilde{E}_{y}\) and \(\tilde{H}_{z}\).
To visualize the convergence order in time, the polynomial degree and the number of elements have been set to \(N = 8\) and \(K = 800\), respectively. The results plotted in Fig. 3 illustrate the first order convergency in time for the explicit leapfrog method and show that the second order is recovered when the predictorcorrector method is considered with just one correction step: scheme P(C)^{1}. These results correspond to upwind fluxes. The experiments using central fluxes show analogous results in terms of order of convergence in time.
In all the experiments we performed we have observed that second order convergence in time is achieved with only one correction step of the method. So, in practice, it is more efficient to consider only one inner iteration instead of doing enough inner iterations until a certain prescribed tolerance tol is achieved.
Modeling scattered electromagnetic wave’s propagation through eye’s structures
This work is part of a research project which aims to develop a cellular model of the human retina able to simulate different retinal/cellular conditions and how these changes are translated to an Optical Coherence Tomography scan [13]. Simulating the full complexity of the retina, in particular the variation of the size and shape of each structure, distance between them and the respective refractive indexes, requires a rigorous approach that can be achieved by solving Maxwell’s equations. As the interest is to acquire the backscattered light intensity, we start this section by the scattered field formulation. Then we build up a two dimensional model which tries to represent a single nucleus of the outer nuclear layer (ONL) of the retina. The performance of our method is examined by simulating the light scattering in this 2D domain. The evolution of the scattering field intensity in time is obtained using the predictorcorrector DG method.
Optical coherence tomography
Optical Coherence Tomography (OCT) its an imaging technology that produces high resolution crosssectional images of the internal microstructure of living tissue, widely used in ophthalmological exams. This technology’s working principle is analogous to ultrasound, but it uses light instead of sound to locate subtle differences in the tissue being analysed. Discontinuities in the refractive index of the tissue give rise to light scattering, with some light backscattered to the detector. Factors such as the shape and size of the scatterer, wavelength of the incident light and refractive index differences have an impact on the amount of backscattered light. During a scan, the OCT machine directs a light beam into the retina and extracts, through interferometry, the backscattered light intensity of retinal structures and their depth location in an Ascan (see Fig. 4). By transversely moving the light beam, several Ascans can be collected into a crosssectional image – a Bscan. Usually, several cross sectional images are acquired by probing an azimuthal direction and combined into a volume.
The scattered field formulation
We can exploit the linearity of the Maxwell’s equations in order to separate the electromagnetic fields (E, H) into incident fields (\(E^{i}\), \(H^{i}\)) and scattered components (\(E^{s}\), \(H^{s}\)), i.e., \(E = E^{s} + E^{i}\) and \(H = H^{s} + H^{i}\).
Assuming that the incident field is also a solution of the Maxwell’s equations we obtain in the same way as in [17], the scattered field formulation,
with the source terms
where \(\epsilon^{i}\) and \(\mu^{i}\) represent, respectively, the relative permittivity and permeability of the medium in which the incident field propagates in the absence of scatterers (in the background medium). Additionally, using this formulation it is straightforward to specify an incident wave using an analytic formula.
The intensity of the light that hits the OCT detector defines the output signal. Hence, we are interested in computing the scattered field intensity,
Light scattering in the outer nuclear layer
We use our numerical model to simulate light scattering in the ONL. This layer has a special relevance among the retina’s layers as it consistently presents the characteristics of diabetic macular edema [2, 3]. The ONL is mostly populated by the cells bodies of light sensitive photoreceptor cells (rods and cons). Thus, we postulate that the main contribution to light scattering in this layer comes from the nucleus [15], as it is the biggest organelle in the soma and presents a high refractive index difference to the surrounding medium. As such, the ONL can be modelled as a population of spherical nuclei in an homogenous medium. As a proof of concept we present a simple simulation in a two dimensional square domain which contains circles that aims to represent, respectively, a single nucleus and three nuclei in the ONL. The permittivity inside the circles and in the background domain has different values.
Let us consider equations (15)–(17), in \(\Omega=(1,1)^{2}\), complemented with SMABC and null initial conditions. The absorbing boundary conditions are chosen for the model as they avoid undesirable reflections that invade the computational domain. In the first experiment we will consider the case of just one circle: \({\mathcal {C}} = \{(x,y)\in\Omega: x^{2}+y^{2}<0.25\}\). In the second example we will consider the case of three circles: \({\mathcal {C}}_{1} = \{(x,y)\in\Omega: x^{2}+(y0.5)^{2}<0.01\}\); \({\mathcal {C}}_{2} = \{(x,y)\in\Omega: x^{2}+y^{2}<0.01\}\); \({\mathcal {C}}_{3} = \{(x,y)\in\Omega: x^{2}+(y+0.5)^{2}<0.01\}\). In the experiments the relative permittivity and permeability and magnetic permeability are considered as constants, \(\epsilon^{i}=1\) and \(\mu^{i}=\mu=1\). The electric permittivity is considered as a diagonal matrix with \(\epsilon_{xx}(x,y)=\epsilon_{yy}(x,y)=1.2\) for \((x,y)\) inside the circles and \(\epsilon_{xx}(x,y)=\epsilon_{yy}(x,y)=1\) otherwise. For the incident wave we consider the planar wave \(E_{y}^{i}(x,t) = \cos(10(xt))\).
For the simulation we used with predictorcorrector DG method defined in Sect. 2 with just one correction step (scheme P(C)^{1}), considering \(\alpha=0\) (central flux) and the approximation polynomial degree \(N=4\). The time step was chosen to be \(\Delta t=0.002\) and the final simulation time is \(T = 0.8\). The meshes are illustrated in Fig. 5. The evolution in time of the scattered field intensity (21) is plotted in Fig. 6. These results show that the scatterers are clearly identified. With this model, we can simulate more complex cellular structures only by changing the electric permittivity tensor ϵ.
Conclusions
We presented an iterative explicit leapfrog DG method for time dependent Maxwell’s equations in anisotropic media, considering SMABC. The numerical scheme is fully explicit and converges to a second order in time implicit method. The results of a set of numerical experiments support the theoretical results and show that the second order of convergency is achieved for any number of inner iterations \(n\ge1\). Moreover we developed a 2D model which simulates the light scattering by a single nucleus in the outer nuclear layer of the retina. This work was elaborated in the framework of a more general project with a real application (see [3, 13]).
Abbreviations
 DG:

discontinuous Galerkin
 OCT:

optical coherence tomography
 ONL:

outer nuclear layer
 RNFL:

retinal nerve fiber layer
 SMABC:

Silver–Müller absorbing boundary conditions
References
 1.
Araújo A, Barbeiro S, Ghalati MK. Stability of a leapfrog discontinuous Galerkin method for timedomain Maxwell’s equations in anisotropic materials. Commun Comput Phys. 2017;21(5):1350–75.
 2.
Ciulla T, Amador A, Zinman B. Diabetic retinopathy and diabetic macular edema. Diabetes Care. 2003;26(9):2653–64.
 3.
Correia A, Pinto L, Araújo A, Barbeiro S, Caramelo F, Menezes P, Morgado M, Serranho P, Bernardes R. Monte Carlo simulation of diabetic macular edema changes on optical coherence tomography data. In: IEEEEMBS international conference on biomedical and health informatics (BHI). 2014. p. 724–7.
 4.
Fezoui L, Lanteri S, Lohrengel S, Piperno S. Convergence and stability of a discontinuous Galerkin timedomain method for the 3D heterogeneous Maxwell’s equations on unstructured meshes. ESAIM: Math Model Numer Anal. 2005;39(6):1149–76.
 5.
González JA. A Discontinuous Galerkin Finite Element Method for the TimeDomain Solution of Maxwell Equations. PhD thesis. Universidad de Granada, España; 2014.
 6.
Grote MJ, Mitkova T. Explicit local timestepping methods for Maxwell’s equations. J Comput Appl Math. 2010;234(12):3283–302.
 7.
Hesthaven JS, Warburton T. Nodal discontinuous Galerkin methods: algorithms, analysis, and applications. New York: Springer; 2008.
 8.
König M, Busch K, Niegemann J. The discontinuous Galerkin timedomain method for Maxwell’s equations with anisotropic materials. Photonics Nanostruct Fundam Appl. 2010;8(4):303–9.
 9.
Li J, Waters JW, Machorro EA. An implicit leapfrog discontinuous Galerkin method for the timedomain Maxwell’s equations in metamaterials. Comput Methods Appl Mech Eng. 2012;223–224:43–54.
 10.
Limeres J, Calvo ML, Enoch JM, Lakshminarayanan V. Light scattering by an array of birefringent optical waveguides: theoretical foundations. J Opt Soc Am B. 2003;20(7):1542–9.
 11.
Mescher AL, Junqueira LCU. Junqueira’s basic histology: text and atlas. 13th ed. New York: McGraw Hill Medical; 2013.
 12.
Riviére B. Discontinuous Galerkin methods for solving elliptic and parabolic equations: theory and implementation. Philadelphia: SIAM; 2008.
 13.
Santos M, Araújo A, Barbeiro S, Caramelo F, Correia A, Marques MI, Pinto L, Serranho P, Bernardes R, Morgado M. Simulation of cellular changes on optical coherence tomography of human retina. In: 37th annual international conference of the IEEE engineering in medicine and biology society. vol. EMBC. 2015. p. 8147–50.
 14.
Schliesser JA, Gallimore G, Kunjukunju N, Sabates NR, Koulen P, Sabates FN. Clinical application of optical coherence tomography in combination with functional diagnostics: advantages and limitations for diagnosis and assessment of therapy outcome in central serous chorioretinopathy. Clin Ophthalmol. 2014;8:2337–45.
 15.
Seet KY, Nieminen TA, Zvyagin AV. Refractometry of melanocyte cell nuclei using optical scatter images recorded by digital Fourier microscopy. J Biomed Opt. 2009;14(4):044031.
 16.
Serranho P, Morgado M, Bernardes R. Optical coherence tomography: a concept review. In: Optical coherence tomography: a clinical and technical update. Berlin: SpringerVerlag; 2012. p. 139–56.
 17.
Taflove A. Computational electrodynamics: the finitedifference timedomain method. Boston: Artech House; 1995.
Acknowledgements
Not applicable.
Availability of data and materials
Please contact the corresponding author for data requests.
Funding
The design, analysis, interpretation of data and writing of the manuscript have been supported by: Centre for Mathematics of the University of Coimbra—UID/MAT/00324/2013, funded by the Portuguese Government through FCT/MCTES and cofunded by the European Regional Development Fund through the Partnership Agreement PT2020; by the Portuguese Government through the BD grant SFRH/BD/51860/2012; and by FCT/MCTES through the project reference UID/Multi/04044/2013.
Author information
Affiliations
Contributions
All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.
Corresponding author
Correspondence to Adérito Araújo.
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Received
Accepted
Published
DOI
Keywords
 Maxwell’s equations
 Explicit iterative leapfrog discontinuous Galerkin method
 Convergence
 Light scattering