Zhicheng Hu

Zhicheng Hu, Zhenning Cai, Yanli Wang

We propose a Hermite spectral method for the spatially inhomogeneous Boltzmann equation. For the inverse-power-law model, we generalize an approximate quadratic collision operator defined in the normalized and dimensionless setting to an operator for arbitrary distribution functions. An efficient algorithm with a fast transform is introduced to discretize this new collision operator. The method is tested for one-dimensional benchmark microflow problems.

Zhicheng Hu, Guanghan Li, Chunwu Wang et al.

A high-order Newton multigrid method is proposed for steady-state shallow water flows in open channels with regular and irregular geometries. The method integrates a finite volume discretization with third-order weighted essentially non-oscillatory (WENO) reconstruction and a Newton multigrid framework with an efficient approximation of the Jacobian matrix for solving the resulting discrete system. In high-order schemes, the computational cost of Jacobian construction becomes dominant due to the wide stencil. Meanwhile, only a small fraction of the non-zero Jacobian entries exhibit large magnitudes. Based on this observation, a simplified Jacobian approximation is introduced using reduced stencils, in which selected off-stencil contributions are neglected, thereby achieving a substantial reduction in computational cost. The proposed approach is verified numerically to show significant efficiency improvement while maintaining comparable convergence behavior to that obtained with the full Jacobian approach. To further enhance performance, a geometric multigrid method incorporating a successive over-relaxation iteration as the smoother is applied to solve the linear systems arising in each Newton step. A variety of numerical experiments, including a one-dimensional smooth subcritical flow, flows over a hump, and a two-dimensional hydraulic jump over a wedge, are carried out to illustrate the third-order accuracy, efficiency, and robustness of the proposed method.

Zhicheng Hu, Keiwei Liang

This paper studies the numerical solution of traveling singular sources problems. In such problems, a big challenge is the sources move with different speeds, which are described by some ordinary differential equations. A predictor-corrector algorithm is presented to simulate the position of singular sources. Then a moving mesh method in conjunction with domain decomposition is derived for the underlying PDE. According to the positions of the sources, the whole domain is splitted into several subdomains, where moving mesh equations are solved respectively. On the resulting mesh, the computation of jump $[\dot{u}]$ is avoided and the discretization of the underlying PDE is reduced into only two cases. In addition, the new method has a desired second-order of the spatial convergence. Numerical examples are presented to illustrate the convergence rates and the efficiency of the method. Blow-up phenomenon is also investigated for various motions of the sources.

Yaohua Tang, Zhicheng Hu, Kun Cheng et al.

The increasing context window size in large language models (LLMs) has improved their ability to handle complex, long-text tasks. However, as the conversation rounds continue, it is required to store a large amount of KV cache in GPU memory, which significantly affects the efficiency and even availability of the model serving systems. This paper analyzes dialogue data from real users on the granularity of round and discovers that the LLM inference manifests a watershed layer, after which the distribution of round-level attention shows notable similarity. Based on this, we propose Round Attention - a novel round-level attention mechanism that selectively processes the KV cache of top-k relevant rounds, where k is dynamically determined through the attention matrix in the watershed layer. Theoretical analysis demonstrates that our method reduces memory usage by 54\% to 82\%, while experimental results confirm that loading sparse critical-round KV cache maintains answer accuracy without performance degradation.