SearcharxivSearch

arXiv subjects

Te Ba

Publications and source records attributed to Te Ba.

6 recordsLinked to original sources

NeuralFVM: Neural-physics-based Finite Volume Method for Turbulent Flows Using the $k$-$\omega$ Model

In this work, we develop a neural-physics solver based on finite volume method (FVM), namely NeuralFVM, for turbulent flows by implementing the standard $k$-$\omega$ model designed for efficient Graphics Processing Unit (GPU) execution. The governing equations for fluid flow and heat transfer are reformulated as local tensor operations using convolution-based stencil operators, which enables compatibility with deep learning libraries while preserving the conservative properties of the FVM. A key challenge in implementing the turbulent model within such a framework is the treatment of the stiff destruction terms in the $k$ and $\omega$ transport equations. To address this issue, an operator-splitting strategy is introduced in which the stiff destruction terms are handled semi-implicitly while the remaining terms are advanced explicitly. This formulation avoids global matrix assembly and allows the entire solver to be implemented using local tensor operations. In addition, the pressure-velocity coupling is solved using a convolution-based geometric multigrid algorithm embedded within a neural network architecture. The resulting NeuralFVM solver is validated through comparison with simulations conducted using the commercial CFD software ANSYS Fluent for several channel-flow configurations and an indoor airflow scenario. The results demonstrate close agreement in velocity, temperature, and turbulence quantities, confirming the accuracy of the proposed approach. The developed GPU framework achieves a speedup of around 19-46 times compared with its Central Processing Unit (CPU) counterpart under different meshes. Moreover, the proposed solver naturally integrates with machine learning workflows, providing a promising foundation for future data-driven turbulence modeling and optimization.

physics.flu-dyn

A gradient descent algorithm for computing circle patterns

This paper presents a new algorithm for generating planar circle patterns. The algorithm employs gradient descent and conjugate gradient method to compute circle radii and centers separately. Compared with existing algorithms, the proposed method is more efficient in computing centers of circles and is applicable for realizing circle patterns with possible obtuse overlap angles.

cs.CG

Morse theory and moduli spaces of self-avoiding polygonal linkages

We show that a smooth $d$-manifold $M$ is diffeomorphic to $\mathbb R^d$ if it admits a Lyapunov-Reeb function, i.e., a smooth map $f:M\to\mathbb R$ that is proper, lower-bounded, and has a unique critical point. By constructing such functions, we prove that the moduli spaces of self-avoiding polygonal linkages and configurations are diffeomorphic to Euclidean spaces. This resolves the Refined Carpenter's Rule Problem and confirms a conjecture proposed by Gonz\'{a}lez and Sedano-Mendoza. Furthermore, we describe foliation structures of these moduli spaces via level sets of Lyapunov-Reeb functions and develop algorithms for related problems.

math.CO

Combinatorial curvature flows for generalized hyperbolic circle packings

Generalized circle packings were introduced in \cite{Ba-Hu-Sun} as a generalization of tangential circle packings in hyperbolic background geometry. In this paper, we introduce the combinatorial Calabi flow, fractional combinatorial Calabi flow and combinatorial $p$-th Calabi flow for generalized hyperbolic circle packings. We establish several equivalent conditions regarding the longtime behaviors of these flows. This provides effective algorithms for finding the generalized circle packings with prescribed total geodesic curvatures.

math.DG

Circle packings and hyperbolic surfaces of finite type

This paper constructs hyperbolic polyhedral metrics via circle packings. We introduce the curvature of circles as a parameter to include all three types of constant curvature curves in the hyperbolic geometry. This provides a unified approach to producing polyhedral metrics for surfaces of broader topological types. The combinatorial total geodesic curvature serves as an effective tool for establishing the existence and uniqueness of the packing.

math.GT

Rigidity of bordered polyhedral surfaces

This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary, we reprove the classical result that two Euclidean cyclic polygons (or hyperbolic cyclic polygons) are congruent if the lengths of their sides are equal.

math.GT