zbMATH — the first resource for mathematics

A Crank-Nicolson scheme for the Dirichlet-to-Neumann semigroup. (English) Zbl 1435.65185
Summary: The aim of this work is to study a semidiscrete Crank-Nicolson type scheme in order to approximate numerically the Dirichlet-to-Neumann semigroup. We construct an approximating family of operators for the Dirichlet-to-Neumann semigroup, which satisfies the assumptions of Chernoff’s product formula, and consequently the Crank-Nicolson scheme converges to the exact solution. Finally, we write a \(P_1\) finite element scheme for the problem, and we illustrate this convergence by means of a FreeFem++ implementation.
65N06 Finite difference methods for boundary value problems involving PDEs
65J05 General theory of numerical analysis in abstract spaces
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
Full Text: DOI
[1] Lax, P. D., Functional Analysis (2012), New York, NY, USA: Wiley-Interscience, New York, NY, USA
[2] Emamirad, H.; Laadnani, I., An approximating family for the Dirichlet-to-Neumann semigroup, Advances in Differential Equations, 11, 3, 241-257 (2006) · Zbl 1112.47032
[3] Emamirad, H.; Sharifitabar, M., On explicit representation and approximations of Dirichlet-to-Neumann semigroup, Semigroup Forum, 86, 1, 192-201 (2013) · Zbl 1269.47030
[4] Cherif, M. A.; El Arwadi, T.; Emamirad, H.; Sac-épée, J.-M., Dirichlet-to-Neumann semigroup acts as a magnifying glass, Semigroup Forum, 88, 3, 753-767 (2014) · Zbl 1297.65152
[5] Engel, K.; Nagel, R., One-Parameter Semigroups for Linear Evolution Equations. One-Parameter Semigroups for Linear Evolution Equations, Graduate Texts in Mathematics, 194 (2000), New York, NY, USA: Springer, New York, NY, USA · Zbl 0952.47036
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.