Search arXivSearch

arXiv · 2607.06231

Steady-State and Transient Heat Conduction Analysis Using a Polygonal Cell-Based Smoothed Finite Element Method

Abstract

This paper presents a polygonal cell-based smoothed finite element method (CS-FEM) for two-dimensional steady-state and transient heat-conduction analysis. In the proposed formulation, Wachspress shape functions are employed to construct the temperature approximation over general polygonal elements, and the smoothed temperature gradient is evaluated through boundary integration over cell-based smoothing domains. The resulting formulation is implemented in ABAQUS through the user-defined element (UEL) interface, enabling heat-conduction analysis using polygonal meshes within a commercial finite element environment. Several numerical examples, including a linear patch test, steady-state benchmark problems, and transient heat-conduction problems with different boundary conditions, are investigated to verify the accuracy, convergence behavior, and robustness of the proposed method. The numerical results show good agreement with analytical or reference solutions. Compared with conventional FEM using triangular and quadrilateral elements, the proposed polygonal CS-FEM exhibits favorable accuracy and convergence performance, while providing greater flexibility in mesh generation for complex geometries. The proposed framework therefore offers an accurate and robust numerical approach for steady-state and transient heat-conduction analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miao Zhang, Yang Yang, Chao Su, Yijia Dong, Mingjiao Yan. 2026-07-03. Steady-State and Transient Heat Conduction Analysis Using a Polygonal Cell-Based Smoothed Finite Element Method. https://arxiv.org/abs/2607.06231

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT