Asymptotic expansion for convection-dominated transport in a thin graph-like junction

ANALYSIS AND APPLICATIONS(2024)

引用 0|浏览0
暂无评分
摘要
We consider for a small parameter epsilon > 0 a parabolic convection-diffusion problem with Peclet number of order O(epsilon(-1)) in a three-dimensional graph-like junction consisting of thin curvilinear cylinders with radii of order O(epsilon) connected through a domain (node) of diameter O(epsilon). Inhomogeneous Robin type boundary conditions, that involve convective and diffusive fluxes, are prescribed both on the lateral surfaces of the thin cylinders and the boundary of the node. The asymptotic behavior of the solution is studied as epsilon -> 0, i.e. when the diffusion coefficients are eliminated and the thin junction is shrunk into a three-part graph connected in a single vertex. A rigorous procedure for the construction of the complete asymptotic expansion of the solution is developed and the corresponding energy and uniform pointwise estimates are proved. Depending on the directions of the limit convective fluxes, the corresponding limit problems (epsilon = 0) are derived in the form of first-order hyperbolic differential equations on the one-dimensional branches with novel gluing conditions at the vertex. These generalize the classical Kirchhoff transmission conditions and might require the solution of a three-dimensional cell-like problem associated with the vertex to account for the local geometric inhomogeneity of the node and the physical processes in the node. The asymptotic ansatz consists of three parts, namely, the regular part, node-layer part, and boundary-layer one. Their coefficients are classical solutions to mixed-dimensional limit problems. The existence and other properties of those solutions are analyzed.
更多
查看译文
关键词
Convection-diffusion problem,asymptotic expansion,thin graph-like junction,metric graph,hyperbolic equations of the first order
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要