Cache optimization for structured and unstructured grid multigrid.
Calcul des courants induits et des forces électromagnétiques dans un système de conducteurs mobiles
Calcul des singularités par la méthode des éléments finis
Calculs de complexité relatifs à une méthode de dissection emboîtée.
Caractéristiques d'approximation des compacts dans les espaces fonctionnels et problèmes aux limites elliptiques
Cell centered Galerkin methods for diffusive problems
In this work we introduce a new class of lowest order methods for diffusive problems on general meshes with only one unknown per element. The underlying idea is to construct an incomplete piecewise affine polynomial space with optimal approximation properties starting from values at cell centers. To do so we borrow ideas from multi-point finite volume methods, although we use them in a rather different context. The incomplete polynomial space replaces classical complete polynomial spaces in discrete...
Cell centered Galerkin methods for diffusive problems
In this work we introduce a new class of lowest order methods for diffusive problems on general meshes with only one unknown per element. The underlying idea is to construct an incomplete piecewise affine polynomial space with optimal approximation properties starting from values at cell centers. To do so we borrow ideas from multi-point finite volume methods, although we use them in a rather different context. The incomplete polynomial space replaces classical complete polynomial spaces...
Chebyshev semi-iteration in preconditioning for problems including the mass matrix.
Collocation Methods for Parabolic Partial Differential Equations in One Space Dimension.
Colouring polytopic partitions in
Colouring polytopic partitions in
We consider face-to-face partitions of bounded polytopes into convex polytopes in for arbitrary and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed . Partitions of polyhedra in into pentahedra and hexahedra are - and -colourable, respectively. We show that the above numbers are attainable, i.e., in general, they cannot be reduced.
Combined a posteriori modeling-discretization error estimate for elliptic problems with complicated interfaces
We consider linear elliptic problems with variable coefficients, which may sharply change values and have a complex behavior in the domain. For these problems, a new combined discretization-modeling strategy is suggested and studied. It uses a sequence of simplified models, approximating the original one with increasing accuracy. Boundary value problems generated by these simplified models are solved numerically, and the approximation and modeling errors are estimated by a posteriori estimates of...
Combined a posteriori modeling-discretization error estimate for elliptic problems with complicated interfaces
We consider linear elliptic problems with variable coefficients, which may sharply change values and have a complex behavior in the domain. For these problems, a new combined discretization-modeling strategy is suggested and studied. It uses a sequence of simplified models, approximating the original one with increasing accuracy. Boundary value problems generated by these simplified models are solved numerically, and the approximation and modeling errors are estimated by a posteriori estimates of...
Combined a posteriori modeling-discretization error estimate for elliptic problems with complicated interfaces
We consider linear elliptic problems with variable coefficients, which may sharply change values and have a complex behavior in the domain. For these problems, a new combined discretization-modeling strategy is suggested and studied. It uses a sequence of simplified models, approximating the original one with increasing accuracy. Boundary value problems generated by these simplified models are solved numerically, and the approximation and modeling errors are estimated by a posteriori estimates of...
Combined Finite Element and Spectral Approximation of the Navier-Stokes Equations.
Compactness Method in the Finite Element Theory of Nonlinear Elliptic Problems.
Comparing multilevel coarsening strategies.
Comparison of a genetic algorithm and a gradient based optimisation technique for the detection of subsurface inclusions.
Comparison of Linear System Solvers Applied to Diffusion-Type Finite Element Equations.
Comparison of Vlasov solvers for spacecraft charging simulation
The modelling and the numerical resolution of the electrical charging of a spacecraft in interaction with the Earth magnetosphere is considered. It involves the Vlasov-Poisson system, endowed with non standard boundary conditions. We discuss the pros and cons of several numerical methods for solving this system, using as benchmark a simple 1D model which exhibits the main difficulties of the original models.