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.
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.
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 Linear System Solvers Applied to Diffusion-Type Finite Element Equations.
Compatible discretization of second-order elliptic problems.
Complementarity - the way towards guaranteed error estimates
This paper presents a review of the complementary technique with the emphasis on computable and guaranteed upper bounds of the approximation error. For simplicity, the approach is described on a numerical solution of the Poisson problem. We derive the complementary error bounds, prove their fundamental properties, present the method of hypercircle, mention possible generalizations and show a couple of numerical examples.
Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations
The paper deals with fast solving of large saddle-point systems arising in wavelet-Galerkin discretizations of separable elliptic PDEs. The periodized orthonormal compactly supported wavelets of the tensor product type together with the fictitious domain method are used. A special structure of matrices makes it possible to utilize the fast Fourier transform that determines the complexity of the algorithm. Numerical experiments confirm theoretical results.
Complexity of the method of averaging
The general method of averaging for the superapproximation of an arbitrary partial derivative of a smooth function in a vertex of a simplicial triangulation of a bounded polytopic domain in for any is described and its complexity is analysed.
Component mode synthesis and eigenvalues of second order operators : discretization and algorithm