> top > docs > PMC:6947357 > spans > 62630-62637

PMC:6947357 / 62630-62637 JSONTXT

Three-Dimensional Digital Reconstruction of Ti2AlC Ceramic Foams Produced by the Gelcast Method Abstract A digital reconstruction technique is presented that generates three-dimensional (3D) digital representations of ceramic foams created by the foam-gelcasting technique. The reconstruction process uses information that is directly extracted from Scanning Electron Microscopy (SEM) images and offers a 3D representation of the physical sample accounting for the typically large pore cavities and interconnecting windows that are formed during the preparation process. Contrary to typical tessellation-based foam treatments, a spherical representation of the pores and the pore windows of the foams is assumed and a novel hybrid algorithm that combines a variation of Lubachevsky-type and Random Close Packing of Hard Spheres (RCPHS) algorithms has been developed to obtain near-optimum solutions to the packing problem of the spheres that represent the pores. Numerical simulations are performed directly on the 3D reconstructed foams to determine their gas permeability. The model predictions are compared with experimental gas permeability data that were obtained for the physical samples. The pore wall thickness can be treated as the single fitting parameter in the entire reconstruction process, although it is shown that images of sufficient resolution could eliminate the need even for that. The foams that are produced by this method yield quantitatively similar pressure drops with experiments for various superficial velocity values, with a very small deviation in the range of 1.7–2.8%. The proposed methodology could be utilized for the prediction of the permeability and transport properties of complex foamy porous structures, similar to the gelcast-type of foams, from a single SEM image of the foam sample without resorting to serial tomography or other structural information, thus saving considerable time and effort from experimental work. 1. Introduction Layered materials are widely available in nature and have been shown to exhibit new and technologically attractive properties when they undergo excessive thinning, delamination or exfoliation, in comparison to their bulk counterparts. As a result, a wide variety of ceramic materials comprised of complex layered structures has appeared, such as MAX phases, characterized by the Mn+1AXn (n = 1–3) chemical composition formula, where M is an early transition metal, A is an A-group element of the periodic table and X is either C or N [1]. Ti2AlC is a member of the MAX-phase group of layered ternary carbides and nitrides. The chemical bonding in Ti2AlC is anisotropic in nature and can be described as metal-covalent-ionic because of the distribution of the charge density. Moreover, the chains of directional covalent bonding between titanium and carbon (Ti-C-Ti) and layers of the closed packed Al atoms define the unique properties of Ti2AlC that span the group of metals, as well as the group of ceramics [2,3]. Among others, Ti2AlC possesses good electrical and thermal conductivity [1], increased resistance to thermal shocks [4] and ease of machining [5], while maintaining its strength at high temperatures [1]. Because of its ceramic nature, it has a very high melting point, a high modulus and a low thermal expansion coefficient [6]. It should be noted that Ti2AlC is one of the lightest and most oxidation-resistant [7] carbides reported to date. As a result, porous Ti2AlC is considered a promising material for high-performance applications. It can act as an electrode material on rough chemical environments or be utilized as a solar volumetric collector. Moreover, highly porous Ti2AlC foams can be used as molds for the production of metal-ceramic interpenetrating composite materials that are characterized by their increased damping properties. Lately, there has been an increased interest in generating porous Ti2AlC foams aiming to produce eventually porous materials with the desired mechanical and transport resistance. The research on porous Ti2AlC is considered limited; however, extended studies on those foams may reveal ways to improve their functional properties [8]. Moreover, the permeability of porous Ti2AlC at room or higher temperature is a critical feature in various applications, such as catalyst devices and filters [9]. In filters, for example, the performance of gelcast ceramic foams in removing solid particulates from gas flow is highly dependent on the pore window diameter of the foam [10]. In this paper, the focus was placed on Ti2AlC produced by the gelcasting method, which is considered a suitable method for obtaining porous materials with a set shape [11]. Gelcasting is a foam production method that is based on the traditional method of forming ceramic materials from casting slips combined with a polymerization reaction. The basic concept of this method involves the production of a ceramic powder suspension with the addition of a substance subject to gelation with the help of a suitable initiator [12]. The mass fraction of the suspension components, as well as the time of the suspension and homogenization process, are suitably selected in order to provide a global time frame that is sufficient to allow suspension to cast into the mold before the gelation process takes place and, at the same time, ensuring that the gelation process does not occur too late [13]. As a last step, the foam samples are placed in an alumina boat on a bed of Al-containing powder [8,14]. Wehinger et al. [15] suggested a methodology for the reconstruction of open cell foams utilizing a Voronoi tessellation, using the pore diameter as the characteristic length. Although they managed to approach experimental data to a great extent using this method, the description that was adopted was limited regarding the shape of the foam ligament/branches. In that approach the branches were assumed to have a constant circular or trapezoidal shape along the strut length. According to observations by Hutter et al. [16], the branch thickness, as well as the branch shape, reportedly affect the mass transport properties of the foam to a large extent. Bracconi et al. [17] and Stiapis et al. [18] attempted to remediate those shortcomings by introducing different branch variation algorithms that shape the strut thickness along the length of branches, greatly improving the description of the solid domain and showing notable agreement with the experimental data. However, these branch variation methods require a predefined arrangement either of points or of non-overlapping spheres, parameters that greatly affect the outcome of the tessellation process. The cells that are created with these methods cannot be defined prior to the tessellation process. The reason is that the cell size distribution generated from the tessellation process is bound to the initial configuration of points or spheres and, thus, rendering the resulting cell size distribution arbitrary to a large extent. Moreover, the cell curvature of the foam pores in a Laguerre tessellation is represented by polyhedral cells that can only approximate geometrical curvatures up to a certain degree. Those shortcomings render the application of Laguerre Tessellations favorable for the reconstruction of foams with specific geometrical structures. To be yet more specific, Laguerre Tessellations are suitable for structures where each cell is interconnected with the others via a single pore window and the cells are preferably not spherical. In the present work, an algorithm has been developed to create an arrangement of spherically shaped pores that lends itself to the digital reconstruction of the pore structure of Ti2AlC foams produced by the gelcasting method with sufficient accuracy. The numerical methods and algorithms that are used in the literature for the generation of dense packings of spheres are classified into two categories—a) the static construction methods and b) the dynamic construction methods. In the static case, the spheres are spatially allocated following a usually sequential deposition process and are considered immobilized after their positioning. In contrast, the dynamic approach uses the initial position of the spheres as an input parameter and assumes short- or long-range interactions between spheres, generating displacements of the spheres and spatial rearrangement of the whole packing, ultimately converging to a packing with the desired properties. Overall, the static algorithms are very popular due to their direct nature and simplicity. The large value of the foam porosity necessitates the generation of spherical pore packings with a large number density. This can be achieved through several algorithms that are used to generate dense packings of hollow spheres. The majority of those models are based on a simple yet efficient conception, namely that the spheres are placed sequentially in the working domain under the effect of a usually unidirectional force-field and, then, remain fixed in space [19,20]. The static methods, however, can generate relatively homogeneous packings. The packing fractions that are obtained are smaller than the maximum possible fractions for disordered sphere packings [20]. Contrary to the static methods, the dynamic methods are more flexible, albeit more intricate and perplexing. Their complexity is attributed to the fact that the final position of the particles is dependent on the process, which can be either collective or individual. Moreover, the resulting packing fraction strongly depends on the evolution process of the sphere positions. The dynamic simulation processes are further divided into two major subcategories, namely event-driven simulations and molecular dynamics simulations. In the event-driven simulations, the components of the system under analysis (disks in two dimensions or spheres in three dimensions) evolve independently, unless an event takes place [21]. The sphere evolution is based on the integration of Newton’s equation of motion that is used to predict the trajectory of the spheres [22]. Thus, the temporal displacement of moving spheres is directly proportional to their individual velocity. Collision events interrupt this evolution process and the lineal motion of spheres [22]. These events may correspond to an elastic or inelastic collision between two spheres or to the collision of a sphere with the bounding box walls. The collisions introduce an abrupt interchange on the momentum of the spheres. The duration of body contact during collision is usually assumed to be zero. Using this algorithm, the whole system of spheres is updated after each event [22]. The reconstruction process that is developed here yields three-dimensional, digitized representations of different Ti2AlC foams that have different pore size distribution and different porosity values. The final goal of this work is the ability to create 3-dimensional representative volumes of the ceramic foams from minimum input data and to derive useful information regarding their internal structure. Effective transport properties can then be extracted accurately using computational treatment only, thus avoiding exhaustive experimentation. The distinctive advantage of this reconstruction algorithm over other algorithms found in the literature [17,18] is that this algorithm can digitally reconstruct foam structures where each pore cell may be interconnected with others via multiple pore windows and other pore cells. Moreover, this algorithm can be used in order to predict the 3D porosity as a function of the wall thickness of the spherical caps (a quantity that can be easily extracted from Scanning Electron Microscopy (SEM) images). This work aims to speed up the characterization procedure for ceramic foams and provide guidance to the tailoring of their structural properties. A modified event-driven algorithm is proposed, which involves an overlap minimization process that produces an optimized hollow sphere packing. The gas permeability of the reconstructed foams is obtained via numerical methods and is found to compare very satisfactorily with experimental values. 2. Materials and Methods In this work, a methodology for the 3-dimensional reconstruction of dry foams is developed, followed by the numerical extraction of their effective flow and transport properties. The reconstruction approach is based on a packing of non-overlapping or partially overlapping spheres, whose radii are sampled from the size distribution that is extracted by pore-space analysis on a single SEM image. Depending on the application, some disk-packing or sphere-packing generation algorithms are found to perform better than others in some aspects of the simulation procedure yet fall behind in some other aspects. Thus, it is desirable to combine algorithms in a way that exploits their strengths and manages to sidestep their weaknesses, formulating a new, hybrid, “composite” algorithm. The hybrid algorithm that is developed here consists of two well-established algorithms for the generation of a hollow sphere packing. The first constituent algorithm is the algorithm proposed by Lubachevsky who worked first on billiard simulations [23] and then on random disk packing problems [24]. The second constituent algorithm is the Random Close Packing of Hard Spheres algorithm (RCPHS) developed by Wu et al. [25], which is a rearrangement algorithm with an optimization subroutine. The Lubachevsky algorithm uses the concept of following the motion of a number of spheres in a closed domain, similar to a billiard simulation. However, the diameter of the spheres grows gradually in time. Since the volume of the domain is finite, there will be a time when the spheres cannot grow any further, yielding a jammed pack. This algorithm has one parameter representing the growth rate of the spheres compared to the mean velocity of the spheres. In practice, low values of the growth rate parameter are associated with sphere packing that tend to approach the ordered state; however, for larger values of the growth rate a more chaotic dispersion is attained. The Lubachevsky algorithm also has the appealing characteristic of producing dense jammed packaging for monodispersed sphere systems; however, this claim cannot be extended to polydispersed sphere systems [26]. Moreover, due to the fact that this algorithm has been strictly designed for hard spheres, it is not capable of handling jammed packings of soft, partially overlapping spheres without inherent modifications. The RCPHS algorithm considers an arrangement of spheres with overlap between neighboring spheres. Then, a procedure is applied to relocate each sphere so that overlapping is reduced. When the total sphere overlapping volume cannot be further reduced, all spheres are incrementally shrunk. By consecutive repetition of the relocation and shrinking steps, a non-overlapping or, in any case, a minimized overlapping packing is eventually obtained. However, in the core of this algorithm lies a shrinking step that manipulates the radius of the spheres in order to facilitate the minimization of the overlapping between the spheres. The shrinking step of this algorithm is undesirable in our implementation since the resulting distribution of the sphere radii is not guaranteed to follow the desired one. 2.1. Proposed Hybrid Algorithm for Packing Generation In this work, a hybrid algorithm that combines a variation of the Lubachevsky and the RCPHS algorithms is developed to obtain a near-optimum solution to the sphere packing problem. Because of the fact that the RCPHS algorithm requires an initial arrangement of spheres in order to operate on them and minimize their overlap, a variation of the Lubachevsky-Stilling [23] algorithm is used. At first, the simulation domain is defined paying attention to the conditions that should apply at the boundaries. The spheres can either rebound off the walls of the simulation domain (rigid boundary) or pass through the wall to re-enter through the opposite side (periodic boundary). In the present case, the rigid boundary condition is adopted since it combines robustness and simplicity. Then, the simulation domain is populated by spheres that are randomly placed in space and have as radii a very small fraction of the finally desired ones. Their velocity components are represented by randomly oriented unit vectors. To simplify the computations, the radii and positions are further normalized by the characteristic domain length. The spheres move with the unit velocity into random directions and are subject to elastic collisions with other spheres or with the domain boundaries. As the sphere sizes gradually increase (exponential growth is assumed) and the domain size is fixed, there will be a moment at which a jammed configuration is obtained. More specifically, starting from a random spatial distribution of very small spheres, they are allowed to transform gradually into non-overlapping or partially overlapping spheres, the radius of which is increased at a constant expansion rate, defined as brate, while their positions evolve over time according to Newtonian mechanics. The expansion of the spheres is assumed to occur simultaneously on all spheres after every collision event. Thus, as time progresses, each sphere experiences an increasing number of collisions due to the fact that the available free space is reduced gradually. When a jammed stage is reached and no further repositioning according to the previous rules is possible, the spheres are magnified to their original (desired size). The RCPHS algorithm is subsequently employed to minimize the overlapping of spheres by rearranging their positions. 2.1.1. Sphere Collisions When the spheres are not colliding, they move in straight paths; no forces act on them and there is no acceleration. The collision time between two spherical particles can be determined as follows. Let us assume two spheres i and j with radius Ri and Rj and velocity v→i and v→j, respectively. If these two spheres are in a collision trajectory, they are going to collide at time Δtc and the following equation will be satisfied, Equation (1). (1) ΔtC2|v→ij|2+2ΔtC(v→ij⋅r→ij)+|r→ij|2−σij2=0 σij = Ri + Rj is called the interaction diameter, r→ij is the relative position vector between spheres i and j and v→ij is their relative velocity. This quadratic equation in Δtc, Equation (1), is obtained by squaring the vectorial expression for the binary collision of spheres with constant velocity in time. However, during the computation of the roots of Equation (1), numerical errors accumulate during the calculation, attributed to the finite precision of floating point calculations. These errors, if left untreated, inevitably lead to negative time-steps or complex solutions of the quadratic. They also affect the prediction of the positions of the colliding spheres at the time of impact, which results either in spheres overlapping or in positioning of spheres at a small distance from each other or from the wall, at the time of collision. The sphere overlapping case is extremely problematic [22,27], since the particles have numerically entered the infinite energy hard-core [27]. Errors resulting from |r→ij| ≥Ri+Rj do not affect the stability of the algorithm. In order to deal with the floating point precision problem, the algorithm that was proposed by Bannerman et al. [18] is implemented. In this algorithm, an overlap function, FHS, is used at any time step, defined as the left-hand-side of Equations (1) and shown in Equation (2), (2) FHS=ΔtC2|v→ij|2+2ΔtC(v→ij⋅r→ij)+|r→ij|2−σij2, which evaluates the overlapping between two spheres at each time step. This overlap function obtains negative, positive or zero values for a pair of overlapping, non-overlapping or one-point contacting spheres, respectively. Thus, the problem of sphere collisions is transformed into a problem of finding the roots of FHS = 0. The derivative of the overlap function with respect to the collision time may be utilized in order to predict future overlapping between spheres that are not currently overlapping. By considering the aforementioned properties, overlap in each pair occurs when. This overlap decreases, that is, the spheres move away from each other, when ∂FHS/∂Δtc>0. Conversely, the spheres approach each other and the overlap increases when ∂FHS/∂Δtc<0. Thus, the search for the earliest occurring collision pair is led by the smallest non-negative Δtc that is subject to the overlap function conditions:(3) ∂FHS(t+Δtc)≤0 (4) ∂FHS∂Δtc|t+Δtc<0. Thus, by following the definition of the overlap function and employing the following algorithm sequentially, for each pair of spheres i, j the Δtc,i,j is calculated, which is the time increment for the mutual collision of the spheres.(1) If  v→ij·r→ij≥0 then Δtc,i,j→∞. (2) Else if |r→ij|2−σij2≤0 then Δtc,i,j=0. (3) Else if (v→ij·r→ij)2−|v→ij|2(|r→ij|2−σi,j2)≤0 then Δtc,i,j→∞. (4) If none of the above is satisfied, then Δtc is calculated from ΔtC,i,j=|r→ij|2−σ2−(v→ij⋅r→ij)+(v→ij⋅r→ij)2−|v→ij|2(|r→ij|2−σij2). At the end of the execution of this algorithm, a list of the mutual collision times is formed. In addition to the fact that the spheres are placed inside an orthogonal computational domain, the collision times with the domain walls are also calculated, Δtc,w. The next colliding interval is determined as the minimum positive value of both lists:(5) Δtc=min(Δtc,i,j−Δtc,wi), Δtc,i,j>0. The spheres are allowed to move forward in time by a Δtc time-interval. The collision time, tc=t+Δtc, represents the moment of collision between a pair of spheres or a sphere-wall collision. Thus, in the next step the pair collision needs to be resolved, to yield the outcome of the collision and define the starting condition for the next rearrangement stage. 2.1.2. Collision Handling The sphere-to-sphere collisions, as well as the sphere-to-wall collisions, are very fundamental for this algorithm, as they determine the sequential events of the simulation. The classical elastic collisions type is adopted here. However, this property is not ensured since each sphere is gradually growing and, thus, there is an outward surface velocity relative to the sphere center. A corrective algorithm has been developed in order to treat this peculiarity, described in Section 2.1.5. The following two equations are obtained by the employment of the conservation of momentum and kinetic energy for the two colliding spheres:(6) Δp→m=Δpmn^ij=mi(v→i*−v→i)=−mj(v→j*−v→j) (7) mi(v→i*−v→i)=Δpmn^ij→v→i*=v→i−(Δpmmi)n^ij, where Δp→m is the momentum change of each colliding sphere, v→i* and v→j* are the post-collisional velocities of spheres i and j and n^ij is the unit vector directed from the center of sphere i to the center of the sphere j. However, n^ij·n^ij=1, thus Equation (7) is reformulated into Equation (8):(8) Δp→m=2mimjmi+mj((v→ij·r→ij)r→ijσij2). Assuming that all spheres in the simulation domain are identified with the same unity mass although they may have different volume, the expression for the momentum change reads:(9) v→i*=v→i−((v→ij·r→ij)r→ijσij2). In this way, all spheres are allowed to experience the same domain volume irrespective of their size. At the end of each collision step, all spheres have their radii increased by the brate factor. This will inevitably create overlaps between the spheres, as well as between the spheres and the walls. In this study, brate assumes a value of 1.00005 that is translated to an increase of 0.005% in all sphere radii after each collision event. This value was found to be optimal for the present simulations. Very small values of brate would result in significantly elevated running time without any noticeable change in the structure features. On the other hand, simulations with larger brate values would result in encapsulation of small spheres by larger ones, an unfavorable situation for the algorithm. The reason behind those overlaps lies in the fact that, when the spheres are colliding and their post-collision velocities are calculated, their radius is incrementally increased, creating an artificial overlap, as shown in Figure 1a,b, which is inevitable especially when a jammed state is reached while the spheres resume their actual, desired size. In order to resolve those overlaps, a local repositioning algorithm is devised to relocate each sphere to a new position and reduce the overlap. In the present work, a modification of the rearrangement algorithm by Wu et al. [25] is proposed. The spheres are moved sequentially in order to reduce the total overlapping volume gradually. Only one sphere may be moved in each attempt, while the rest of the spheres are assumed immobilized. To this end, an optimization routine is employed that searches for a new position for the sphere under consideration within a distance of twice the sphere radius from the original position of the sphere. The new position should minimize its overlapping volume with the surrounding spheres. The overlapping volume between a pair of spheres is a non-linear function of their relative coordinates, Equation (10):(10) Vi,jo(r→ij)={π(Ri+Rj−|r→ij|)(|r→ij|2+2|r→ij|Rj−3Rj2+2|r→ij|Ri+6RiRj−3Ri)12|r→ij|,if |r→ij||r→ij|+Rj4πRi33   ,if Rj>|r→ij|+Ri0,if|r→ij|>Ri+Rj Thus, the total overlapping volume of a sphere with the rest of the N spheres is given from Equation (11):(11) ViT=∑j=0j=N,j≠i(Vi,jo(r→ij)). This process aims to the minimization of the total overlapping volume, treated as an objective function, over a set of decision variables under a set of constraints. The minimum-overlap problem can thus be formulated as follows:(12) minx→i   ViT(x→i), (13) subject to RiMin-Max Min-Max Gelcast93 3090 0.323 1.75 1.07–7.52 2.9–3.0 Gelcast87 4480 0.223 2.5 0.74–5.18 2.9–3.0 Gelcast84 11272 0.088 21.01 0.02–0.22 0.29–0.3 Table 4 Summary of the cell type distribution of the three different foams. Foam Total Cell Counts Hexahedra Prisms Tet Wedges Polyhedra Gelcast93 4603068 3395049 150086 19190 1038743 Gelcast87 5576328 4106789 212812 5656 1251071 Gelcast84 6232131 4532497 293359 5816 1400459 Table 5 Estimated and Experimental Forchheimer Coefficients. Foam KF—D,exp KF—D,sim KF—F,exp KF—F,sim Experimental Forch.-Darcy [8,9] Estimated Forch.-Darcy Experim. Estimated Inertia Coef. [8,9] Inertia Coef. Gelcast93 1.79 × 10−8 m2 2.99 × 10−8 m2 1.75 × 10−3 m−1 1.62 × 10−3 m−1 Gelcast87 2.05 × 10−9 m2 2.16 × 10−9 m2 7.38 × 10−5 m−1 7.13 × 10−5 m−1 Gelcast84 9.34 × 10−10 m2 9.34 × 10−10 m2 3.46 × 10−5 m−1 3.54 × 10−5 m−1 Table 6 Wall thickness of foam cells. Comparison of fitted value and actual one. Foam Wall Thickness Simulated Wall Thickness Experimental [8,9] Gelcast93 9.87 μm 9.45 ± 0.6 μm Gelcast87 10.11 μm 11.53 ± 1μm Gelcast84 20 μm 22± 0.4 μm Table 7 Numerically estimated tortuosity and Darcy permeability. Foam τ, Tortuosity KD, Darcy Permeability Gelcast93 1.126 1.05 × 10−8 m2 Gelcast87 1.210 3.70 × 10−9 m2 Gelcast84 1.495 7.02 × 10−10 m2

Document structure show

projects that have annotations to this span

There is no project