SearcharxivSearch

arXiv subjects

Zhicheng Hu

Publications and source records attributed to Zhicheng Hu.

17 recordsLinked to original sources

HiLNO: A Hierarchical Latent Neural Operator with Multi-Scale Supervision for PDEs on General Geometries

Latent neural operators improve the efficiency of operator learning for partial differential equations (PDEs) by performing the main computation on compact latent representations. However, directly compressing the input representation to obtain such compact representations may discard solution-relevant spatial information, especially for PDE solutions with multiscale structures. To address this problem, we propose HiLNO, a hierarchical latent neural operator that constructs a fine-to-coarse-to-fine latent space and further introduces multi-scale supervision (MSS) and anisotropic Gaussian attention. The hierarchy mitigates potential information loss during compression, while MSS aligns intermediate predictions with downsampled target fields, encouraging solution-relevant structures to be captured across multiple spatial scales. Anisotropic Gaussian attention enables feature transfer across the hierarchy, making HiLNO applicable to general geometries. Experiments on representative PDE benchmarks and a large-scale automotive aerodynamics task show that HiLNO achieves competitive predictive accuracy, while reducing the parameter count by an average of 84.4% and FLOPs by an average of 69.2% compared with LinearNO. Additional experiments demonstrate effective generalization to unseen spatial resolutions. Code is available at https://github.com/JcLimath/HiLNO.

math.NA

A high-order Newton multigrid method with a simplified Jacobian for steady-state shallow water equations

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.

math.NA

A multi-mesh adaptive finite element method for solving the Gross-Pitaevskii equation

It is found that the wave functions of the Gross-Pitaevskii equation (GPE) often vary significantly in different spatial regions, with some components exhibiting sharp variations while others remain smooth. Solving the GPE on a single mesh, even with adaptive refinement, can lead to excessive computational costs due to the need to accommodate the most oscillatory solution. To address this issue, we present a multi-mesh adaptive finite element method for solving the GPE. To this end, we first convert it into a time-dependent equation through the imaginary time propagation method. Then the equation is discretized by the backward Euler method temporally and the multi-mesh adaptive finite element method spatially. The proposed method is compared with the single-mesh adaptive method through a series of numerical experiments, which demonstrate that the multi-mesh adaptive method can achieve the same numerical accuracy with less computational consumption.

math.NA

A novel fast iterative moment method for near-continuum flows

We develop a novel fast iterative moment method for the steady-state simulation of near-continuum flows, which are modeled by the high-order moment system derived from the Boltzmann-BGK equation. The fast convergence of the present method is mainly achieved by alternately solving the moment system and the hydrodynamic equations with consistent constitutive relations and boundary conditions. To be specific, the consistent hydrodynamic equations are solved in each alternating iteration to obtain improved predictions of macroscopic quantities, which are subsequently utilized to expedite the evolution of the moment system. Additionally, a semi-implicit scheme treating the collision term implicitly is introduced for the moment system. The resulting alternating iteration can be further accelerated by employing the Gauss-Seidel method with a cell-by-cell sweeping strategy. It is also noteworthy that such an alternating iteration works well with the nonlinear multigrid method. Numerical experiments for planar Couette flow, shock structure, and lid-driven cavity flow are carried out to investigate the performance of the proposed fast iterative moment method. All results show impressive efficiency and robustness.

math.NA

Round Attention: A Novel Round-Level Attention Mechanism to Accelerate LLM Inference

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.

cs.CL

Trinity: A General Purpose FHE Accelerator

In this paper, we present the first multi-modal FHE accelerator based on a unified architecture, which efficiently supports CKKS, TFHE, and their conversion scheme within a single accelerator. To achieve this goal, we first analyze the theoretical foundations of the aforementioned schemes and highlight their composition from a finite number of arithmetic kernels. Then, we investigate the challenges for efficiently supporting these kernels within a unified architecture, which include 1) concurrent support for NTT and FFT, 2) maintaining high hardware utilization across various polynomial lengths, and 3) ensuring consistent performance across diverse arithmetic kernels. To tackle these challenges, we propose a novel FHE accelerator named Trinity, which incorporates algorithm optimizations, hardware component reuse, and dynamic workload scheduling to enhance the acceleration of CKKS, TFHE, and their conversion scheme. By adaptive select the proper allocation of components for NTT and MAC, Trinity maintains high utilization across NTTs with various polynomial lengths and imbalanced arithmetic workloads. The experiment results show that, for the pure CKKS and TFHE workloads, the performance of our Trinity outperforms the state-of-the-art accelerator for CKKS (SHARP) and TFHE (Morphling) by 1.49x and 4.23x, respectively. Moreover, Trinity achieves 919.3x performance improvement for the FHE-conversion scheme over the CPU-based implementation. Notably, despite the performance improvement, the hardware overhead of Trinity is only 85% of the summed circuit areas of SHARP and Morphling.

cs.AR

Taiyi: A high-performance CKKS accelerator for Practical Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE), a novel cryptographic theory enabling computation directly on ciphertext data, offers significant security benefits but is hampered by substantial performance overhead. In recent years, a series of accelerator designs have significantly enhanced the performance of FHE applications, bringing them closer to real-world applicability. However, these accelerators face challenges related to large on-chip memory and area. Additionally, FHE algorithms undergo rapid development, rendering the previous accelerator designs less perfectly adapted to the evolving landscape of optimized FHE applications. In this paper, we conducted a detailed analysis of existing applications with the new FHE method, making two key observations: 1) the bottleneck of FHE applications shifts from NTT to the inner-product operation, and 2) the optimal α of KeySwitch changes with the decrease in multiplicative level. Based on these observations, we designed an accelerator named Taiyi, which includes specific hardware for the inner-product operation and optimizes the NTT and BConv operations through algorithmic derivation. A comparative evaluation of Taiyi against previous state-of-the-art designs reveals an average performance improvement of 1.5x and reduces the area overhead by 15.7%.

cs.CR

Thermal analysis of dual-phase-lag model in a two-dimensional plate subjected to a heat source moving along elliptical trajectories

In this paper, we focus on the study of heat transfer behavior for the dual-phase-lag heat conduction model, which describes the evolution of temperature in a two-dimensional rectangular plate caused by the activity of a point heat source moving along elliptical trajectories. At first, Green's function approach is applied to derive the analytical solution of temperature for the given model. Based on the series representation of this analytical solution, the thermal responses for the underlying heat transfer problem, including the relations between the moving heat source and the concomitant temperature peak, the influences of the pair of phase lags and the angular velocity of heat source on temperature, are then investigated, analyzed and discussed in detail for three different movement trajectories. Compared with the results revealed for the common situation that the heat source moves in a straight line with a constant speed, the present results show quite distinctive thermal behaviors for all cases, which subsequently can help us to better understand the internal mechanism of the dual-phase-lag heat transfer subjected to a moving heat source with curved trajectory.

math.AP

Dual-phase-lag heat conduction analysis of a three-dimensional finite medium heated by a moving laser beam with circular or annular cross-section

We analyze the non-Fourier dual-phase-lag heat conduction process in a three-dimensional medium heated by a moving circular or annular laser beam, which is modeled by a set of point heat sources in the cross-section. In order to solve the model, Green's function approach is first used to obtain an analytical solution for the temperature distribution over the medium subjected to a single point heat source. Then the temperature distribution on the medium subjected to the laser beam can be obtained by the superposition method. According to this solution, the dependence between the heat conduction process and the cross-section of the heat source is investigated. Based on the comparison of the temperature distribution of the medium under Fourier's law and non-Fourier's law, the effect of the phase lag parameter is revealed. In addition, the effects of laser spot size and laser moving speed on the temperature distribution are also analyzed. The discovered properties provide theoretical support for the application of moving laser heat sources in various fields under the dual-phase-lag model.

physics.class-ph

An efficient nonlinear multigrid solver for the simulation of rarefied gas cavity flow

We study efficient simulation of steady state for rarefied gas flow, which is modeled by the Boltzmann equation with BGK-type collision term. A nonlinear multigrid solver is proposed to resolve the efficiency issue by the following approaches. The unified framework of numerical regularized moment method is first adopted to derive the high-quality discretization of the underlying problem. A fast sweeping iteration is introduced to solve the derived discrete problem more efficiently than the usual time-integration scheme on a single level grid. Taking it as the smoother, the nonlinear multigrid solver is then established to significantly improve the convergence rate. The OpenMP-based parallelization is applied in the implementation to further accelerate the computation. Numerical experiments for two lid-driven cavity flows and a bottom-heated cavity flow are carried out to investigate the performance of the resulting nonlinear multigrid solver. All results show the efficiency and robustness of the solver for both first- and second-order spatial discretization.

math.NA

Flows Between Parallel Plates: Analytical Solutions of Regularized 13-Moment Equations for Inverse-Power-Law Models

We study the structure of stationary channel flows predicted by the regularized 13-moment equations. Compared with the previous work [P. Taheri et al., Phys. Fluids, 21 (2009), 017102], we focus on gases whose molecules satisfy the general inverse power law. The analytical solutions are obtained for the semi-linear equations, and the structures of Couette, Fourier, and Poiseuille flows are solved by coupling the general solutions with newly derived boundary conditions. The results show excellent agreement with the reference solution in the slip-flow regime. Our results also show that the R13 equations derived from inverse power law models can have better accuracy than the R13 equations of Maxwell molecules with altered viscosity.

physics.flu-dyn

Burnett Spectral Method for High-Speed Rarefied Gas Flows

We introduce a numerical solver for the spatially inhomogeneous Boltzmann equation using the Burnett spectral method. The modelling and discretization of the collision operator are based on the previous work [Z. Cai, Y. Fan, and Y. Wang, Burnett spectral method for the spatially homogeneous Boltzmann equation, arXiv:1810.07804], which is the hybridization of the BGK operator for higher moments and the quadratic collision operator for lower moments. To ensure the preservation of the equilibrium state, we introduce an additional term to the discrete collision operator, which equals zero when the number of degrees of freedom tends to infinity. Compared with the previous work [Z. Hu, Z. Cai, and Y. Wang,Numerical simulation of microflows using Hermite spectral methods, arXiv:1807.06236], the computational cost is reduced by one order. Numerical experiments such as shock structure calculation and Fourier flows are carried out to show the efficiency and accuracy of our numerical method.

physics.comp-ph

Numerical Simulation of Microflows using Hermite Spectral Methods

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.

math.SP

An Efficient Steady-State Solver for Microflows with High-Order Moment Model

In [Z. Hu, R. Li, and Z. Qiao. Acceleration for microflow simulations of high-order moment models by using lower-order model correction. J. Comput. Phys., 327:225-244, 2016], it has been successfully demonstrated that using lower-order moment model correction is a promising idea to accelerate the steady-state computation of high-order moment models of the Boltzmann equation. To develop the existing solver, the following aspects are studied in this paper. First, the finite volume method with linear reconstruction is employed for high-resolution spatial discretization so that the degrees of freedom in spatial space could be reduced remarkably without loss of accuracy. Second, by introducing an appropriate parameter $τ$ in the correction step, it is found that the performance of the solver can be improved significantly, i.e., more levels would be involved in the solver, which further accelerates the convergence of the method. Third, Heun's method is employed as the smoother in each level to enhance the robustness of the solver. Numerical experiments in microflows are carried out to demonstrate the efficiency and to investigate the behavior of the new solver. In addition, several order reduction strategies for the choice of the order sequence of the solver are tested, and the strategy $m_{l-1} = \lceil m_{l} / 2 \rceil$ is found to be most efficient.

math.NA

Acceleration for Microflow Simulations of High-Order Moment Models by Using Lower-Order Model Correction

We study the acceleration of steady-state computation for microflow, which is modeled by the high-order moment models derived recently from the steady-state Boltzmann equation with BGK-type collision term. By using the lower-order model correction, a novel nonlinear multi-level moment solver is developed. Numerical examples verify that the resulting solver improves the convergence significantly thus is able to accelerate the steady-state computation greatly. The behavior of the solver is also numerically investigated. It is shown that the convergence rate increases, indicating the solver would be more efficient, as the total levels increases. Three order reduction strategies of the solver are considered. Numerical results show that the most efficient order reduction strategy would be $m_{l-1} = \lceil m_{l} / 2 \rceil$.

math.NA

A Nonlinear Multigrid Steady-State Solver for Microflow

We develop a nonlinear multigrid method to solve the steady state of microflow, which is modeled by the high order moment system derived recently for the steady-state Boltzmann equation with ES-BGK collision term. The solver adopts a symmetric Gauss-Seidel iterative scheme nested by a local Newton iteration on grid cell level as its smoother. Numerical examples show that the solver is insensitive to the parameters in the implementation thus is quite robust. It is demonstrated that expected efficiency improvement is achieved by the proposed method in comparison with the direct time-stepping scheme.

math.NA

Numerical investigations of traveling singular sources problems via moving mesh method

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.

math.NA