Abstract
The radiative–conductive transfer equation in the \(S_N\) approximation for spherical geometry is solved using a modified decomposition method. The focus of this work is to show how to distribute the source terms in the recursive equation system in order to guarantee arithmetic stability and thus numerical convergence of the obtained solution, guided by a condition number criterion. Some examples are compared with results from literature and parameter combinations are analyzed, for which the condition number analysis indicates convergence of the solutions obtained by the recursive scheme.
Similar content being viewed by others
References
Ladeia CA, Bodmann BEJ, Vilhena MT (2018) The radiative conductive transfer equation in cylinder geometry: semi-analytical solution and a point analysis of convergence. J Quant Spectrosc Radiat Transf 217:338–352
Siewert CE, Thomas JR Jr (1991) On coupled conductive-radiative heat transfer problems in a sphere. J Quant Spectrosc Radiat Transf 46:63–72
Chandrasekhar S (1950) Radiative transfer. Oxford University Press, New York
Vilhena MTB, Bodmann BEJ, Segatto CF (2011) Non-linear radiative-conductive heat transfer in a heterogeneous gray plane-parallel participating medium. In: Ahasan A (ed) Convection and conduction heat transfer. InTech, pp 177–196
Elghazaly A (2009) Conductive-radiative heat transfer in a scattering medium with angle-dependent reflective boundaries. J Nucl Radiat Phys 4:31–41
Ozisik MN (1973) Radiative transfer and interaction with conductions and convection. Wiley, New York
Segatto CF, Vilhena MT, Brancher JD (1999) The one-dimensional ltsn formulation for high degree of anisotropy. J Quant Spectrosc Radiat Transf 61:39–43
Brancher JD, Vilhena MT, Segatto CF (1999) The ltsn solution for radiative transfer problem without azimutal symmetry with severe anisotropy. J Quant Spectrosc Radiat Transf 62:43–53
Ladeia CA, Bodmann BEJ, Vilhena MT (2017) On the radiative conductive transfer equation: a heuristic convergence criterion by stability analysis. Integr Methods Sci Eng 1:173–182
Trefethen LN, Bau D (1997) Numerical linear algebra. SIAM, Philadelphia
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
To obtain the maximum norm of \(\mathbf{J}\), we use the \(S_8\) approximation. Note that the discrete directions and the weights satisfy \(|\mu _i|=\mu _{N+1-i}\) , \(\varpi _i = \varpi _{N+1-i}\), for \(i \in [1,4]\), respectively. Furthermore, we consider isotropic scattering (\(\mathfrak {L} = 0\)). The weights obey the following relations \(\varpi _1 < \varpi _j\) with \(j \in [1,3]\):
Then, the maximum norm of matrix \(\mathbf{J}\), with dominant block \(\mathcal {J}\), is
otherwise, the contribution of Z in the recursive scheme should be analyzed together with the diagonal blocks behaviors. In the following, we illustrate the Jacobian matrix of order \(N^{2}\mathcal {J}^{2} \times N^{2}\mathcal {J}^{2}\).
Some of the blocks of matrices are null matrices, \(\mathbf {0} = \mathbf{J}_{01}= \mathbf{J}_{0(Z-1)}=\mathbf{J}_{1(Z-1)}=\mathbf{J}_{0Z}=\mathbf{J}_{1Z}=\mathbf{J}_{(Z-1)Z}=\mathbf{J}_{0(Z+1)}= \mathbf{J}_{1(Z+1)} = \mathbf{J}_{(Z-1)(Z+1)}= \mathbf{J}_{Z(Z+1)}= \mathbf{J}_{0(\mathcal {J}-1)}= \mathbf{J}_{1(\mathcal {J}-1)}=J_{(Z-1)(\mathcal {J}-1)}=\mathbf{J}_{Z(\mathcal {J}-1)}=\mathbf{J}_{(Z+1)(\mathcal {J}-1)}= \mathbf{J}_{0\mathcal {J}}=\mathbf{J}_{1\mathcal {J}}=\mathbf{J}_{(Z-1)\mathcal {J}}=\mathbf{J}_{Z\mathcal {J}}=\mathbf{J}_{(Z+1)\mathcal {J}}=\mathbf{J}_{(\mathcal {J}-1)\mathcal {J}}\), so that the Jacobian matrix for this problem is a lower triangular matrix.
The diagonal block matrices are generically given by
Another set of block matrices are equal, \(\mathbf{J}_{(\mathcal {J}-1)0}= \mathbf{J}_{(\mathcal {J}-1)1}=\cdots = \mathbf{J}_{(\mathcal {J}-1)(Z-1)}= \mathbf{J}_{(\mathcal {J}-1)Z}=\mathbf{J}_{(\mathcal {J}-1)(Z+1)}\), and \(\mathbf{J}_{\mathcal {J}0} = \mathbf{J}_{\mathcal {J}1}= \ldots = \mathbf{J}_{\mathcal {J}(Z-1)}= \mathbf{J}_{\mathcal {J}Z}= \mathbf{J}_{\mathcal {J}(Z+1)}\), with
For \(j \in [1, k-1]\)
Rights and permissions
About this article
Cite this article
Ladeia, C.A., Bodmann, B.E.J. & Vilhena, M.T. Radiative–conductive transfer equation in spherical geometry: arithmetic stability for decomposition using the condition number criterion. J Eng Math 123, 149–163 (2020). https://doi.org/10.1007/s10665-020-10059-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10665-020-10059-2