This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The Fast Exact Closure for Jeffery’s Equation with Diffusion

Stephen Montgomery-Smith David Jack111Corresponding Author. Email: david_jack@baylor.edu. Phone: 254-710-3347. Douglas E. Smith Department of Mathematics, University of Missouri, Columbia MO 65211, U.S.A. Department of Mechanical Engineering, Baylor University, Waco TX 76798, U.S.A. Department of Mechanical and Aerospace Engineering, University of Missouri, Columbia MO 65211, U.S.A.
Abstract

Jeffery’s equation with diffusion is widely used to predict the motion of concentrated fiber suspensions in flows with low Reynold’s numbers. Unfortunately, the evaluation of the fiber orientation distribution can require excessive computation, which is often avoided by solving the related second order moment tensor equation. This approach requires a ‘closure’ that approximates the distribution function’s fourth order moment tensor from its second order moment tensor. This paper presents the Fast Exact Closure (FEC) which uses conversion tensors to obtain a pair of related ordinary differential equations; avoiding approximations of the higher order moment tensors altogether. The FEC is exact in that when there are no fiber interactions, it exactly solves Jeffery’s equation. Numerical examples for dense fiber suspensions are provided with both a Folgar-Tucker (1984) diffusion term and the recent anisotropic rotary diffusion term proposed by Phelps and Tucker (2009). Computations demonstrate that the FEC exhibits improved accuracy with computational speeds equivalent to or better than existing closure approximations.

keywords:
B. Directional orientation, B. Rheological properties, D. Injection molding, Jeffery’s equation with rotary diffusion

1 Introduction

The industrial demand has continued to increase for high-strength, low-weight, rapid production parts such as those made of short discontinuous fiber composites with injection molding processes. For effective design, it is essential to understand the dependance of the final part performance of short-fiber injection molded composites with the variations in the microstructure due to the processing (see e.g. [1, 2]). The Folgar and Tucker model of isotropic diffusion [3] for fiber interactions within a suspension has been used for several decades to compute fiber orientation and has been implemented to some extent within most related industrial and research computer simulations. Unfortunately, direct computations of the isotropic diffusion model are computationally prohibitive, and most implementations employ the orientation tensor approach of Advani and Tucker [4] where the moments of the fiber orientation are solved, thus indirectly quantifying the fiber orientation distribution. The orientation tensor approach requires knowledge of the next higher-order moment tensor, thus requiring some form of a closure. The hybrid closure of Advani and Tucker [4] has been used extensively due to its computational efficiencies, but in implementation it will overpredict the alignment state in simple shear flow [5]. Cintra and Tucker [6] introduced the class of the orthotropic closures, which result in significant accuracy improvements when compared to the hybrid closure, but at an increase in computational costs.

With recent advances in part repeatability, the limitation of the isotropic diffusion model has become apparent [7]. Recent anisotropic diffusion models [8, 9, 10, 11] propose new forms with greater accuracies for modeling fiber collisions, but these anisotropic diffusion models pose a new set of computational complications. In particular is the concern that nearly all of the fitted orthotropic closures are obtained by fitting orientation information based on direct numerical solutions of the Folgar-Tucker diffusion model. The exception is the orthotropic closures of Wetzel [12] and VerWeyst [13] which were both constructed on distributions formed through the elliptic integral form for orientations encompassing the eigenspace [6].

The Exact Closure of Montgomery-Smith et al. [14] presents an alternative to the classical closure form, and provides an exact solution for pure Jeffery’s motion (i.e., the dilute regime). The Exact Closure avoids the curve fitting process required to define fitted closures, by solving a set of related ODEs of the fiber orientation. In the present paper, we extend the Exact Closure form to systems of concentrated suspensions that are more relevant to modeling the processing of short-fiber composites. Furthermore, we introduce the new Fast Exact Closure (FEC) that defines conversion tensors that lead to a coupled system of ordinary differential equations that avoid costly closure computations. The FEC form is derived for fiber collision models for both the isotropic diffusion model of Folgar and Tucker and the recent anisotropic diffusion model of Phelps and Tucker [9]. Results presented will demonstrate the effectiveness of this alternative approach for modeling fiber orientation, both for accuracy and for computational speed.

2 Fiber Motion Basics

Jeffery’s equation [15] has been used to predict the motion of the direction of axi-symmetric fibers under the influence of a low Reynold’s number flow of a Newtonian fluid, whose velocity field is 𝐮=𝐮(𝐱,t){\mathbf{u}}={\mathbf{u}}({\mathbf{x}},t). The directions of the fibers is represented by the fiber orientation distribution ψ=ψ(𝐱,𝐩,t)\psi=\psi({\mathbf{x}},{\mathbf{p}},t), where 𝐩{\mathbf{p}} is an element of the orientation space, that is, the 2-dimensional sphere S={𝐩=(p1,p2,p3):p12+p22+p32=1}S=\{{\mathbf{p}}=(p_{1},p_{2},p_{3}):p_{1}^{2}+p_{2}^{2}+p_{3}^{2}=1\}. Thus given a subset EE of SS, the proportion of fibers whose direction is in EE is given by Eψ(𝐱,𝐩,t)𝑑𝐩\int_{E}\psi({\mathbf{x}},{\mathbf{p}},t)\,d{\mathbf{p}}, where d𝐩d{\mathbf{p}} represents the usual integration over SS. In particular, an isotropic distribution is represented by ψ=1/4π\psi=1/4\pi. The Jeffery’s equation for the fiber orientation distribution is

DψDt=12𝐩((Ω𝐩+λΓ𝐩λΓ:𝐩𝐩𝐩)ψ)\frac{D\psi}{Dt}=-\tfrac{1}{2}{\boldsymbol{\nabla}}_{\mathbf{p}}\cdot((\Omega\cdot{\mathbf{p}}+\lambda\Gamma\cdot{\mathbf{p}}-\lambda\Gamma:{\mathbf{p}}{\mathbf{p}}{\mathbf{p}})\psi) (1)

Here Ω\Omega is the vorticity, that is, the anti-symmetric part 𝐮(𝐮)T{\boldsymbol{\nabla}}{\mathbf{u}}-({\boldsymbol{\nabla}}{\mathbf{u}})^{T} of the Jacobian of the velocity field 𝐮=(ui/xj)1i,j3{\boldsymbol{\nabla}}{\mathbf{u}}=(\partial u_{i}/\partial x_{j})_{1\leq i,j\leq 3}, and Γ\Gamma is the rate of strain tensor, that is, the symmetric part 𝐮+(𝐮)T{\boldsymbol{\nabla}}{\mathbf{u}}+({\boldsymbol{\nabla}}{\mathbf{u}})^{T} of the Jacobean of the velocity field. Also, D/Dt=/t+𝐮D/Dt=\partial/\partial t+{\mathbf{u}}\cdot{\boldsymbol{\nabla}} represents the material derivative, and 𝐩=(I𝐩𝐩)(p1,p2,p3){\boldsymbol{\nabla}}_{\mathbf{p}}=(I-{\mathbf{p}}{\mathbf{p}})\cdot\left(\tfrac{\partial}{\partial p_{1}},\tfrac{\partial}{\partial p_{2}},\tfrac{\partial}{\partial p_{3}}\right) is the gradient operator restricted to the sphere.

Equation (1) is modified to incorporate the rotary diffusion expressed by Bird et al. [16], occasionally referred to as the generalized Fokker-Planck or the Smoluchowski equation [17], as

DψDt=12𝐩((Ω𝐩+λΓ𝐩λΓ:𝐩𝐩𝐩)ψ)+Δ𝐩(Drψ),\frac{D\psi}{Dt}=-\tfrac{1}{2}{\boldsymbol{\nabla}}_{\mathbf{p}}\cdot((\Omega\cdot{\mathbf{p}}+\lambda\Gamma\cdot{\mathbf{p}}-\lambda\Gamma:{\mathbf{p}}{\mathbf{p}}{\mathbf{p}})\psi)+\Delta_{\mathbf{p}}(D_{r}\psi), (2)

where DrD_{r} captures the effect of fiber interaction and depends upon the flow kinetics. Here Δ𝐩=𝐩𝐩\Delta_{\mathbf{p}}={\boldsymbol{\nabla}}_{\mathbf{p}}\cdot{\boldsymbol{\nabla}}_{\mathbf{p}} represents the Beltrami-Laplace operator on the sphere. Folgar and Tucker [3] selected Dr=CIγ˙D_{r}=C_{I}\dot{\gamma} where γ˙=(12Γ:Γ)1/2\dot{\gamma}=\left(\frac{1}{2}\Gamma:\Gamma\right)^{1/2} and CIC_{I} is a constant that depends upon the volume fraction and aspect ratio of the fibers.

Other authors have considered a wider class of diffusion terms. For example, Koch [10], and Phelps and Tucker [9] considered anisotropic diffusion

DψDt=12𝐩((Ω𝐩+λΓ𝐩λΓ:𝐩𝐩𝐩)ψ)+𝐩(I𝐩𝐩)Dr𝐩ψ\frac{D\psi}{Dt}=-\tfrac{1}{2}{\boldsymbol{\nabla}}_{\mathbf{p}}\cdot((\Omega\cdot{\mathbf{p}}+\lambda\Gamma\cdot{\mathbf{p}}-\lambda\Gamma:{\mathbf{p}}{\mathbf{p}}{\mathbf{p}})\psi)+{\boldsymbol{\nabla}}_{\mathbf{p}}\cdot(I-{\mathbf{p}}{\mathbf{p}})\cdot D_{r}\cdot{\boldsymbol{\nabla}}_{\mathbf{p}}\psi (3)

where DrD_{r} is the anisotropic diffusion matrix, calculated as a function of ψ\psi and u{\boldsymbol{\nabla}}u (see, e.g., [9, 10]).

Since these are, in effect, partial differential equations in 5-spacial dimensions (3 for space and 2 for the orientation defined on a unit sphere), numerically calculating solutions can be rather daunting with solutions taking days to weeks for simple flows. Hence Hinch and Leal [18] suggested to recast the equation in terms of moment tensors. For example, the second and fourth moment tensors are defined by

A=S𝐩𝐩ψ𝑑𝐩,𝔸=S𝐩𝐩𝐩𝐩ψ𝑑𝐩\displaystyle A=\int_{S}{\mathbf{p}}{\mathbf{p}}\psi\,d{\mathbf{p}},\qquad\qquad\mathbb{A}=\int_{S}{\mathbf{p}}{\mathbf{p}}{\mathbf{p}}{\mathbf{p}}\psi\,d{\mathbf{p}} (4)

Then Jeffery’s equation (1) for the second order moment tensor can be expressed as

DADt=12(ΩAAΩ+λ(ΓA+AΓ)2λ𝔸:Γ)\frac{DA}{Dt}=\tfrac{1}{2}(\Omega\cdot A-A\cdot\Omega+\lambda(\Gamma\cdot A+A\cdot\Gamma)-2\lambda\mathbb{A}:\Gamma) (5)

and the equations (2) and (3) with diffusion terms become

DADt=12(ΩAAΩ+λ(ΓA+AΓ)2λ𝔸:Γ)+𝒟[A]\frac{DA}{Dt}=\tfrac{1}{2}(\Omega\cdot A-A\cdot\Omega+\lambda(\Gamma\cdot A+A\cdot\Gamma)-2\lambda\mathbb{A}:\Gamma)+\mathcal{D}[A] (6)

where 𝒟[A]\mathcal{D}[A] for isotropic diffusion as expressed in equation (2) becomes

𝒟[A]=Dr(2I6A)\mathcal{D}[A]=D_{r}(2I-6A) (7)

and subsequently the anisotropic diffusion of equation (3) (see [9]) is

𝒟[A]=2Dr2(trDr)A5(ADr+DrA)+10𝔸:Dr\mathcal{D}[A]=2D_{r}-2(\mathop{\text{tr}}D_{r})A-5(A\cdot D_{r}+D_{r}\cdot A)+10\mathbb{A}:D_{r} (8)

The difficulty with equations (5) and (6) is that they explicitly include the fourth order moment tensor, and implicitly the higher order diffusion models of equation (8) include moments higher than the second-moment. To circumvent this problem, various authors (for example, [18, 19, 20, 21, 6, 1, 22, 23, 24]) have proposed closures, that is, formulae to calculate the fourth order moment tensor 𝔸\mathbb{A} from the second order moment tensor AA. The mapping from AA to 𝔸{\mathbb{A}} is not unique, thus closures are only able to approximately obtain a higher order moment from the lower order moments. Most closures are often constructed by obtaining the best-fit coefficients of for a polynomial by fitting numerical data obtained by directly evaluating equation (2) using a finite element method to solve equation (2) (for example, Bay [25]).

3 The Fast Exact Closure

Verleye and Dupret [21] (see also [12, 13, 26, 27, 28]) noted that there is an exact closure for Jeffery’s equation when the diffusion terms are not present, in the particular case that the fiber orientation distribution is at some time isotropic. This exact closure is stated explicitly in [14] for the scenario when the suspension is dilute. For the sake of labeling, the present closure retains the reference Exact Closure, as it is exact for Jeffery’s equation without diffusion terms.

The Exact Closure may be directly computed by solving the elliptic integral forms presented in equation (6), where 𝔸\mathbb{A} is computed from AA using equations (38) and (39) as derived in [14]. This approach only gives the exact answer to equations (2) and (3) when Dr=0D_{r}=0 and when the orientation is isotropic at some time. Nevertheless it is reasonable to suppose that the exact closure should give a reasonable approximation in general, even when Dr0D_{r}\neq 0 as in Verweyst et al. [1, 13]. Their ORT closure is a polynomial approximation to the Exact Closure, and as we demonstrate below, gives answers that are virtually indistinguishable from that of the Exact Closure.

The Fast Exact Closure (FEC) performs the Exact Closure in a computationally efficient manner. A version of FEC is described in [14], but only when the diffusion terms are absent. In this section we describe the FEC from an implementation perspective, and leave the full derivation to the appendix.

The idea behind the FEC is the computation of two rank 4 tensors \mathbb{C} and 𝔻\mathbb{D}, defined in equations (40) and (43), respectively, which we define as conversion tensors. These tensors convert between DA/DtDA/Dt and DB/DtDB/Dt according to the formulae

DADt=:DBDt,DBDt=𝔻:DADt\frac{DA}{Dt}=-\mathbb{C}:\frac{DB}{Dt},\qquad\qquad\frac{DB}{Dt}=-\mathbb{D}:\frac{DA}{Dt} (9)

as derived in equations (51) - (53). The orientation tensor AA retains the classical meaning as described in [4] and the tensor BB turns out to be extremely useful for computations. BB appears to be a more abstract quantity to describe the degree of orientation much like the orientation tensor. For example, when the orientation parameter BB is given as Bij=δijB_{ij}=\delta_{ij} this is analogous to saying that the orientation is isotropic, whereas when one of the diagonal terms of BB goes to 0, it indicates that the orientation is perfectly aligned along the corresponding coordinate axis. Montgomery-Smith et al. [14] provide a further discussion as to the meaning of the orientation parameter BB

What makes everything work is the formula, proven in the appendix by equation (54), that for any matrix MM, we have

:(BM+MTB)=(trM)A+MA+AMT2𝔸:M\mathbb{C}:(B\cdot M+M^{T}\cdot B)=(\mathop{\text{tr}}M)A+M\cdot A+A\cdot M^{T}-2\mathbb{A}:M (10)

where 𝔸\mathbb{A} and AA satisfy equations (38) and (39).

The FEC present in this paper will be of the form:

DADt=:F(B)+G(A),DBDt=F(B)𝔻:G(A)\frac{DA}{Dt}=-\mathbb{C}:F(B)+G(A),\qquad\qquad\frac{DB}{Dt}=F(B)-\mathbb{D}:G(A) (11)

where F(B)F(B) and G(A)G(A) will be given explicitly below. This is a general form that can be applied to a the known diffusion models that fit the form of equation (2) or (3). The conversion tensors \mathbb{C} and 𝔻\mathbb{D} are defined later in this section, and in the appendix we provide a more mathematical formula for them along with a proof of the above properties. It is important to note that \mathbb{C} and 𝔻\mathbb{D} may be computed directly from AA and BB in a rather fast manner, involving nothing more than the diagonalization and inversion of three by three symmetric matrices, general simple arithmetic, and where appropriate invoking inverse trigonometric or inverse hyperbolic functions.

The FEC solves the coupled ODEs of (11) simultaneously. If the initial fiber orientation is isotropic, then A=13IA=\tfrac{1}{3}I and B=IB=I at t=0t=0. When the initial fiber orientation is not isotropic, then one can compute the initial condition for BB from AA by inverting equation (38), as described in [14].

It can be shown that the matrices AA and BB remain positive definite, simultaneously diagonalizable, and satisfy the equations trA=detB=1\mathop{\text{tr}}A=\det B=1 for all time.

For example, the FEC for the Jeffery’s equation with isotropic diffusion given in equation (2) is given by:

DADt=12:[B(Ω+λΓ)+(Ω+λΓ)B]+Dr(2I6A)\displaystyle\frac{DA}{Dt}=\tfrac{1}{2}\mathbb{C}:[B\cdot(\Omega+\lambda\Gamma)+(-\Omega+\lambda\Gamma)\cdot B]+D_{r}(2I-6A) (12)
DBDt=12(B(Ω+λΓ)+(Ω+λΓ)B)Dr𝔻:(2I6A)\displaystyle\frac{DB}{Dt}=-\tfrac{1}{2}(B\cdot(\Omega+\lambda\Gamma)+(-\Omega+\lambda\Gamma)\cdot B)-D_{r}\mathbb{D}:(2I-6A) (13)

and the FEC for Jeffery’s equation with anisotropic diffusion as shown in equation (3) is given by

DADt=12:[B(Ω+λΓ)+(Ω+λΓ)B]+2Dr+3(trDr)A5:(BDr+DrB)\displaystyle\frac{DA}{Dt}=\tfrac{1}{2}\mathbb{C}:[B\cdot(\Omega+\lambda\Gamma)+(-\Omega+\lambda\Gamma)\cdot B]+2D_{r}+3(\mathop{\text{tr}}D_{r})A-5\mathbb{C}:(B\cdot D_{r}+D_{r}\cdot B) (14)
DBDt=12(B(Ω+λΓ)+(Ω+λΓ)B)𝔻:(2Dr+3(trDr)A)+5(BDr+DrB)\displaystyle\frac{DB}{Dt}=-\tfrac{1}{2}(B\cdot(\Omega+\lambda\Gamma)+(-\Omega+\lambda\Gamma)\cdot B)-\mathbb{D}:(2D_{r}+3(\mathop{\text{tr}}D_{r})A)+5(B\cdot D_{r}+D_{r}\cdot B) (15)

Using equation (10) it can be seen that equation (12) comes directly from equations (6) and (7), and equation (13) comes from applying equation (43) to equation (12). Similarly for the anisotropic diffusion model, this can be observed for equations (14) and (15).

Notice, for equations (12) and (13) and for equations (14) and (15), that the fourth-order orientation tensor 𝔸{\mathbb{A}} does not appear. The equation of motion for the orientation is now reduced to developing the relationship between AA and BB with that of {\mathbb{C}} and 𝔻{\mathbb{D}}. The conversion tensors {\mathbb{C}} and 𝔻{\mathbb{D}} are both computed with respect to the basis of orthonormal eigenvectors of BB. With respect to this basis, the matrix BB is diagonal with entries b1b_{1}, b2b_{2} and b3b_{3}, and AA is diagonal with entries a1a_{1}, a2a_{2} and a3a_{3} where we constrain b1b2b3b_{1}\leq b_{2}\leq b_{3} which implies that a1a2a3a_{1}\geq a_{2}\geq a_{3}.

If the eigenvalues b1b_{1}, b2b_{2} and b3b_{3} are not close to each other, then \mathbb{C} is the symmetric tensor calculated using the formulae from equations (48) and (49) from the appendix

1122=a1a22(b2b1)1111=12b11112211331133=a1a32(b3b1)2222=12b21112222332233=a2a32(b3b2)3333=12b3111332233ijkk=0 if ijk\begin{array}[]{lll}\mathbb{C}_{1122}=\frac{a_{1}-a_{2}}{2(b_{2}-b_{1})}&&\mathbb{C}_{1111}=\tfrac{1}{2}b_{1}^{-1}-\mathbb{C}_{1122}-\mathbb{C}_{1133}\\ \mathbb{C}_{1133}=\frac{a_{1}-a_{3}}{2(b_{3}-b_{1})}&&\mathbb{C}_{2222}=\tfrac{1}{2}b_{2}^{-1}-\mathbb{C}_{1122}-\mathbb{C}_{2233}\\ \mathbb{C}_{2233}=\frac{a_{2}-a_{3}}{2(b_{3}-b_{2})}&&\mathbb{C}_{3333}=\tfrac{1}{2}b_{3}^{-1}-\mathbb{C}_{1133}-\mathbb{C}_{2233}\\ \mathbb{C}_{ijkk}=0\text{ if $i\neq j\neq k$}\end{array} (16)

If two or more of the eigenvalues are close to each other, then these equations can give rise to large numerical errors, or even ‘divide by zero’ exceptions. So in this situation, we use different formulae to compute \mathbb{C}.

Suppose two of the eigenvalues are close to each other, for example, b1=b0+ϵb_{1}=b_{0}+\epsilon and b2=b0ϵb_{2}=b_{0}-\epsilon, where ϵ\epsilon is small. Thus b0=12(b1+b2)b_{0}=\tfrac{1}{2}(b_{1}+b_{2}) and ϵ=12(b1b2)\epsilon=\tfrac{1}{2}(b_{1}-b_{2}). Define the quantity n\mathcal{I}_{n} from equation (50) and with equations (57) and (58) this quantity can be expressed as

n+1=2n12n(b0b3)nb3nb0n(b0b3) if n11=2b0b3cos1(b3b0) if b0>b31=2b3b0cosh1(b3b0) if b0<b3\begin{split}\mathcal{I}_{n+1}=\frac{2n-1}{2n(b_{0}-b_{3})}\mathcal{I}_{n}-\frac{\sqrt{b_{3}}}{nb_{0}^{n}(b_{0}-b_{3})}\text{ if $n\geq 1$}\\ \mathcal{I}_{1}=\frac{2}{\sqrt{b_{0}-b_{3}}}\cos^{-1}\left(\sqrt{\frac{b_{3}}{b_{0}}}\right)\text{ if $b_{0}>b_{3}$}\\ \mathcal{I}_{1}=\frac{2}{\sqrt{b_{3}-b_{0}}}\cosh^{-1}\left(\sqrt{\frac{b_{3}}{b_{0}}}\right)\text{ if $b_{0}<b_{3}$}\end{split} (17)

Then replace the first equation of equation (16) by

1122=143+385ϵ2+O(ϵ4)\mathbb{C}_{1122}=\tfrac{1}{4}\mathcal{I}_{3}+\tfrac{3}{8}\mathcal{I}_{5}\epsilon^{2}+O(\epsilon^{4}) (18)

If all three of the eigenvalues are almost equal, that is b1=1+c1b_{1}=1+c_{1}, b2=1+c2b_{2}=1+c_{2}, b3=1+c3b_{3}=1+c_{3} with |c1|,|c2|,|c3|ϵ|c_{1}|,|c_{2}|,|c_{3}|\leq\epsilon, then it can be similarly shown that

1122=110328c1328c2128c3+548c12+18c1c2+124c1c3+548c22+124c2c3+148c3235352c1345352c12c215352c12c345352c1c229176c1c2c39352c1c3235352c2315352c22c39352c2c325352c33+O(ϵ4)\begin{split}\mathbb{C}_{1122}&=\textstyle\frac{1}{10}-\frac{3}{28}c_{1}-\frac{3}{28}c_{2}-\frac{1}{28}c_{3}+\frac{5}{48}c_{1}^{2}+\frac{1}{8}c_{1}c_{2}+\frac{1}{24}c_{1}c_{3}+\frac{5}{48}c_{2}^{2}+\frac{1}{24}c_{2}c_{3}+\frac{1}{48}c_{3}^{2}\\ &\phantom{={}}\textstyle-\frac{35}{352}c_{1}^{3}-\frac{45}{352}c_{1}^{2}c_{2}-\frac{15}{352}c_{1}^{2}c_{3}-\frac{45}{352}c_{1}c_{2}^{2}-\frac{9}{176}c_{1}c_{2}c_{3}\\ &\phantom{={}}\textstyle-\frac{9}{352}c_{1}c_{3}^{2}-\frac{35}{352}c_{2}^{3}-\frac{15}{352}c_{2}^{2}c_{3}-\frac{9}{352}c_{2}c_{3}^{2}-\frac{5}{352}c_{3}^{3}+O(\epsilon^{4})\end{split} (19)

with similar formulae for 1133\mathbb{C}_{1133} and 2233\mathbb{C}_{2233}. The remaining entries of \mathbb{C} are computed using the last four equations from (16).

The rank 4 conversion tensor 𝔻\mathbb{D} given in equation (9) is defined through equation (43) with respect to the basis of orthonormal eigenvectors of BB, and can be simplified to

[𝔻1111𝔻1122𝔻1133𝔻2211𝔻2222𝔻2233𝔻3311𝔻3322𝔻3333]=[111111221133221122222233331133223333]1𝔻ijij=𝔻ijji=14ijij if ij𝔻ijkk=0 if ijk\begin{split}\left[\begin{smallmatrix}\mathbb{D}_{1111}&\mathbb{D}_{1122}&\mathbb{D}_{1133}\\ \mathbb{D}_{2211}&\mathbb{D}_{2222}&\mathbb{D}_{2233}\\ \mathbb{D}_{3311}&\mathbb{D}_{3322}&\mathbb{D}_{3333}\end{smallmatrix}\right]\quad&=\quad\left[\begin{smallmatrix}\mathbb{C}_{1111}&\mathbb{C}_{1122}&\mathbb{C}_{1133}\\ \mathbb{C}_{2211}&\mathbb{C}_{2222}&\mathbb{C}_{2233}\\ \mathbb{C}_{3311}&\mathbb{C}_{3322}&\mathbb{C}_{3333}\end{smallmatrix}\right]^{-1}\\ \mathbb{D}_{ijij}=\mathbb{D}_{ijji}=\frac{1}{4\mathbb{C}_{ijij}}\text{ if $i\neq j$}&\qquad\quad\mathbb{D}_{ijkk}=0\text{ if $i\neq j\neq k$}\end{split} (20)

Note that there is no reason to suppose that 𝔻\mathbb{D} is completely symmetric because in general 𝔻ijij\mathbb{D}_{ijij} will not be the same as 𝔻iijj\mathbb{D}_{iijj}.

In performing the numerical calculations, it is more efficient when forming DA/DtDA/Dt and DB/DtDB/Dt from equation (11) to calculate the right hand side in the coordinate system of the orthonormal eigenvectors of BB, and then convert back to the standard coordinate system when solving for AA and BB.

For example, suppose 𝔹\mathbb{B} is any rank four tensor such that 𝔹ijkk=0\mathbb{B}_{ijkk}=0 if ijki\neq j\neq k, and 𝔹ijkl=𝔹jikl=𝔹klij\mathbb{B}_{ijkl}=\mathbb{B}_{jikl}=\mathbb{B}_{klij}. Suppose also that NN is a symmetric matrix. Then 𝔹:N\mathbb{B}:N can be calculated by first defining the matrices M𝔹M_{\mathbb{B}} and M~𝔹\tilde{M}_{\mathbb{B}} as

M𝔹=[𝔹1111𝔹1122𝔹1133𝔹1122𝔹2222𝔹2233𝔹1133𝔹2233𝔹3333],M~𝔹=[0𝔹1212𝔹1313𝔹12120𝔹2323𝔹1313𝔹23230]M_{\mathbb{B}}=\left[\begin{smallmatrix}\mathbb{B}_{1111}&\mathbb{B}_{1122}&\mathbb{B}_{1133}\\ \mathbb{B}_{1122}&\mathbb{B}_{2222}&\mathbb{B}_{2233}\\ \mathbb{B}_{1133}&\mathbb{B}_{2233}&\mathbb{B}_{3333}\end{smallmatrix}\right],\qquad\tilde{M}_{\mathbb{B}}=\left[\begin{smallmatrix}0&\mathbb{B}_{1212}&\mathbb{B}_{1313}\\ \mathbb{B}_{1212}&0&\mathbb{B}_{2323}\\ \mathbb{B}_{1313}&\mathbb{B}_{2323}&0\end{smallmatrix}\right] (21)

then decompose

N=diag(𝐧)+N~N=\text{diag}(\mathbf{n})+\tilde{N} (22)

where 𝐧=(N11,N22,N33)\mathbf{n}=(N_{11},N_{22},N_{33}), and N~\tilde{N} is the matrix of the off-diagonal elements of NN. It follows that

𝔹:N=diag(M𝔹𝐧)+2M~𝔹N~\mathbb{B}:N=\text{diag}(M_{\mathbb{B}}\cdot\mathbf{n})+2\tilde{M}_{\mathbb{B}}\circ\tilde{N} (23)

where for any matrices UU and VV we define the entrywise product (also known as the Hadamard or Schur product) by (UV)ij=UijVij(U\circ V)_{ij}=U_{ij}V_{ij}.

3.1 The Reduced Strain Closure

Wang et al. [8] described a method that slows down the rate of alignment of the fibers, which the paper calls the reduced strain closure model (RSC). The method is implemented by selecting a number 0<κ10<\kappa\leq 1, which is identified as the rate of reduction. The authors [8] define the tensor

𝕄=i=13𝐞i𝐞i𝐞i𝐞i\mathbb{M}=\sum_{i=1}^{3}{\mathbf{e}}_{i}{\mathbf{e}}_{i}{\mathbf{e}}_{i}{\mathbf{e}}_{i} (24)

where 𝐞1{\mathbf{e}}_{1}, 𝐞2{\mathbf{e}}_{2}, 𝐞3{\mathbf{e}}_{3} are the orthonormal eigenvectors for AA. The RSC replaces equations of the form

DADt=F(A)\frac{DA}{Dt}=F(A) (25)

by

DADt=F(A)(1κ)𝕄:F(A)\frac{DA}{Dt}=F(A)-(1-\kappa)\mathbb{M}:F(A) (26)

It turns out this form is simple to reproduce for the FEC. If equation (25) is represented by the FEC

DADt=F(A,B),DBDt=G(A,B)\frac{DA}{Dt}=F(A,B),\qquad\frac{DB}{Dt}=G(A,B) (27)

then the effect of equation (26) is precisely modeled by the new FEC

DADt=F(A,B)(1κ)𝕄:F(A,B),DBDt=G(A,B)(1κ)𝕄:G(A,B)\frac{DA}{Dt}=F(A,B)-(1-\kappa)\mathbb{M}:F(A,B),\qquad\frac{DB}{Dt}=G(A,B)-(1-\kappa)\mathbb{M}:G(A,B) (28)

Finally, from a computational point of view, it should be noticed that if we are working in the basis of orthonormal eigenvectors of BB, then for any symmetric matrix NN we have that 𝕄:N\mathbb{M}:N is simply the diagonal part of NN, that is, diag(N11,N22,N33)\text{diag}(N_{11},N_{22},N_{33}).

3.2 Is the solution to FEC always physical?

By the phrase “the solutions stay physical” we mean that AA stays positive definite with trace one, that is, there exists a fiber orientation distribution ψ\psi that satisfies equation (4). In fact, if AA ever ceases to become positive definite, then not only is the Exact Closure going to give the wrong answer, it even ceases to have a meaning in that equation (38) which is used to define AA in terms of BB cannot be solved. Thus another way to state “the solutions stay physical” is that BB stays positive definite and finite, that is, none of the eigenvalues of BB become zero, and none of them become infinite.

Theorem 1

The FEC solution to the isotropic diffusion equations (12) and (13) have global in time physical solutions if Ω\Omega, Γ\Gamma and DrD_{r} are bounded.

Theorem 2

The FEC solution to the anisotropic diffusion equations (14) and (15) have global in time physical solutions if DrD_{r} is positive definite, and Ω\Omega, Γ\Gamma, D(Dr)/DtD(D_{r})/Dt, DrD_{r} and 1/Dr11/\|D_{r}^{-1}\| are bounded.

where the proofs for both theorems are given in the Appendix beginning with equation (65). Unfortunately Theorem 2 will not necessarily apply to the Koch model [10] nor to the Phelps-Tucker ARD model [9], as there is no guarantee that 1/Dr11/\|D_{r}^{-1}\| is bounded nor, in the ARD case, that DrD_{r} is positive definite, unless extra hypotheses are applied.

3.3 Algorithm Summary

The algorithm to solve the FEC closure for the second-order orientation tensor AA and the second-order tensor BB can be summarized as:

  1. 1.

    Initialize AA and BB, and define λ\lambda along with any constants needed for the diffusion model 𝒟[A]{\mathcal{D}}\left[A\right]

  2. 2.

    At time tit_{i}, rotate the tensors AA and BB into the principal frame of BB

  3. 3.

    When the eigenvalues are distinct, use equation (16) for {\mathbb{C}}. Otherwise when two eigenvalues are repeated, use equation (17) along with equation (18), or in the case when three eigenvalues are repeated, use equation (19).

  4. 4.

    From {\mathbb{C}}, compute 𝔻{\mathbb{D}} using equation (20) in the principal frame of BB

  5. 5.

    Compute DA/DtDA/Dt and DB/DtDB/Dt using either equations (12) and (13) for isotropic diffusion or equations (14), (15) and (28) for the anisotropic diffusion model, ARD-RSC. For the symmetric rank four tensor contractions with rank two tensors, use equation (23) to reduce the number of redundant multiplication operations.

  6. 6.

    Rotate DA/DtDA/Dt and DB/DtDB/Dt into the flow reference frame, and extrapolate A(ti+1)A\left(t_{i+1}\right) and B(ti+1)B\left(t_{i+1}\right) from time tit_{i} using any standard ODE solver.

There are a number of coding issues we encountered, and we feel it will be helpful to share as it will aid others in their computational implementations.

  • 1.

    There is a choice to compute the basis of orthonormal eigenvectors from either AA or BB, where in theory these should be identical. We compute the basis from BB, arguing that the quantity BB is somehow more ‘fundamental’ and AA is ‘derived’ from BB, which is true in the absence of diffusion.

  • 2.

    We solve a ten dimensional set of ODEs, five for AA, and five for BB, where one of the components of both AA and BB can be obtained, respectively, from the relationships trA=1\mathop{\text{tr}}A=1 and detB=1\det B=1.

  • 3.

    When computing AA from the orthonormal eigenvector basis of BB, it is important to force the off diagonal entries to be non-zero to limit numerical drifting. In our studies, we found that failing to do this could cause an adaptive ODE solver to completely freeze in select scenarios.

  • 4.

    We set the ODE solver to work with a relative tolerance of 10510^{-5}, and choose to use equations (18) or (19) when the eigenvalues were within 10410^{-4} of each other. This should cause \mathbb{C} to be computed with an accuracy of about 10810^{-8} when using equations (16), and nearly machine precision when using equations (18) or (19).

4 Numerical Results

Results are presented to demonstrate the accuracy improvements from employing the FEC closure, and just as important to demonstrate the computational speed advances over the similarly accurate orthotropic closures. In the present examples, all flows have an initial isotropic orientation state designated by A11=A22=A33=1/3A_{11}=A_{22}=A_{33}=1/3 and B11=B22=B33=1B_{11}=B_{22}=B_{33}=1, with all other components of AA and BB being zero. The accuracy of the closure does not depend on the initial orientation state, the isotropic orientation state is chosen for uniformity. The equations of motion are solved using the FEC closure for AA and BB from equations (12) and (13) for isotropic diffusion or from equations (14), (15) and (28) for the anisotropic rotary diffusion model with the reduced strain closure ARD-RSC from Phelps and Tucker [9]. For comparison, the classical equations of motion for the second-order orientation tensor AA requiring a curve-fitted closure for the fourth-order orientation tensor 𝔸{\mathbb{A}}, are solved using equations (6) and (7) for Folgar-Tucker diffusion and equations (6), (8) and (25) for the ARD-RSC diffusion model. Results are compared to solutions obtained using the Spherical Harmonic approach [29] for solving the full distribution function equations (2) and (3). It has been demonstrated in [29] that solutions using the Spherical Harmonic approach are only limited in their accuracy by machine precision and require considerably less computational effort than solutions using the control volume approach of Bay [25]. Although a great reduction in speed and an advancement in accuracy, the Spherical Harmonic approach still requires more effort than the orientation tensor approach, nor does it readily lend itself to an applicable form for coupling with commercial FEA solvers. We select three commonly employed closures for comparisons. The first is the classical Hybrid closure of Advani and Tucker [4] is selected as it is regularly used in commercial and research codes due to its computational efficiency and ease of implementation. The second is an orthotropic closure, whose class of closures has found increasing use due to their considerable accuracy improvements over the Hybrid closure. In our study we select the ORT closure presented by VerWeyst and Tucker [1] based on the Wetzel closure [12]. Our third closure is that of the IBOF from Chung and Kwon [22] which is claimed to be a more computationally efficient orthotropic closure as it uses the invariants of AA as opposed to the eigenvalues of AA thus avoiding costly tensor rotations.

4.1 Results: Simple Shear Flow

The first example is that of a pure shearing flow, given by v1=Gx3v_{1}=Gx_{3} and v2=v3=0v_{2}=v_{3}=0. Pure shearing flow is commonly employed (see e.g., [6, 22, 30]) to demonstrate a particular closure problem due to the oscillatory nature of alignment inherent to the Jeffery fiber orbits. Two scenarios are presented, the first of the Folgar-Tucker isotropic diffusion model in equation (2) where Dr=CIγ˙D_{r}=C_{I}\dot{\gamma}, and the second scenario for the ARD-RSC anisotropic diffusion model.

4.1.1 Simple Shear Flow Orientation

In industrial simulations, the Folgar-Tucker isotropic diffusion model typically has interaction coefficients that range from CI=103C_{I}=10^{-3} to CI=102C_{I}=10^{-2}. The effective fiber aspect ratio ranges from 5 to 30 (ae1.4×ara_{e}\simeq 1.4\times a_{r}, where ara_{r} is the aspect ratio of cylindrical fibers), which corresponds to a shape correction factor ranging from λ=0.96\lambda=0.96 to λ=0.999\lambda=0.999. Two simulation results using isotropic diffusion are presented in Figures 1(a) and (b), the first is for CI=103C_{I}=10^{-3} with λ=0.99\lambda=0.99 and the later for CI=102C_{I}=10^{-2} with λ=0.95\lambda=0.95. Results for the IBOF closure are not shown as they are nearly graphically indistinguishable from the ORT closure results. It is important to observe that the ORT and the FEC closure yield results that are graphically indistinguishable and reasonably close to the orientation state predicted from the numerically exact Spherical Harmonic solution. Conversely, the orientation results from the Hybrid closure tend to over predict the the true orientation state. It is important to point out the apparent oscillatory nature of the transient solution for the Spherical Harmonic results when CI=103C_{I}=10^{-3} with λ=0.99\lambda=0.99, which occurs to a lesser extent for CI=102C_{I}=10^{-2}. These oscillations are expected due to the low amount of diffusion present. Equally important is to notice that the oscillations from the FEC closure, as well as the ORT, both damp out to the same steady state value. Note also that the FEC does not oscillate excessively for either of the isotropic flow conditions presented, which was a problem that plagued the early orthotropic closures (see e.g., [6] and [31]) and the early neural network closures [32]. There remains room for further accuracy improvements (see e.g., [33] for several preliminary higher accuracy closures). However, it is speculated based upon the discussion in Jack and Smith [34] that such improvements will be slight when solving the second-order moment equations, and higher order moment simulations, such as those that use sixth-order closures (see e.g., [24]) may need to be considered for significant accuracy improvements.

The Folgar-Tucker model has been used for decades, but tends to overstate the rate of alignment during the transient solution (see e.g., [7]). The ARD-RSC model [9] seeks to address these limitations, but few studies have focused on this new diffusion model and the dependance of computed results on the choice of closure. In the ARD-RSC model, the rotary diffusion coefficient of Folgar and Tucker isotropic diffusion model (Dr=CIγ˙D_{r}=C_{I}\dot{\gamma} where γ˙=(12Γ:Γ)1/2\dot{\gamma}=\left(\frac{1}{2}\Gamma:\Gamma\right)^{1/2}) is replaced by an anisotropic diffusion coefficient expressed by

Dr=b1γ˙I+b2γ˙A+b3γ˙A2+12b4Γ+14b5γ˙1Γ2D_{r}=b_{1}\dot{\gamma}I+b_{2}\dot{\gamma}A+b_{3}\dot{\gamma}A^{2}+\tfrac{1}{2}b_{4}\Gamma+\tfrac{1}{4}b_{5}\dot{\gamma}^{-1}\Gamma^{2} (29)

where

(b1,b2,b3,b4,b5)=(1.924×104,5.839×103,4.0×102,1.168×105,0)(b_{1},b_{2},b_{3},b_{4},b_{5})=(1.924\times 10^{-4},5.839\times 10^{-3},4.0\times 10^{-2},1.168\times 10^{-5},0) (30)

The ARD-RSC model serves as an excellent example of the effectiveness of the FEC approach for solving the tensor form of orientation as the ARD-RSC model will yield orientation states that are considerably different than that of the Folgar-Tucker model. Results from the various closures and the spherical harmonic results are presented in Figure 2 for the ARD-RSC flow with κ=1/30\kappa=1/30. The value of κ=1/30\kappa=1/30 is taken from the results presented in Phelps and Tucker [9], which was based on their experimental observations. For a fiber aspect ratio of 5\sim 5, corresponding to λ=0.95\lambda=0.95, each of the investigated closures produces graphically similar results. During the initial flow stages, the Hybrid tends to over predict alignment, whereas the ORT and the FEC tend to under predict alignment. As steady state is attained, the FEC and the ORT yield nearly identical results, both of which over predict A11A_{11} in the final orientation state whereas the Hybrid yields a reasonable representation of the orientation. For a long fiber, corresponding to λ1\lambda\rightarrow 1, the trends are similar to those of the lower aspect ratio fibers, but in this case the FEC and the ORT better represent the final orientation state relative to the Hybrid.

4.1.2 Orthotropic Closure Errors

The ORT is a polynomial approximation to the Exact Closure, as demonstrated in the preceding section, and it is not surprising that the two approaches yield graphically indistinguishable results for many of the flows investigated. On closer inspection of the transient solution of the ARD-RSC model for κ=1/30\kappa=1/30 and λ=1\lambda=1 there is a slight difference. This difference is shown in Figure 3(a) where a closeup view is provided of the A11A_{11} component for the flow times of 800Gt1,200800\leq Gt\leq 1,200. These results indicate how well the fitting was performed in the construction of the ORT. As the ORT is an approximation of the Exact Closure of Montgomery-Smith et al. [14] for pure Jeffery’s flow, it is of interest to determine whether the slight deviation comes from the Jeffery’s component or the diffusion component of equation (6). To this end, we performed a comparison for the derivative of AA computed in two different ways. First, for each point in time tt, we computed A(t)A(t) and B(t)B(t) using the FEC method. Then we computed four quantities: DAFEC, DiffDt\frac{DA^{\text{\tiny FEC, Diff}}}{Dt} which contains the terms from the right hand side of equation (14) that explicitly include DrD_{r}, DAFEC, JeffDt\frac{DA^{\text{\tiny FEC, Jeff}}}{Dt} which contains the terms from the right hand side of equation (14) that do not involve DrD_{r}, DAORT, DiffDt\frac{DA^{\text{\tiny ORT, Diff}}}{Dt} the right hand side of equation (8), and DAORT, JeffDt\frac{DA^{\text{\tiny ORT, Jeff}}}{Dt} the right hand side of equation (6) when 𝒟(A)\mathcal{D}(A) is set to zero. In the latter two cases 𝔸\mathbb{A} is computed using the ORT closure. The error is then defined as

EDiffusion=i=13j=13(DAijFEC, DiffDtDAijORT, DiffDt)2\displaystyle E_{\text{\tiny Diffusion}}=\sqrt{\sum_{i=1}^{3}\sum_{j=1}^{3}\left(\frac{DA_{ij}^{\text{\tiny FEC, Diff}}}{Dt}-\frac{DA_{ij}^{\text{\tiny ORT, Diff}}}{Dt}\right)^{2}} (31)
EJeffery=i=13j=13(DAijFEC, JeffDtDAijORT, JeffDt)2\displaystyle E_{\text{\tiny Jeffery}}=\sqrt{\sum_{i=1}^{3}\sum_{j=1}^{3}\left(\frac{DA_{ij}^{\text{\tiny FEC, Jeff}}}{Dt}-\frac{DA_{ij}^{\text{\tiny ORT, Jeff}}}{Dt}\right)^{2}} (32)

Each of the two errors are plotted in Figure 3(b). It is clear from the figure that although the ORT’s derivative calculation from the diffusion component is not zero, it is minor in comparison to the error from the Jeffery’s part of the orientation tensor equation of motion. This error is only a rough indication of the sources of error, but values of 0.04% at a given moment in flow time can account for an error as large as 40% for AA for the flow times on the order 1,000. Since the errors from each of the possible sources probably do not drive the error in the solution toward the same direction, the total error would be expected to be less than the upper bound of 40%, where in reality the error is closer to 0.9% as steady state is approached.

Since the ORT and FEC differ by about 0.9%, it begs the question as to which is more accurate in computing the true exact closure. While the FEC in theory should exactly compute the exact closure, it is possible that numerical errors creep into the FEC. To test for this, we performed a consistency check. After finding the solution A(t)A(t) and B(t)B(t) using the FEC, we calculated

EExact=i=12j=13(A(B)ijAij)2E_{\text{\tiny Exact}}=\sqrt{\sum_{i=1}^{2}\sum_{j=1}^{3}\left(A(B)_{ij}-A_{ij}\right)^{2}} (33)

where A(B)A(B) was computed using equation (38). This calculation was performed by diagonalizing BB, applying the elliptic integrals in equation set (47) using the software package [35], and then performing the reverse change of basis. The results for the ARD-RSC model with κ=1/30\kappa=1/30 and λ=1.00\lambda=1.00 show an error of less than 10810^{-8} throughout the transient solution, thus suggesting the implementation as presented in this paper for the FEC is quite accurate.

4.2 Results: Orientation Error Summary

To quantify the errors observed in Figures 1(a) and (b) for the isotropic diffusion models, a series of fourteen flows are studied as outlined in table 1 where λ=1\lambda=1 for each of the flows. The solution is obtained using the classical closure methods and the FEC closure results are compared to solutions obtained from the Spherical Harmonic approach. To quantify the error, the time average of the Frobenius Norm of the difference between the true solution AijSpherical(t)A_{ij}^{\mbox{\tiny Spherical}}(t) and the approximate solution obtained from a closure AijClosure(t)A_{ij}^{\mbox{\tiny Closure}}(t) is computed as

E¯Closure=1tft0t0tfi=13j=13|AijSpherical(t)AijClosure(t)|2𝑑t\displaystyle\overline{E}_{\mbox{\tiny Closure}}=\frac{1}{t_{f}-t_{0}}\int_{t_{0}}^{t_{f}}\sqrt{\sum_{i=1}^{3}\sum_{j=1}^{3}\left|A_{ij}^{\mbox{\tiny Spherical}}(t)-A_{ij}^{\mbox{\tiny Closure}}(t)\right|^{2}}dt (34)

where t0t_{0} is the initial time where the fiber orientation is isotropic and tft_{f} is the time when the steady state is attained, which in this example will be defined when the magnitude of the largest derivative of the eigenvalues of AA is less than G×104G\times 10^{-4}. This can be expressed as the smallest moment in time when the following is satisfied (maxi{1,2,3}|DA(i)Dt(t)|)G×104\left(\max_{i\in\{1,2,3\}}|\frac{DA_{(i)}}{Dt}(t)|\right)\leq G\times 10^{-4}. The quantitative error metric in equation (34) yields a value for the simple shear flow of Figure 1(b) for the FEC, ORT and Hybrid closures of, respectively, 4.74×1024.74\times 10^{-2}, 4.85×1024.85\times 10^{-2} and 1.75×1011.75\times 10^{-1}. As the objective is to compare the relative accuracy improvements between the FEC closure and the existing closures we will normalize the error metric in equation (34) as

ε¯Closure\displaystyle\overline{\varepsilon}_{\mbox{\tiny Closure}} \displaystyle\equiv E¯ClosureminClosure(E¯Closure)\displaystyle\frac{\overline{E}_{\mbox{\tiny Closure}}}{\min\limits_{\mbox{\tiny Closure}}\left(\overline{E}_{\mbox{\tiny Closure}}\right)} (35)

where the closure with the greatest accuracy will have a value of ε¯Closure=1\overline{\varepsilon}_{\mbox{\tiny Closure}}=1, and the remaining closures will have a value of ε¯Closure\overline{\varepsilon}_{\mbox{\tiny Closure}} in excess of 1. For each of the flows studied, the normalized error of equation (35) is tabulated in Table 1 for the FEC, ORT, IBOF and the Hybrid closures. In each of the flows considered, the FEC performs as well as or better than the orthotropic closures.

4.3 Results: Combined Flow

A classical flow to demonstrate the effectiveness and robustness of a closure is that of the combined flow presented in Cintra and Tucker [6]. This flow is often selected as the orientation state crisscrosses the eigenspace of possible orientations. The combined flow begins with pure shear in the x1x2x_{1}-x_{2} direction for 0Gt<100\leq Gt<10 defined by the velocity field v1=Gx2v_{1}=Gx_{2}, v2=v3=0v_{2}=v_{3}=0. The flow then transitions to shearing flow in the x2x3x_{2}-x_{3} plane with stretching in the x3x_{3} direction during the time 10Gt<2010\leq Gt<20 defined by the velocity field v1=1/20Gx1v_{1}=-1/20Gx_{1}, v2=1/20Gx2+Gx3v_{2}=-1/20Gx_{2}+Gx_{3} and v3=1/10Gx3v_{3}=1/10Gx_{3}. The flow then transitions to a flow with a considerable amount of stretching in the x1x_{1} direction with a reduced amount of shearing in the x2x3x_{2}-x_{3} plane for 20Gt20\leq Gt defined by the velocity field v1=Gx1v_{1}=Gx_{1}, v2=1/2Gx2+Gx1v_{2}=-1/2Gx_{2}+Gx_{1} and v3=1/2x3v_{3}=-1/2x_{3}. The times where the flow transitions are chosen to prevent the orientation from attaining steady state, thus any error in the transient solution will be propagated to the next flow state. As observed in Figure 4 for flow results from the Folgar-Tucker model with CI=102C_{I}=10^{-2} and λ=1\lambda=1, the ORT and the FEC again yield similar results. This is significant as it further demonstrates the robustness and the accuracy of the FEC.

4.4 Results: Center-gated Disk Flow

The final flow investigated is that of the center-gated disk, a typical flow condition in industrial processes [1, 36]. The flow enters the mold through the pin gate and flows radially outward, where the velocity is a function of both the gap height 2b2b and the radial distance from the gate rr. The velocity gradient for a Newtonian fluid can be represented by [6]

vr=3Q8πrb(1(zb)2),vθ=vz=0\displaystyle v_{r}=\frac{3Q}{8\pi rb}\left(1-\left(\frac{z}{b}\right)^{2}\right),\>\>\>\>v_{\theta}=v_{z}=0 (36)
vixj=3Q8πrb[1r(1z2b2)02bzb01r(1z2b2)0000]\displaystyle\frac{\partial v_{i}}{\partial x_{j}}=\frac{3Q}{8\pi rb}\left[\begin{smallmatrix}-\frac{1}{r}\left(1-\frac{z^{2}}{b^{2}}\right)&0&-\frac{2}{b}\frac{z}{b}\\ 0&\frac{1}{r}\left(1-\frac{z^{2}}{b^{2}}\right)&0\\ 0&0&0\\ \end{smallmatrix}\right] (37)

where zz is the gap height location between the mold walls, bb is half the gap height thickness, and QQ is the flow rate. Orientation results are presented in Figure 5 for a gap height of z/b=4/10z/b=4/10 for isotropic diffusion with CI=102C_{I}=10^{-2} and λ=1\lambda=1. Again, the Hybrid overshoots the actual orientation state, whereas the ORT and the FEC behave in a graphically identical fashion. This last result further demonstrates the robustness of the FEC approach. Similar tests were performed for gap heights of z/b=0,1/10,2/10,,9/10z/b=0,1/10,2/10,\ldots,9/10 and similar conclusions were observed at all gap heights.

4.5 Results: Computational Time Enhancement

An additional goal for any new closure is that of reducing the computational requirements for numerical solutions. Simulations are performed using in-house developed single threaded code using Intel’s FORTRAN 90 compiler version 11.1. Computations are solved on a standard desktop with an Intel i7 processor with 8 GB of Ram. The solution of the ORT has been studied by the investigators for several years, and a reasonably efficient algorithm has been developed. Solutions for the IBOF were made using the FORTRAN 90 code discussed in Jack et al. [30].

Notice from Equations (12) and (13) that the operations :[]{\mathbb{C}}:\left[\cdots\right] and 𝔻:[]{\mathbb{D}}:\left[\cdots\right] are independent of coordinate frame. As we explained in equation (23), in the principal frame there are a considerable number of terms in both {\mathbb{C}} and 𝔻{\mathbb{D}} that are zero that are known prior to any calculations, and thus operations involving 0 can be avoided in the coding. In addition, computing DA/DtDA/Dt and DB/DtDB/Dt in the principle reference frame and then rotating the resulting 3×33\times 3 tensors into the local reference frame will be more efficient than rotating the 3×3×3×33\times 3\times 3\times 3 tensors {\mathbb{C}} and 𝔻{\mathbb{D}} into the local reference frame and then computing DA/DtDA/Dt and DB/DtDB/Dt. All computations of the FEC utilize this characteristic, and thus greatly reduce the computational efforts. In addition, redundant calculations from Equations (12) and (13) are closely followed and performed only once. These computations are particularly frequent in the double contractions of the fourth-order tensors with the second-order tensors.

In the first study, computations were performed for the previous closure operations for the ORT and the Hybrid using algorithms similar to implementations discussed in the literature. In studies using an adaptive step size solver, solutions for the IBOF took nearly 10 times that of the ORT, whereas for the fixed step size the two closures required similar computational efforts. To avoid any computational comparisons introduced by an adaptive step size solver, computations were performed using a fixed step-size fourth-order Runge-Kutta (R-K) solver with a very small step size of ΔGt=104\Delta Gt=10^{-4}. Computational times are tabulated in Table 2 for both CPU time and normalized time. Normalized time is defined based off of the often employed Hybrid closure using the standard implementation for the Hybrid closure with the very small step size. The ORT required nearly 770 seconds, a factor of 31 times greater than that of the Hybrid. Conversely, the FEC required only 26 seconds, a slight increase in effort beyond the Hybrid, which required 25 seconds. This is very striking as the Hybrid closure is often selected in research and industrial codes due to its computational efficiency, while recognizing the sacrifice in computational accuracy. This is no longer the case with the FEC as it has the same accuracy of the orthotropic closures while providing computational speeds nearly identical to that of the Hybrid closure.

In the process of developing the FEC algorithm, it was observed that many redundant operations existed in the implementation of the ORT and the Hybrid closures. For existing implementation of the classical closures, no special consideration was given to the 𝔸:Γ{\mathbb{A}}:\Gamma term, but since the rank four tensor 𝔸{\mathbb{A}} is symmetric, equation  (23) can be used to reduce the number operations of the double contraction to that of a simple rank two tensor operations for both the hybrid closure and the ORT closure implementations. For the ORT, the computational problem can be further simplified by constructing the second-order tensor DA/DtDA/Dt in the principal frame, and then performing the tensor rotation back into the reference frame. Thus the costly rotations of the fourth-order tensor 𝔸{\mathbb{A}} are avoided. These optimized results for the Hybrid and the ORT are shown in Table 2, and it is clear that the computational times were greatly reduced. The optimized Hybrid implementation reduced the computational time to 30% of the original time, whereas the ORT implementation improved by over an order of magnitude. With these additional computational advances the ORT appears to be a more viable alternative to the Hybrid, but the FEC still has similar computational requirements. It is expected that with further studies, the FEC algorithm could be improved to further reduce its computational times.

5 Conclusion

The Fast Exact Closure is a robust, computationally efficient, approach to solve the fiber orientation equations of motion for the orientation tensors. This unique approach does not require any form of curve fitting based on orientation data obtained from numerical solutions of the full fiber orientation distribution. The results presented demonstrate that the FEC is as accurate and robust as the existing industrially accepted closures, while enjoying computational speeds equivalent to the industrial form of the hybrid closure.

6 Acknowledgments

The authors gratefully acknowledge support from the N.S.F. via grant C.M.M.I. 0727399 and Baylor University through their financial support through their faculty member start-up package.

Appendix: Justification and Proofs

By [14], the Exact Closure is this. Given AA, compute the symmetric matrix BB by solving

A=A(B)=120(B+sI)1dsdet(B+sI)A=A(B)=\tfrac{1}{2}\int_{0}^{\infty}\frac{(B+sI)^{-1}\,ds}{\sqrt{\text{det}(B+sI)}} (38)

It was shown in [14] that BB is unique with this property. Then compute 𝔸\mathbb{A} using the formula

𝔸=340s𝒮((B+sI)1(B+sI)1)dsdet(B+sI)\mathbb{A}=\tfrac{3}{4}\int_{0}^{\infty}\frac{s\,\mathcal{S}((B+sI)^{-1}\otimes(B+sI)^{-1})\,ds}{\sqrt{\text{det}(B+sI)}} (39)

Here 𝒮\mathcal{S} represents the symmetrization of a rank 4 tensor, that is, 𝒮(𝔹)ijkl\mathcal{S}(\mathbb{B})_{ijkl} is the average of 𝔹mnpq\mathbb{B}_{mnpq} over all permutations (m,n,p,q)(m,n,p,q) of (i,j,k,l)(i,j,k,l).

It can be shown that the following two statements are equivalent:

  1. 1.

    Equation (38) holds for all time.

  2. 2.

    Equation (38) holds at t=0t=0, and equation (9) holds for all time, where

    =340𝒮((B+sI)1(B+sI)1)dsdet(B+sI)\mathbb{C}=\tfrac{3}{4}\int_{0}^{\infty}\frac{\mathcal{S}((B+sI)^{-1}\otimes(B+sI)^{-1})\,ds}{\sqrt{\text{det}(B+sI)}} (40)

Furthermore, it can be shown for every symmetric matrix MM that

tr(B1M)=2tr(:M)\mathop{\text{tr}}(B^{-1}\cdot M)=2\mathop{\text{tr}}(\mathbb{C}:M) (41)

and hence it can be seen that tr(DA/Dt)=0\mathop{\text{tr}}(DA/Dt)=0 if and only if tr(B1(DB/Dt))=0\mathop{\text{tr}}(B^{-1}\cdot(DB/Dt))=0, that is, trA\mathop{\text{tr}}A stays constant if and only if detB\det B stays constant.

Next, we have

The linear map on symmetric matrices M:MM\mapsto\mathbb{C}:M is invertible (42)

that is, there exists a rank 4 tensor 𝔻\mathbb{D} such that

:𝔻:M=𝔻::M=M for any symmetric matrix M\mathbb{C}:\mathbb{D}:M=\mathbb{D}:\mathbb{C}:M=M\text{ for any symmetric matrix $M$} (43)

Indeed if we define the six by six matrix

𝒞=[111111221133211122111321123221122222233222122221322223331133223333233122331323323212112122221233412124121341223213112132221333413124131341323223112232222333423124231342323]\mathcal{C}=\left[\begin{smallmatrix}\mathbb{C}_{1111}&\mathbb{C}_{1122}&\mathbb{C}_{1133}&2\mathbb{C}_{1112}&2\mathbb{C}_{1113}&2\mathbb{C}_{1123}\\ \mathbb{C}_{2211}&\mathbb{C}_{2222}&\mathbb{C}_{2233}&2\mathbb{C}_{2212}&2\mathbb{C}_{2213}&2\mathbb{C}_{2223}\\ \mathbb{C}_{3311}&\mathbb{C}_{3322}&\mathbb{C}_{3333}&2\mathbb{C}_{3312}&2\mathbb{C}_{3313}&2\mathbb{C}_{3323}\\ 2\mathbb{C}_{1211}&2\mathbb{C}_{1222}&2\mathbb{C}_{1233}&4\mathbb{C}_{1212}&4\mathbb{C}_{1213}&4\mathbb{C}_{1223}\\ 2\mathbb{C}_{1311}&2\mathbb{C}_{1322}&2\mathbb{C}_{1333}&4\mathbb{C}_{1312}&4\mathbb{C}_{1313}&4\mathbb{C}_{1323}\\ 2\mathbb{C}_{2311}&2\mathbb{C}_{2322}&2\mathbb{C}_{2333}&4\mathbb{C}_{2312}&4\mathbb{C}_{2313}&4\mathbb{C}_{2323}\end{smallmatrix}\right] (44)

then 𝔻\mathbb{D} can be calculated using the formula

[𝔻1111𝔻1122𝔻1133𝔻1112𝔻1113𝔻1123𝔻2211𝔻2222𝔻2233𝔻2212𝔻2213𝔻2223𝔻3311𝔻3322𝔻3333𝔻3312𝔻3313𝔻3323𝔻1211𝔻1222𝔻1233𝔻1212𝔻1213𝔻1223𝔻1311𝔻1322𝔻1333𝔻1312𝔻1313𝔻1323𝔻2311𝔻2322𝔻2333𝔻2312𝔻2313𝔻2323]=𝒞1\displaystyle\left[\begin{smallmatrix}\mathbb{D}_{1111}&\mathbb{D}_{1122}&\mathbb{D}_{1133}&\mathbb{D}_{1112}&\mathbb{D}_{1113}&\mathbb{D}_{1123}\\ \mathbb{D}_{2211}&\mathbb{D}_{2222}&\mathbb{D}_{2233}&\mathbb{D}_{2212}&\mathbb{D}_{2213}&\mathbb{D}_{2223}\\ \mathbb{D}_{3311}&\mathbb{D}_{3322}&\mathbb{D}_{3333}&\mathbb{D}_{3312}&\mathbb{D}_{3313}&\mathbb{D}_{3323}\\ \mathbb{D}_{1211}&\mathbb{D}_{1222}&\mathbb{D}_{1233}&\mathbb{D}_{1212}&\mathbb{D}_{1213}&\mathbb{D}_{1223}\\ \mathbb{D}_{1311}&\mathbb{D}_{1322}&\mathbb{D}_{1333}&\mathbb{D}_{1312}&\mathbb{D}_{1313}&\mathbb{D}_{1323}\\ \mathbb{D}_{2311}&\mathbb{D}_{2322}&\mathbb{D}_{2333}&\mathbb{D}_{2312}&\mathbb{D}_{2313}&\mathbb{D}_{2323}\end{smallmatrix}\right]=\mathcal{C}^{-1} (45)
𝔻ijkl=𝔻jikl=𝔻ijlk\displaystyle\mathbb{D}_{ijkl}=\mathbb{D}_{jikl}=\mathbb{D}_{ijlk} (46)

In the basis of orthonormal eigenvectors of BB, since ijkk=0\mathbb{C}_{ijkk}=0 whenever ijki\neq j\neq k, this reduces to equation (20).

Next, if BB is diagonal, then AA is diagonal with entries

a1=120ds(b1+s)3/2b2+sb3+sa2=120dsb1+s(b2+s)3/2b3+sa3=120dsb1+sb2+s(b3+t)3/2\begin{split}a_{1}=\tfrac{1}{2}\int_{0}^{\infty}\frac{ds}{(b_{1}+s)^{3/2}\sqrt{b_{2}+s}\sqrt{b_{3}+s}}\\ a_{2}=\tfrac{1}{2}\int_{0}^{\infty}\frac{ds}{\sqrt{b_{1}+s}(b_{2}+s)^{3/2}\sqrt{b_{3}+s}}\\ a_{3}=\tfrac{1}{2}\int_{0}^{\infty}\frac{ds}{\sqrt{b_{1}+s}\sqrt{b_{2}+s}(b_{3}+t)^{3/2}}\end{split} (47)

and

1111=340ds(b1+s)5/2b2+sb3+s1122=140ds(b1+s)3/2(b2+s)3/2b3+s2222=340dsb1+s(b2+s)5/2b3+s2233=140dsb1+s(b2+s)3/2(b3+s)3/23333=340dsb1+sb2+s(b3+t)5/21133=140ds(b1+s)3/2b2+s(b3+s)3/2\begin{split}\mathbb{C}_{1111}=\tfrac{3}{4}\int_{0}^{\infty}\frac{ds}{(b_{1}+s)^{5/2}\sqrt{b_{2}+s}\sqrt{b_{3}+s}}&\qquad\quad\mathbb{C}_{1122}=\tfrac{1}{4}\int_{0}^{\infty}\frac{ds}{(b_{1}+s)^{3/2}(b_{2}+s)^{3/2}\sqrt{b_{3}+s}}\\ \mathbb{C}_{2222}=\tfrac{3}{4}\int_{0}^{\infty}\frac{ds}{\sqrt{b_{1}+s}(b_{2}+s)^{5/2}\sqrt{b_{3}+s}}&\qquad\quad\mathbb{C}_{2233}=\tfrac{1}{4}\int_{0}^{\infty}\frac{ds}{\sqrt{b_{1}+s}(b_{2}+s)^{3/2}(b_{3}+s)^{3/2}}\\ \mathbb{C}_{3333}=\tfrac{3}{4}\int_{0}^{\infty}\frac{ds}{\sqrt{b_{1}+s}\sqrt{b_{2}+s}(b_{3}+t)^{5/2}}&\qquad\quad\mathbb{C}_{1133}=\tfrac{1}{4}\int_{0}^{\infty}\frac{ds}{(b_{1}+s)^{3/2}\sqrt{b_{2}+s}(b_{3}+s)^{3/2}}\end{split} (48)

all the other coefficients of \mathbb{C} being zero. Furthermore

:I=12B1\mathbb{C}:I=\tfrac{1}{2}B^{-1} (49)

Equations (16) now follow by an easy calculation. Equations (18) and (19) are obtained by expanding the fourth equation of (48) using Taylor’s series, where

n=0ds(b0+s)nb3+s\mathcal{I}_{n}=\int_{0}^{\infty}\frac{ds}{(b_{0}+s)^{n}\sqrt{b_{3}+s}} (50)

The proofs of various details now follow.

Proof of equations (9) and (40): Write A˙\dot{A} and B˙\dot{B} for DADt\frac{DA}{Dt} and DBDt\frac{DB}{Dt} respectively. Use the formulae

DDtB1=B1B˙B1andDDtdetB=tr(B1B˙)detB\frac{D}{Dt}B^{-1}=-B^{-1}\cdot\dot{B}\cdot B^{-1}\quad\text{and}\quad\frac{D}{Dt}\det B=\mathop{\text{tr}}(B^{-1}\cdot\dot{B})\det B (51)

to obtain

A˙=120(B+sI)1B˙(B+sI)1dsdet(B+sI)140[(B+sI)1:B˙](B+sI)1dsdet(B+sI)=:B˙\begin{split}\dot{A}&=-\tfrac{1}{2}\int_{0}^{\infty}\frac{(B+sI)^{-1}\cdot\dot{B}\cdot(B+sI)^{-1}\,ds}{\sqrt{\text{det}(B+sI)}}-\tfrac{1}{4}\int_{0}^{\infty}\frac{[(B+sI)^{-1}:\dot{B}]\,(B+sI)^{-1}\,ds}{\sqrt{\text{det}(B+sI)}}\\ &=-\mathbb{C}:\dot{B}\end{split} (52)

since for any symmetric matrix KK we have

𝒮(KK):B˙=13KB˙K+23(K:B˙)K\mathcal{S}(K\otimes K):\dot{B}=\tfrac{1}{3}K\cdot\dot{B}\cdot K+\tfrac{2}{3}(K:\dot{B})K (53)

Proof of equation (10): For any invertible symmetric matrix KK

𝒮(K1K1):(KM)=𝒮(K1K1):(MTK)=13((trM)K1+MK1+K1MT)\mathcal{S}(K^{-1}K^{-1}):(K\cdot M)=\mathcal{S}(K^{-1}K^{-1}):(M^{T}\cdot K)=\tfrac{1}{3}((\mathop{\text{tr}}M)K^{-1}+M\cdot K^{-1}+K^{-1}\cdot M^{T}) (54)

Setting K=B+sIK=B+sI, we multiply both sides by 3/(4det(B+sI))3/(4\sqrt{\det(B+sI)}), and integrate with respect to ss from zero to infinity, to obtain equation (10).

Proof of equations (17) from (50): To compute 1\mathcal{I}_{1}, use the formulae

ddscos1(b3+sb0+s)=b0b32(b0+s)b3+s\displaystyle\frac{d}{ds}\cos^{-1}\left(\sqrt{\frac{b_{3}+s}{b_{0}+s}}\right)=-\frac{\sqrt{b_{0}-b_{3}}}{2(b_{0}+s)\sqrt{b_{3}+s}} (55)
ddscosh1(b3+sb0+s)=b3b02(b0+s)b3+s\displaystyle\frac{d}{ds}\cosh^{-1}\left(\sqrt{\frac{b_{3}+s}{b_{0}+s}}\right)=-\frac{\sqrt{b_{3}-b_{0}}}{2(b_{0}+s)\sqrt{b_{3}+s}} (56)

Next, integrating by parts, we obtain

n=b32b0n+n20b3+sds(b0+s)n+1\mathcal{I}_{n}=-\frac{\sqrt{b_{3}}}{2b_{0}^{n}}+\frac{n}{2}\int_{0}^{\infty}\frac{\sqrt{b_{3}+s}\,ds}{(b_{0}+s)^{n+1}} (57)

and simple algebra gives

0b3+sds(b0+s)n+1=n+(b3b0)n+1\int_{0}^{\infty}\frac{\sqrt{b_{3}+s}\,ds}{(b_{0}+s)^{n+1}}=\mathcal{I}_{n}+(b_{3}-b_{0})\mathcal{I}_{n+1} (58)

Proof of equation (41): For any positive definite matrix XX, if

A(X)=120(X+sI)1dsdet(X+sI)A(X)=\tfrac{1}{2}\int_{0}^{\infty}\frac{(X+sI)^{-1}\,ds}{\sqrt{\text{det}(X+sI)}} (59)

then

tr(A(X))=120tr((X+sI)1)dsdet(X+sI)=0dds(1det(X+sI))𝑑s=1detX\mathop{\text{tr}}(A(X))=\tfrac{1}{2}\int_{0}^{\infty}\frac{\mathop{\text{tr}}((X+sI)^{-1})\,ds}{\sqrt{\text{det}(X+sI)}}=-\int_{0}^{\infty}\frac{d}{ds}\left(\frac{1}{\sqrt{\text{det}(X+sI)}}\right)\,ds=\frac{1}{\sqrt{\det X}} (60)

If tr(B1M)=α\mathop{\text{tr}}(B^{-1}\cdot M)=\alpha, then (remembering that detB=1\det B=1) we have det(B+ϵM)=1+ϵα+O(ϵ2)\det(B+\epsilon M)=1+\epsilon\alpha+O(\epsilon^{2}) as ϵ0\epsilon\to 0. Hence 112ϵα+O(ϵ2)=tr(A(B+ϵM))=1ϵtr(:M)+O(ϵ2)1-\tfrac{1}{2}\epsilon\alpha+O(\epsilon^{2})=\mathop{\text{tr}}(A(B+\epsilon M))=1-\epsilon\mathop{\text{tr}}(\mathbb{C}:M)+O(\epsilon^{2}). Therefore tr(:M)=12α\mathop{\text{tr}}(\mathbb{C}:M)=\tfrac{1}{2}\alpha.

Proof of equation (42): This follows because

M is a symmetric non-zero matrixM::M>0\text{$M$ is a symmetric non-zero matrix}\Rightarrow M:\mathbb{C}:M>0 (61)

and hence M0:M0M\neq 0\Rightarrow\mathbb{C}:M\neq 0.

To see this, suppose that KK is a positive definite three by three matrix, and let k1k_{1}, k2k_{2} and k3k_{3} be its eigenvalues. Then in the basis of corresponding orthonormal eigenvalues of KK, we have that for any non-zero symmetric MM

M:𝒮(KK):M=13(i=13kiMii)2+23i,j=13kikjMij2>0M:\mathcal{S}(K\otimes K):M=\tfrac{1}{3}\left(\sum_{i=1}^{3}k_{i}M_{ii}\right)^{2}+\tfrac{2}{3}\sum_{i,j=1}^{3}k_{i}k_{j}M_{ij}^{2}>0 (62)

Apply this to K=(B+sI)1K=(B+sI)^{-1}, multiply by (det(B+sI))1/2(\det(B+sI))^{-1/2}, and then integrate over ss to obtain M::M>0M:\mathbb{C}:M>0.

Proof of equation (49): Without loss of generality BB is diagonal. Hence we need to prove statements such as 1111+1122+1133=12b11\mathbb{C}_{1111}+\mathbb{C}_{1122}+\mathbb{C}_{1133}=\tfrac{1}{2}b_{1}^{-1} when \mathbb{C} satisfies equation (48). But

1111+1122+1133=120dds(1(b1+s)3/2b2+sb3+s)𝑑s=12b13/2b21/2b31/2\begin{split}\mathbb{C}_{1111}+\mathbb{C}_{1122}+\mathbb{C}_{1133}&=-\tfrac{1}{2}\int_{0}^{\infty}\frac{d}{ds}\left(\frac{1}{(b_{1}+s)^{3/2}\sqrt{b_{2}+s}\sqrt{b_{3}+s}}\right)\,ds\\ &=\tfrac{1}{2}b_{1}^{-3/2}b_{2}^{-1/2}b_{3}^{-1/2}\end{split} (63)

The result follows since b1b2b3=1b_{1}b_{2}b_{3}=1.

Proof of equation (28): From equation (9), we see that the RSC version of equation (27) is equation (28) and

DBDt=G(A,B)(1κ)𝔻:𝕄:F(A,B)\frac{DB}{Dt}=G(A,B)-(1-\kappa)\mathbb{D}:\mathbb{M}:F(A,B) (64)

Since 𝔻:F(A,B)=G(A,B)\mathbb{D}:F(A,B)=G(A,B), it follows that all we need to show is 𝔻:𝕄:F(A,B)=𝕄:𝔻:F(A,B)\mathbb{D}:\mathbb{M}:F(A,B)=\mathbb{M}:\mathbb{D}:F(A,B). This is easily seen by working in the basis of orthonormal eigenvectors of BB, noticing that then 𝕄:N\mathbb{M}:N is simply the diagonal part of NN, and applying equation (23).

Proof of Theorem 1: It follows from detB=1\det B=1 that the only way that the solutions can become non-physical is if BB ‘blows up,’ that is, if one or more of the eigenvalues of BB become infinite in finite time. (Also, [37, Theorem 1.4] can be used to show that the finiteness of the eigenvalues of BB imply the differential equations have a unique solution.)

Substituting M=IM=I into equation (10), we obtain :B=32A\mathbb{C}:B=\tfrac{3}{2}A, that is,

𝔻:A=23B\mathbb{D}:A=\tfrac{2}{3}B (65)

Take the trace of equation (13) and use equation (65), to obtain

DDttrBc(Ω+Γ+Dr)(trB)2Dr(I:𝔻:I)\frac{D}{Dt}\mathop{\text{tr}}B\leq c(\|\Omega\|+\|\Gamma\|+D_{r})(\mathop{\text{tr}}B)-2D_{r}(I:\mathbb{D}:I) (66)

for some universal constant c>0c>0. Here \|\cdot\| denotes the spectral norm of a matrix, and we have used the inequality tr(XY)XtrY\mathop{\text{tr}}(X\cdot Y)\leq\|X\|\mathop{\text{tr}}Y whenever YY is positive definite. By equation (61), we have I:𝔻:I=M::M0I:\mathbb{D}:I=M:\mathbb{C}:M\geq 0, where M=𝔻:IM=\mathbb{D}:I, and hence

DDttrBc(Ω+Γ+Dr)(trB)\frac{D}{Dt}\mathop{\text{tr}}B\leq c(\|\Omega\|+\|\Gamma\|+D_{r})(\mathop{\text{tr}}B) (67)

Now we can apply Gronwall’s inequality [37, Chapter 2.1.1] (in Lagrangian coordinates) to obtain

trB(trB0)ectL\mathop{\text{tr}}B\leq(\mathop{\text{tr}}B_{0})e^{ctL} (68)

where LL is an upper bound for Ω+Γ+Dr\|\Omega\|+\|\Gamma\|+D_{r}, and B0B_{0} is the value of BB at t=0t=0. Therefore trB\mathop{\text{tr}}B remains finite, and since BB is positive definite, no eigenvalue of BB blows up to infinity in finite time.

Proof of Theorem 2: Note that the positive definiteness of DrD_{r}, and the boundedness of DrD_{r} and 1/Dr11/\|D_{r}^{-1}\| guarantee that the ratio of trB\mathop{\text{tr}}B and Dr:BD_{r}:B is bounded from above and below. From equation (15), and using equation (65)

DDt(Dr:B)c(Ω+Γ+Dr+D(Dr)Dt)(Dr:B)2(Dr:𝔻:Dr)\frac{D}{Dt}(D_{r}:B)\leq{}c\left(\|\Omega\|+\|\Gamma\|+\|D_{r}\|+\left\|\frac{D(D_{r})}{Dt}\right\|\right)(D_{r}:B)-2(D_{r}:\mathbb{D}:D_{r}) (69)

The rest of the proof proceeds by a similar argument as above.

7 References

References

  • [1] VerWeyst, B.E., C. Tucker, P. Foss, J. O’Gara, Fiber Orientation in 3-D Injection Molded Features: Prediction and Experiment, International Polymer Processing 14 (1999) 409–420.
  • [2] Fan, X., N. Phan-Thien, R. Zheng, A Direct Simulation of Fibre Suspensions, Jn. of Non-Newtonian Fluid Mechanics 74 (1998) 113–135.
  • [3] Folgar, F.P., C. Tucker, Orientation Behavior of Fibers in Concentrated Suspensions, Jn. of Reinforced Plastics and Composites 3 (1984) 98–119.
  • [4] Advani, S.G., C. Tucker, The Use of Tensors to Describe and Predict Fiber Orientation in Short Fiber Composites, Jn. of Rheology 31 (8) (1987) 751–784.
  • [5] Jack, D.A., D. Smith, The Effect of Fiber Orientation Closure Approximations on Mechanical Property Predictions, Composites, Part A 38 (2007) 975–982.
  • [6] Cintra, J. S., C. Tucker, Orthotropic Closure Approximations for Flow-Induced Fiber Orientation, Jn. of Rheology 39 (6) (1995) 1095–1122.
  • [7] Tucker, C.L., J. Wang, J. O’Gara, G. DeBarr, Improved Fiber Orientation Predictions for Injection Molded Composites, in: NSF/DOE/APC Workshop: The Future of Modeling in Composites Molding Processes, Washington, D.C., 2004.
  • [8] Wang, J., J. O’Gara, C. Tucker, An Objective Model for Slow Orientation Kinetics in Concentrated Fiber Suspensions: Theory and Rheological Evidence, Journal of Rheology 52 (5) (2008) 1179–1200.
  • [9] Phelps, J.H., C. Tucker, An Anisotropic Rotary Diffusion Model for Fiber Orienation in Short- and LongFiber Thermoplastics, Journal of Non-Newtonian Fluid Mechanics 156 (2009) 165–176.
  • [10] Koch, D.L., A Model for Orientational Diffusion in Fiber Suspensions, Physics of Fluids 7 (8) (1995) 2086–2088.
  • [11] Jack, D.A., S. Montgomery-Smith, D. Smith, Anisotropic Diffusion Model for Suspensions of Short-Fiber Composite Processes., in: The XVth International Congress on Rheology, the Society of Rheology 80th Annual Meeting, The Society of Rheology, Monterey, CA, 2008.
  • [12] Wetzel, E.D., Modeling Flow-Induced Microstructure of Inhomogeneous Liquid-Liquid Mixtures, Ph.D. thesis, University of Illinois at Urbana Champaign (1999).
  • [13] VerWeyst, B.E., Numerical Predictions of Flow Induced Fiber Orientation in Three-Dimensional Geometries, Ph.D. thesis, University of Illinois at Urbana Champaign (1998).
  • [14] Montgomery-Smith, S.J. W. He, D.A. Jack, D.E. Smith, Exact Tensor Closures for the Three Dimensional Jeffery’s Equation, Under Review Journal of Fluid Mechanics, draft available at http://www.math.missouri.edu/~stephen/preprints/exact-closure.html (2010).
  • [15] Jeffery, G.B., The Motion of Ellipsoidal Particles Immersed in a Viscous Fluid, Proceedings of the Royal Society of London A 102 (1923) 161–179.
  • [16] Bird, R. B., C. Curtiss, R. C. Armstrong, O. Hassager, Dynamics of Polymeric Liquids, 2nd Edition, Vol. 2: Kinetic Theory, John Wiley & Sons, Inc., New York, NY, 1987.
  • [17] Petrie, C.J.S., The Rheology of Fibre Suspensions, Journal of Non-Newtonian Fluid Mechanics 87 (1999) 369–402.
  • [18] Hinch, E.J., L. Leal, Time-Dependent Shear Flows of a Suspension of Particles with Weak Brownian Rotations, Journal of Fluid Mechanics 57 (1973) 753–767.
  • [19] Altan, M.C., S. Advani, S. Güçeri, R. Pipes, On the Description of the Orientation State for Fiber Suspensions in Homogeneous Flows, Jn. of Rheology 33 (7) (1989) 1129–1155.
  • [20] Altan, M.C., S. Subbiah, S. Guceri, R. Pipes, Numerical Prediction of Three-Dimensional Fiber Orientation in Hele-Shaw Flows, Polymer Engineering and Science 30 (14) (1990) 848–859.
  • [21] Verleye, V., F. Dupret, Prediction of Fiber Orientation in Complex Injection Molded Parts, in: Developments in Non-Newtonian Flows, 1993, pp. 139–163.
  • [22] Chung, D.H., T. Kwon, Invariant-Based Optimal Fitting Closure Approximation for the Numerical Prediction of Flow-Induced Fiber Orientation, Jn. of Rheology 46 (1) (2002) 169–194.
  • [23] Han, K.-H., Y.-T. Im, Numerical Simulation of Three-Dimensional Fiber Orientation in Short-Fiber-Reinforced Injection-Molded Parts, Jn. of Materials Processing Technology 124 (2002) 366–371.
  • [24] Jack, D.A., D. Smith, An Invariant Based Fitted Closure of the Sixth-order Orientation Tensor for Modeling Short-Fiber Suspensions, Jn. of Rheology 49 (5) (2005) 1091–1116.
  • [25] Bay, R.S., Fiber Orientation in Injection Molded Composites: A Comparison of Theory and Experiment, Ph.D. thesis, University of Illinois at Urbana-Champaign (August 1991).
  • [26] Dinh, S.M., R. Armstrong, A Rheological Equation of State for Semiconcentrated Fiber Suspensions, Jn. of Rheology 28 (3) (1984) 207–227.
  • [27] Lipscomb, G G II., M. Denn, D. Hur, D. Boger, Flow of Fiber Suspensions in Complex Geometries, Jn. of Non-Newtonian Fluid Mechanics 26 (1988) 297–325.
  • [28] Altan, M.C., L. Tang, Orientation tensors in simple flows of dilute suspensions of non-brownian rigid ellipsoids, comparison of analytical and approximate solutions, Rheologica Acta 32 (1993) 227–244.
  • [29] Montgomery-Smith, S.J., D. Jack, D. Smith, A Systematic Approach to Obtaining Numerical Solutions of Jeffery’s Type Equations using Spherical Harmonics, Composites Part A 41 (2010) 827–835.
  • [30] D. Jack, B. Schache, D. Smith, Neural Network Based Closure for Modeling Short-Fiber Suspensions, Polymer CompositesAccepted for Publication.
  • [31] Chung, D.H., T. Kwon, Improved Model of Orthotropic Closure Approximation for Flow Induced Fiber Orientation, Polymer Composites 22 (5) (2001) 636–649.
  • [32] Qadir, N., D. Jack, Modeling Fibre Orientation in Short Fibre Suspensions Using the Neural Network-Based Orthotropic Closure, Composites, Part A.
  • [33] Mullens, M., Developing New Fitted Closure Approximations for Short-Fiber Reinforced Polymer Composites, Master’s thesis, University of Missouri - Columbia (July 2010).
  • [34] Jack, D.A., D. Smith, Assessing the Use of Tensor Closure Methods With Orientation Distribution Reconstruction Functions, Jn. of Composite Materials 38 (21) (2004) 1851–1872.
  • [35] GNU Scientific Library, http://www.gnu.org/software/gsl.
  • [36] Jack D.A., D. Smith, Elastic Properties of Short-Fiber Polymer Composites, Derivation and Demonstration of Analytical Forms for Expectation and Variance from Orientation Tensors, Journal of Composite Materials 42 (3) (2008) 277–308.
  • [37] Chicone, C., Ordinary Differential Equations with Applications, 2nd Edition, Springer-Verlag, New York, 2006.
Flow # v1v_{1} v2v_{2} v3v_{3} CIC_{I} λ\lambda ε¯FEC\overline{\varepsilon}_{\mbox{\tiny FEC}} ε¯ORT\overline{\varepsilon}_{\mbox{\tiny ORT}} ε¯IBOF\overline{\varepsilon}_{\mbox{\tiny IBOF}} ε¯Hybrid\overline{\varepsilon}_{\mbox{\tiny Hybrid}}
1 Gx1Gx_{1} Gx2Gx_{2} 2Gx3-2Gx_{3} 10310^{-3} 1 1 2.06 1.28 76.2
2 2Gx12Gx_{1} Gx2-Gx_{2} Gx3-Gx_{3} 10310^{-3} 1 1.03 1.05 1 25.8
3a Gx3Gx_{3} 0 0 10310^{-3} 0.99 1 1.02 1.02 3.69
3b Gx3Gx_{3} 0 0 10310^{-3} 1 1 1.02 1.01 3.28
4 Gx1+10Gx2-Gx_{1}+10Gx_{2} Gx2-Gx_{2} 2Gx32Gx_{3} 10310^{-3} 1 1 2.25 1.36 12.9
5 Gx1+Gx2-Gx_{1}+Gx_{2} Gx2-Gx_{2} 2Gx32Gx_{3} 10310^{-3} 1 1.02 1 1.23 22.6
6 Gx1+2Gx3Gx_{1}+2Gx_{3} Gx2Gx_{2} 2Gx3-2Gx_{3} 10210^{-2} 1 1 1.01 1.08 3.57
7 Gx1+2.75Gx3Gx_{1}+2.75Gx_{3} Gx2Gx_{2} 2Gx3-2Gx_{3} 10210^{-2} 1 1 1.02 1.05 2.98
8 Gx1+1.25Gx3Gx_{1}+1.25Gx_{3} Gx2Gx_{2} 2Gx3-2Gx_{3} 10210^{-2} 1 1.02 1 1.12 3.85
9 Gx1+10Gx3-Gx_{1}+10Gx_{3} Gx2Gx_{2} 0 10210^{-2} 1 1.03 1 1.03 1.65
10 Gx1+Gx3-Gx_{1}+Gx_{3} Gx2Gx_{2} 0 10210^{-2} 1 1.01 1 1.04 2.29
11 2Gx1+3Gx32Gx_{1}+3Gx_{3} Gx2-Gx_{2} Gx3-Gx_{3} 10210^{-2} 1 1.04 1.04 1 2.52
12 Gx1+3.75Gx2-Gx_{1}+3.75Gx_{2} Gx2Gx_{2} 2Gx32Gx_{3} 10210^{-2} 1 1 1.03 1.06 2.03
13 Gx1+1.5Gx2-Gx_{1}+1.5Gx_{2} Gx2-Gx_{2} 2Gx32Gx_{3} 10210^{-2} 1 1.00 1 1.01 2.34
14a Gx3Gx_{3} 0 0 10210^{-2} 0.99 1 1.00 1.03 4.14
14b Gx3Gx_{3} 0 0 10210^{-2} 1 1 1.00 1.02 3.90
Table 1: Flows used, and the resulting error computation in computing the second-order orientation tensor AA.
Closure CPU Time Normalized Time
Hybrid - Original 25 1
Hybrid - Optimized 6.9 0.3
ORT - Original 770 31
ORT - Optimized 21 0.8
FEC 26 1.0
Table 2: Normalized Computational Times
Refer to caption
Figure 1: Transient Solution for selected components of AA for simple shear flow under isotropic diffusion (a) CI=103C_{I}=10^{-3} and λ=0.99\lambda=0.99 and (b) CI=102C_{I}=10^{-2} and λ=0.95\lambda=0.95.
Refer to caption
Figure 2: Transient Solution for selected components of AA for simple shear flow under anisotropic rotary diffusion (ARD-RSC) (a) κ=1/30\kappa=1/30 and λ=0.95\lambda=0.95 and (b) κ=1/30\kappa=1/30 and λ=1.0\lambda=1.0.
Refer to caption
Figure 3: Anisotropic rotary diffusion results, simple shear κ=1/30\kappa=1/30 and λ=1.0\lambda=1.0 (a) Selected time range of for A11A_{11} (b) Transient error in derivative computation for the fitted orthotropic closure ORT compared to FEC.
Refer to caption
Figure 4: Transient solution for selected components of AA for mixed flow from the Folgar-Tucker model with CI=102C_{I}=10^{-2} and λ=1.0\lambda=1.0.
Refer to caption
Figure 5: Transient solution for selected components of AA for center-gated disk flow from the Folgar-Tucker model with CI=102C_{I}=10^{-2} and λ=1.0\lambda=1.0 for r/b=4/10r/b=4/10.