Patrick Ciarlet
Superior National School of Advanced Techniques
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Patrick Ciarlet.
Mathematical Methods in The Applied Sciences | 2001
Annalisa Buffa; Patrick Ciarlet
The aim of this paper is to study the tangential trace and tangential components of fields which belong to the space H(curl, Omega), when Omega is a polyhedron with Lipschitz continuous boundary. The appropriate functional setting is developed in order to suitably define these traces on the whole boundary and on a part of it (for partially vanishing fields and general ones.) In both cases it is possible to define ad hoc dualities among tangential trace and tangential components. In addition, the validity of two related integration by parts formulae is provided. Copyright (C) 2001 John Wiley & Sons, Ltd.
Mathematical Methods in The Applied Sciences | 2001
Annalisa Buffa; Patrick Ciarlet
Hodge decompositions of tangential vector fields defined on piecewise regular manifolds are provided. The first step is the study of L2 tangential fields and then the attention is focused on some particular Sobolev spaces of order
Journal of Computational Physics | 2003
Franck Assous; Patrick Ciarlet; Simon Labrunie; J. Segré
-{1\over 2}
Journal of Computational Physics | 2013
Eric T. Chung; Patrick Ciarlet; Tang Fei Yu
\nopagenumbers\end. In order to reach this goal, it is required to properly define the first order differential operators and to investigate their properties. When the manifold Γ is the boundary of a polyhedron Ω, these spaces are important in the analysis of tangential trace mappings for vector fields in H(curl, Ω) on the whole boundary or on a part of it. By means of these Hodge decompositions, one can then provide a complete characterization of these trace mappings: general extension theorems, from the boundary, or from a part of it, to the inside; definition of suitable dualities and validity of integration by parts formulae. Copyright
SIAM Journal on Scientific Computing | 1997
Tony F. Chan; Patrick Ciarlet; W.K. Szeto
In this paper, we present a method to solve numerically the axisymmetric time-dependent Maxwell equations in a singular domain. In [Math. Methods Appl. Sci. 25 (2002) 49; Math. Methods Appl. Sci. 26 (2003) 861], the mathematical tools and an in-depth study of the problems posed in the meridian half-plane were exposed. The numerical method and experiments based on this theory are now described here. It is also the generalization to axisymmetric problems of the Singular Complement Method that we developed to solve Maxwell equations in 2D singular domains (see [C. R. Acad. Sci. Paris, t. 330 (2000) 391]). It is based on a splitting of the space of solutions in a regular subspace, and a singular one, derived from the singular solutions of the Laplace problem. Numerical examples are finally given, to illustrate our purpose. In particular, they show how the Singular Complement Method captures the singular part of the solution.
Journal of Computational and Applied Mathematics | 2013
Eric T. Chung; Patrick Ciarlet
In this paper, a new type of staggered discontinuous Galerkin methods for the three dimensional Maxwells equations is developed and analyzed. The spatial discretization is based on staggered Cartesian grids so that many good properties are obtained. First of all, our method has the advantages that the numerical solution preserves the electromagnetic energy and automatically fulfills a discrete version of the Gauss law. Moreover, the mass matrices are diagonal, thus time marching is explicit and is very efficient. Our method is high order accurate and the optimal order of convergence is rigorously proved. It is also very easy to implement due to its Cartesian structure and can be regarded as a generalization of the classical Yees scheme as well as the quadrilateral edge finite elements. Furthermore, a superconvergence result, that is the convergence rate is one order higher at interpolation nodes, is proved. Numerical results are shown to confirm our theoretical statements, and applications to problems in unbounded domains with the use of PML are presented. A comparison of our staggered method and non-staggered method is carried out and shows that our method has better accuracy and efficiency.
Numerische Mathematik | 2009
Annalisa Buffa; Patrick Ciarlet; Erell Jamelot
Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the sense that the partition vector induced by it is the closest partition vector, in any ls norm, for
Mathematical Methods in The Applied Sciences | 1999
Franck Assous; Patrick Ciarlet; Pierre-Arnaud Raviart; Eric Sonnendrücker
s\ge1
Numerische Mathematik | 2013
Lucas Chesnel; Patrick Ciarlet
, to the second eigenvector. Moreover, we prove that the same result also holds for any m-partition, that is, a partition into m and (n-m)
SIAM Journal on Matrix Analysis and Applications | 2003
Patrick Ciarlet; Jianguo Huang; Jun Zou
vertices, when using the mth largest or smallest components of the second eigenvector.