Refine
Language
- English (11)
Keywords
- finite element method (3)
- high contrast (3)
- computational homogenization (2)
- finite element (2)
- A posteriori, error analysis, finite element method, composite material, multiscale, high contrast, generalized Delaunay, network (1)
- Crouzeix-Raviart (1)
- Delaunay triangulation (1)
- Euclidean (weighted) Voronoi diagram (1)
- Helmholtz equation (1)
- Raviart-Thomas (1)
Application Area
- C (11)
Given a system of closed convex domains (inclusions) in n-dimensional Euclidean space, new computational meshes are introduced which partition the convex hull of the inclusion set into simple geometric objects. These partitions generalize the concept of Delaunay triangulations by interpreting the inclusions as generalized vertices while the remaining elements of the partition serve as connections between generalized vertices and therefore assume the classical role of edges, faces, etc. The proposed partitions are derived in two different ways: by exploiting duality with respect to certain generalized Voronoi partitions and by generalizing the well known Delaunay (empty circumcircle) criterion.
Generalized Delaunay partitions are of practical importance for the modeling of particle- and fiber-reinforced composite materials
since they enable an efficient conforming resolution of the highly complicated component geometries. The number of elements in the partitions is proportional to the number of inclusions which is minimal.
In this paper we will consider elliptic boundary value problems with
oscillatory diffusion coefficient, say A. We will derive regularity
estimates in Sobolev norms which are weighted by certain derivatives of A.
The constants in the regularity estimates then turn out to be independent of
the variations in A.
These regularity results will be employed for the derivation of error
estimates for hp-finite element discretizations which are explicit with
respect to the local variations of the diffusion coefficient.
This note constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying diffusion tensor. The basis functions are solutions of local problems on vertex patches. The error of the corresponding generalized finite element method decays exponentially w.r.t. the number of element layers in the patches. Hence, on a uniform mesh of size H, patches of diameter log(1/H) are sufficient to preserve the convergence rates of the classical P1-FEM for the Poisson problem.
The analysis does not rely on regularity of the solution or scale separation in the coefficient.
The result justifies the use of the class of variational multiscale methods, introduced in [Comput. Methods Appl. Mech. Engrg., 196:2313--2324, 2007].
A new finite element method computes conductivity in some unstructured particle-reinforced composite material. The 2-phase material under consideration is composed of a poorly conducting matrix material filled by highly conducting circular inclusions which are randomly dispersed. The mathematical model is a Poisson-type problem with discontinuous coefficients. The discontinuities are huge in contrast and quantity.
The proposed method generalizes classical continuous piecewise affine finite elements to special computational meshes which encode the particles in a network structure. Important geometric parameters such as the volume fraction are preserved exactly.
The computational complexity of the resulting method is proportional to the number of inclusions and this is optimal in comparison to data complexity.
The discretization error is proportional to the particle distance and does not depend on the conductivity contrast in the medium.
Time-stepping procedures for the solution of evolution equations can be performed on parallel architecture by parallelizing the space computation at each time step. This, however, requires heavy communication between processors and becomes inefficient when many time-steps are to be computed and many processors are available. In such
cases parallelization in time is advantageous.
In this paper we present a method for parallelization in time of linear multistep discretizations of linear evolution problems; we consider a model parabolic and a model hyperbolic problem, and their, respectively, A(theta)-stable and A-stable linear multistep discretizations. The method consists of a discrete decoupling procedure, whereby N+1 decoupled Helmholtz problems with complex frequencies are obtained; N being the number of time steps computed in parallel. The usefulness of the method rests on our ability to solve these Helmholtz problems efficiently. We discuss the theory and give numerical examples for multigrid preconditioned iterative solvers of relevant
complex frequency Helmholtz problems. The parallel
approach can easily be combined with a time-stepping procedure, thereby obtaining a block time-stepping method where each block of steps is computed in parallel. In this way we are able to optimize the algorithm with respect to the number of processors available, the difficulty of solving the Helmholtz problems, and the possibility of both time and space adaptivity. Extensions to other linear evolution problems and to Runge-Kutta time discretization
are briefly mentioned.
This paper presents some weighted H2-regularity estimates for a model Poisson problem with discontinuous coefficient at high contrast. The coefficient represents a random particle reinforced composite material, i.e., highly conducting circular particles are randomly distributed in some background material with low conductivity. Based on these regularity results we study the percolation of thermal conductivity of the material as the volume fraction of the particles is close to the jammed state. We proof that the characteristic percolation behavior of the material is well captured by standard conforming finite element models.
A Composite Finite Element Method approximates linear elliptic boundary value problems of Dirichlet type with discontinuous coefficients at possibly high contrast. The challenge is the discontinuity in the coefficient across some interface which is not necessarily resolved by the underlying finite element mesh. The method is non-conforming in the sense that shape functions preserve continuity across the interface only in an approximative way. However, the method allows to balance the non-conformity and the best approximation error in such a way that the total discretization error is optimal with regard to the mesh size and independent of contrast.
A novel Finite Element Method (FEM) for the computational simulation in particle reinforced composite materials with many inclusions is presented. It is based on an adapted mesh which consists of triangles and parametric quadrilaterals in 2D. The number of elements and, hence, the number of degrees of freedom are proportional to the number of inclusions. The error of the method is independent of the distance of the neighboring inclusions. While being related to network methods, the approach can tackle more general settings. We present an efficient residual a posteriori error estimator which enables to compute reliable upper and lower error bounds. Several numerical examples illustrate the performance of the method and the error estimator. Moreover, it is demonstrated that the assumption of a lattice structure of inclusions can easily lead to incorrect predictions about material properties.
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coeffcient functions. For this purpose we construct a generalized finite element basis that spans a low dimensional multiscale space. The basis is assembled by performing localized linear finescale computations in small patches that have a diameter of order H |log(H)| where H is the coarse mesh size. Without any assumptions on the type of the oscillations in the coeffcients, we give a rigorous proof for a linear convergence of the H1-error with respect to the coarse mesh
size. To solve the arising equations, we propose an algorithm that is based on a damped Newton scheme in the multiscale space.
We discuss the possibility of computing eigenpairs of some prototypical linear second-order self-adjoint elliptic partial differential operator (or its high-resolution finite element discretization) by numerical upscaling techniques. We compute a low-dimensional generalized finite element space that preserves small eigenvalues in a superconvergent way. The approximate eigenpairs are then obtained by solving the corresponding low-dimensional algebraic eigenvalue problem. The rigorous error bounds are based on two-scale decompositions of H1 by means of a certain Clement-type quasi-interpolation operator.