2008
DOI: 10.1016/j.jcp.2008.05.013
|View full text |Cite
|
Sign up to set email alerts
|

A finite volume method for the approximation of Maxwell’s equations in two space dimensions on arbitrary meshes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 57 publications
(99 reference statements)
0
12
0
Order By: Relevance
“…The indirect dual mesh lends itself better to the 3D framework and it provides a more accurate approximation of the gradient of the solution. Since then this type of method has been called discrete duality finite volume (DDFV) method in order to emphasize that it satisfies a discrete integration par parts (see [6]) and it proved to be efficient for dealing with several problems arising in various areas of computational physics (see [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]). Convergence analysis have been carried out in [5,12,18], for the linear case, and in [11] for the broad class of non-linear Leray-Lions type diffusion operators.…”
Section: Introductionmentioning
confidence: 99%
“…The indirect dual mesh lends itself better to the 3D framework and it provides a more accurate approximation of the gradient of the solution. Since then this type of method has been called discrete duality finite volume (DDFV) method in order to emphasize that it satisfies a discrete integration par parts (see [6]) and it proved to be efficient for dealing with several problems arising in various areas of computational physics (see [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]). Convergence analysis have been carried out in [5,12,18], for the linear case, and in [11] for the broad class of non-linear Leray-Lions type diffusion operators.…”
Section: Introductionmentioning
confidence: 99%
“…and C i is the set ofw i satisfying the constraints (16)(17)(18)(19)(20)(21). Notice that with a quadratic objective function (22) and linear equality constraints inw i j (16)(17)(18)(19)(20)(21), this becomes a straight-forward quadratic programming optimization problem.…”
Section: The Resampling Algorithmmentioning
confidence: 99%
“…The first methods to calculate the electromagnetic fields were based on Yee's finite difference method [7] using structured grids. Later, finite volume (FV) [8] and finite element (FE) [9] methods were applied. Due to their excellent approximation of wave propagation and the flexible grid requirements, discontinuous Galerkin (DG) schemes have also been investigated in recent times.…”
Section: Introductionmentioning
confidence: 99%