6,616 research outputs found
A scalable parallel finite element framework for growing geometries. Application to metal additive manufacturing
This work introduces an innovative parallel, fully-distributed finite element
framework for growing geometries and its application to metal additive
manufacturing. It is well-known that virtual part design and qualification in
additive manufacturing requires highly-accurate multiscale and multiphysics
analyses. Only high performance computing tools are able to handle such
complexity in time frames compatible with time-to-market. However, efficiency,
without loss of accuracy, has rarely held the centre stage in the numerical
community. Here, in contrast, the framework is designed to adequately exploit
the resources of high-end distributed-memory machines. It is grounded on three
building blocks: (1) Hierarchical adaptive mesh refinement with octree-based
meshes; (2) a parallel strategy to model the growth of the geometry; (3)
state-of-the-art parallel iterative linear solvers. Computational experiments
consider the heat transfer analysis at the part scale of the printing process
by powder-bed technologies. After verification against a 3D benchmark, a
strong-scaling analysis assesses performance and identifies major sources of
parallel overhead. A third numerical example examines the efficiency and
robustness of (2) in a curved 3D shape. Unprecedented parallelism and
scalability were achieved in this work. Hence, this framework contributes to
take on higher complexity and/or accuracy, not only of part-scale simulations
of metal or polymer additive manufacturing, but also in welding, sedimentation,
atherosclerosis, or any other physical problem where the physical domain of
interest grows in time
Error analysis for quadratic spline quasi-interpolants on non-uniform criss-cross triangulations of bounded rectangular domains
Given a non-uniform criss-cross partition of a rectangular domain ,
we analyse the error between a function defined on and two types
of -quadratic spline quasi-interpolants (QIs) obtained as linear
combinations of B-splines with discrete functionals as coefficients. The main
novelties are the facts that supports of B-splines are contained in
and that data sites also lie inside or on the boundary of . Moreover,
the infinity norms of these QIs are small and do not depend on the
triangulation: as the two QIs are exact on quadratic polynomials, they give the
optimal approximation order for smooth functions. Our analysis is done for
and its partial derivatives of the first and second orders and a particular
effort has been made in order to give the best possible error bounds in terms
of the smoothness of and of the mesh ratios of the triangulation
Non-negative mixed finite element formulations for a tensorial diffusion equation
We consider the tensorial diffusion equation, and address the discrete
maximum-minimum principle of mixed finite element formulations. In particular,
we address non-negative solutions (which is a special case of the
maximum-minimum principle) of mixed finite element formulations. The discrete
maximum-minimum principle is the discrete version of the maximum-minimum
principle.
In this paper we present two non-negative mixed finite element formulations
for tensorial diffusion equations based on constrained optimization techniques
(in particular, quadratic programming). These proposed mixed formulations
produce non-negative numerical solutions on arbitrary meshes for low-order
(i.e., linear, bilinear and trilinear) finite elements. The first formulation
is based on the Raviart-Thomas spaces, and is obtained by adding a non-negative
constraint to the variational statement of the Raviart-Thomas formulation. The
second non-negative formulation based on the variational multiscale
formulation.
For the former formulation we comment on the affect of adding the
non-negative constraint on the local mass balance property of the
Raviart-Thomas formulation. We also study the performance of the active set
strategy for solving the resulting constrained optimization problems. The
overall performance of the proposed formulation is illustrated on three
canonical test problems.Comment: 40 pages using amsart style file, and 15 figure
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
In this paper, we propose a general framework for constructing IGA-suitable
planar B-spline parameterizations from given complex CAD boundaries consisting
of a set of B-spline curves. Instead of forming the computational domain by a
simple boundary, planar domains with high genus and more complex boundary
curves are considered. Firstly, some pre-processing operations including
B\'ezier extraction and subdivision are performed on each boundary curve in
order to generate a high-quality planar parameterization; then a robust planar
domain partition framework is proposed to construct high-quality patch-meshing
results with few singularities from the discrete boundary formed by connecting
the end points of the resulting boundary segments. After the topology
information generation of quadrilateral decomposition, the optimal placement of
interior B\'ezier curves corresponding to the interior edges of the
quadrangulation is constructed by a global optimization method to achieve a
patch-partition with high quality. Finally, after the imposition of
C1=G1-continuity constraints on the interface of neighboring B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
patch parameterization is obtained by a C1-constrained local optimization
method to achieve uniform and orthogonal iso-parametric structures while
keeping the continuity conditions between patches. The efficiency and
robustness of the proposed method are demonstrated by several examples which
are compared to results obtained by the skeleton-based parameterization
approach
- …