arXiv subjects

Jizu Huang

Publications and source records attributed to Jizu Huang.

At least 19 recordsLinked to original sources

arXiv2026

A two-dimensional structural local-defect theory for scalar non-divergence advection-diffusion homogenization

We develop a two-dimensional structural local-defect theory for scalar non-divergence advection--diffusion operators $Lu=-a:D^2u+b\cdot\nabla u$, where $a=a^{\mathrm{per}}+a^e$ and $b=b^{\mathrm{per}}+b^e$. The periodic coefficients and the bounded local defects are uniformly H\"older continuous, the interpolating matrices $a_t=a^{\mathrm{per}}+t a^e$ are symmetric and uniformly elliptic, and $a^e\in L^r(\mathbb{R}^2)$, $b^e\in L^s(\mathbb{R}^2)$, where $1 0$, the defects $B^e$ and $A^e:=ma-B-(m^{\mathrm{per}}a^{\mathrm{per}}-B^{\mathrm{per}})$ belong to $L^{M^*}\cap L^\infty\cap C_{\mathrm{unif}}^{0,\beta}$ and vanish uniformly at infinity. This supplies the missing two-dimensional structural reduction in the scalar regular non-endpoint regime.

math.AP↗

arXiv2026

PI-DOSnet: A Physics-Informed Deep Operator-Splitting Network for Evolution Partial Differential Equations

Evolution partial differential equations (PDEs) describe time-dependent physical systems governed by differential laws and arise widely across science and engineering. In recent years, operator learning has emerged as a powerful and efficient paradigm for solving evolution PDEs by learning mappings between infinite-dimensional function spaces, enabling solution prediction without explicit time-step integration. In this work, we propose PI-DOSnet, a physics-informed operator learning framework built upon DOSnet and operator splitting. Unlike purely data-driven operator learning methods, PI-DOSnet incorporates physical constraints during training, allowing it to operate even in the absence of paired input-output data. Once trained, PI-DOSnet performs long-time inference of PDE solutions through an iterative strategy. We analyze the linear stability and approximation error of PI-DOSnet and demonstrate its accuracy, efficiency, and robustness through multiple numerical experiments. Moreover, for the Allen--Cahn equation, PI-DOSnet achieves energy stable solutions even with a large time-step size.

math.NA↗

arXiv2026

Low Stage and High Order Explicit Runge--Kutta Methods via $Q$- and $D$-Conditions: Several Construction Details

This note provides additional details on the construction of the $Q$/$D$-space framework for sufficient order conditions of explicit Runge--Kutta (ERK) methods. Specifically, it presents a general version of the sufficiency theorem, several examples illustrating the verification of the sufficient conditions, a detailed construction of an ERK scheme of order $p=10$, the assembly of the associated linear systems, a complexity analysis of the construction algorithm, and tables of coefficients for the constructed ERK methods.

math.NA↗

arXiv2026

Frequency-adaptive tensor neural networks for high-dimensional multi-scale problems

Tensor neural networks (TNNs) have demonstrated their superiority in solving high-dimensional problems. However, similar to conventional neural networks, TNNs are also influenced by the Frequency Principle, which limits their ability to accurately capture high-frequency features of the solution. In this work, we analyze the training dynamics of TNNs by Fourier analysis and enhance their expressivity for high-dimensional multi-scale problems by incorporating random Fourier features. Leveraging the inherent tensor structure of TNNs, we further propose a novel approach to extract frequency features of high-dimensional functions by performing the Discrete Fourier Transform to one-dimensional component functions. This strategy effectively mitigates the curse of dimensionality. Building on this idea, we propose a frequency-adaptive TNNs algorithm, which significantly improves the ability of TNNs in solving complex multi-scale problems. Extensive numerical experiments are performed to validate the effectiveness and robustness of the proposed frequency-adaptive TNNs algorithm.

cs.LG↗

arXiv2026

Derivation of Runge--Kutta Order Conditions via Functional Tree Tensor Networks

Tree tensor networks (TTNs) provide a compact and structured representation of high-dimensional data, making them valuable in various areas of computational mathematics and physics. In this paper, we present a rigorous mathematical framework for expressing high-order derivatives of functional TTNs, both with or without constraints. Our framework decomposes the total derivative of a given TTN into a summation of TTNs, each corresponding to the partial derivatives of the original TTN. Using this decomposition, we derive the Taylor expansion of vector-valued functions subject to ordinary differential equation constraints or algebraic constraints imposed by Runge--Kutta (RK) methods. As a concrete application, we employ this framework to construct order conditions for RK methods. Due to the intrinsic tensor properties of partial derivatives and the separable tensor structure in RK methods, the Taylor expansion of numerical solutions can be obtained in a manner analogous to that of exact solutions using tensor operators. This enables the order conditions of RK methods to be established by directly comparing the Taylor expansions of the exact and numerical solutions, eliminating the need for mathematical induction. For a given function $\vector{f}$, we derive sharper order conditions that go beyond the classical ones, enabling the identification of situations where a standard RK scheme of order $p$ achieves unexpectedly higher convergence order for the particular function. These results establish new connections between tensor network theory and classical numerical methods, potentially opening new avenues for both analytical exploration and practical computation.

math.NA↗

arXiv2025

HaTT: Hadamard avoiding TT recompression

The Hadamard product of tensor train (TT) tensors is a fundamental nonlinear operation in scientific computing and data analysis. However, due to its tendency to significantly increase TT ranks, the Hadamard product poses a major computational challenge in TT tensor-based algorithms. To address this, it is crucial to develop recompression algorithms that mitigate the effects of this rank increase. Existing recompression algorithms require an explicit representation of the Hadamard product, resulting in high computational and storage costs. In this work, we propose a Hadamard avoiding TT recompression (HaTT) algorithm, which reduces both computational complexity and storage requirements. By leveraging the structure of the Hadamard product in TT tensors and exploiting its Hadamard product-free property, the HaTT algorithm achieves significantly lower complexity compared to existing TT recompression methods. This is confirmed through both complexity analysis and numerical experiments. Furthermore, the HaTT algorithm is applied to solve the Allen--Cahn equation, achieving substantial speedup over existing TT recompression algorithms without sacrificing accuracy.

math.NA↗

arXiv2025

Deep learning for the semi-classical limit of the Schrödinger equation

In this paper, we integrate neural networks and Gaussian wave packets to numerically solve the Schrödinger equation with a smooth potential near the semi-classical limit. Our focus is not only on accurately obtaining solutions when the non-dimensional Planck's constant, $\varepsilon$, is small, but also on constructing an operator that maps initial values to solutions for the Schrödinger equation with multiscale properties. Using Gaussian wave packets framework, we first reformulate the Schrödinger equation as a system of ordinary differential equations. For a single initial condition, we solve the resulting system using PINNs or MscaleDNNs. Numerical simulations indicate that MscaleDNNs outperform PINNs, improving accuracy by one to two orders of magnitude. When dealing with a set of initial conditions, we adopt an operator-learning approach, such as physics-informed DeepONets. Numerical examples validate the effectiveness of physics-informed DeepONets with Gaussian wave packets in accurately mapping initial conditions to solutions.

physics.comp-ph↗

arXiv2025

Random batch list method for metallic system with embedded atom potential

The embedded atom method (EAM) is one of the most widely used many-body, short-range potentials in molecular dynamics simulations, particularly for metallic systems. To enhance the efficiency of calculating these short-range interactions, we extend the random batch list (RBL) concept to the EAM potential, resulting in the RBL-EAM algorithm. The newly presented method introduces two "core-shell" lists for approximately computing the host electron densities and the force terms, respectively. Direct interactions are computed in the core regions, while in the shell zones a random batch list is used to reduce the number of interaction pairs, leading to significant reductions in both computational complexity and storage requirements. We provide a theoretical, unbiased estimate of the host electron densities and the force terms. Since metallic systems are Newton-pair systems, we extend the RBL-EAM algorithm to exploit this property, thereby halving the computational cost. Numerical examples, including the lattice constant, the radial distribution function, and the elastic constants, demonstrate that the RBL-EAM method significantly accelerates simulations several times without compromising accuracy.

cond-mat.mtrl-sci↗

arXiv2024

Frequency-adaptive Multi-scale Deep Neural Networks

Multi-scale deep neural networks (MscaleDNNs) with downing-scaling mapping have demonstrated superiority over traditional DNNs in approximating target functions characterized by high frequency features. However, the performance of MscaleDNNs heavily depends on the parameters in the downing-scaling mapping, which limits their broader application. In this work, we establish a fitting error bound to explain why MscaleDNNs are advantageous for approximating high frequency functions. Building on this insight, we construct a hybrid feature embedding to enhance the accuracy and robustness of the downing-scaling mapping. To reduce the dependency of MscaleDNNs on parameters in the downing-scaling mapping, we propose frequency-adaptive MscaleDNNs, which adaptively adjust these parameters based on a posterior error estimate that captures the frequency information of the fitted functions. Numerical examples, including wave propagation and the propagation of a localized solution of the schr$\ddot{\text{o}}$dinger equation with a smooth potential near the semi-classical limit, are presented. These examples demonstrate that the frequency-adaptive MscaleDNNs improve accuracy by two to three orders of magnitude compared to standard MscaleDNNs.

cs.LG↗

arXiv2024

CPAFT: A Consistent Parallel Advancing Front Technique for Unstructured Triangular/Tetrahedral Mesh Generation

Compared with the remarkable progress made in parallel numerical solvers of partial differential equations,the development of algorithms for generating unstructured triangular/tetrahedral meshes has been relatively sluggish. In this paper, we propose a novel, consistent parallel advancing front technique (CPAFT) by combining the advancing front technique, the domain decomposition method based on space-filling curves, the distributed forest-of-overlapping-trees approach, and the consistent parallel maximal independent set algorithm. The newly proposed CPAFT algorithm can mathematically ensure that the generated unstructured triangular/tetrahedral meshes are independent of the number of processors and the implementation of domain decomposition. Several numerical tests are conducted to validate the parallel consistency and outstanding parallel efficiency of the proposed algorithm, which scales effectively up to two thousand processors. This is, as far as we know, the first parallel unstructured triangular/tetrahedral mesh generator with scalability to O(1,000) CPU processors.

math.NA↗

arXiv2024

APTT: An accuracy-preserved tensor-train method for the Boltzmann-BGK equation

Solving the Boltzmann-BGK equation with traditional numerical methods suffers from high computational and memory costs due to the curse of dimensionality. In this paper, we propose a novel accuracy-preserved tensor-train (APTT) method to efficiently solve the Boltzmann-BGK equation. A second-order finite difference scheme is applied to discretize the Boltzmann-BGK equation, resulting in a tensor algebraic system at each time step. Based on the low-rank TT representation, the tensor algebraic system is then approximated as a TT-based low-rank system, which is efficiently solved using the TT-modified alternating least-squares (TT-MALS) solver. Thanks to the low-rank TT representation, the APTT method can significantly reduce the computational and memory costs compared to traditional numerical methods. Theoretical analysis demonstrates that the APTT method maintains the same convergence rate as that of the finite difference scheme. The convergence rate and efficiency of the APTT method are validated by several benchmark test cases.

math.NA↗

arXiv2024

An efficient multiscale multigrid preconditioner for Darcy flow in high-contrast media

In this paper, we develop a multigrid preconditioner to solve Darcy flow in highly heterogeneous porous media. The key component of the preconditioner is to construct a sequence of nested subspaces $W_{\mathcal{L}}\subset W_{\mathcal{L}-1}\subset\cdots\subset W_1=W_h$. An appropriate spectral problem is defined in the space of $W_{i-1}$, then the eigenfunctions of the spectral problems are utilized to form $W_i$. The preconditioner is applied to solve a positive semidefinite linear system which results from discretizing the Darcy flow equation with the lowest order Raviart-Thomas spaces and adopting a trapezoidal quadrature rule. Theoretical analysis and numerical investigations of this preconditioner will be presented. In particular, we will consider several typical highly heterogeneous permeability fields whose resolutions are up to $1024^3$ and examine the computational performance of the preconditioner in several aspects, such as strong scalability, weak scalability, and robustness against the contrast of the media. We also demonstrate an application of this preconditioner for solving a two-phase flow benchmark problem.

math.NA↗

arXiv2024

A robust two-level overlapping preconditioner for Darcy flow in high-contrast media

In this article, a two-level overlapping domain decomposition preconditioner is developed for solving linear algebraic systems obtained from simulating Darcy flow in high-contrast media. Our preconditioner starts at a mixed finite element method for discretizing the partial differential equation by Darcy's law with the no-flux boundary condition and is then followed by a velocity elimination technique to yield a linear algebraic system with only unknowns of pressure. Then, our main objective is to design a robust and efficient domain decomposition preconditioner for this system, which is accomplished by engineering a multiscale coarse space that is capable of characterizing high-contrast features of the permeability field. A generalized eigenvalue problem is solved in each non-overlapping coarse element in a communication-free manner to form the global solver, which is accompanied by local solvers originated from additive Schwarz methods but with a non-Galerkin discretization to derive the two-level preconditioner. We provide a rigorous analysis that indicates that the condition number of the preconditioned system could be bounded above with several assumptions. Extensive numerical experiments with various types of three-dimensional high-contrast models are exhibited. In particular, we study the robustness against the contrast of the media as well as the influences of numbers of eigenfunctions, oversampling sizes, and subdomain partitions on the efficiency of the proposed preconditioner. Besides, strong and weak scalability performances are also examined.

math.NA↗

arXiv2022

Energy stable schemes for gradient flows based on the DVD method

The existing discrete variational derivative method is only second-order accurate and fully implicit. In this paper, we propose a framework to construct an arbitrary high-order implicit (original) energy stable scheme and a second-order semi-implicit (modified) energy stable scheme. Combined with the Runge--Kutta process, we can build an arbitrary high-order and unconditionally (original) energy stable scheme based on the discrete variational derivative method. The new energy stable scheme is implicit and leads to a large sparse nonlinear algebraic system at each time step, which can be efficiently solved by using an inexact Newton type algorithm. To avoid solving nonlinear algebraic systems, we then present a relaxed discrete variational derivative method, which can construct second-order, linear, and unconditionally (modified) energy stable schemes. Several numerical simulations are performed to investigate the efficiency, stability, and accuracy of the newly proposed schemes.

math.NA↗

arXiv2022

Parallel energy stable phase field simulations of Ni-based alloys system

In this paper, we investigate numerical methods for solving Nickel-based phase field system related to free energy, including the elastic energy and logarithmic type functionals. To address the challenge posed by the particular free energy functional, we propose a semi-implicit scheme based on the discrete variational derivative method, which is unconditionally energy stable and maintains the energy dissipation law and the mass conservation law. Due to the good stability of the semi-implicit scheme, the adaptive time step strategy is adopted, which can flexibly control the time step according to the dynamic evolution of the problem. A domain decomposition based, parallel Newton--Krylov--Schwarz method is introduced to solve the nonlinear algebraic system constructed by the discretization at each time step. Numerical experiments show that the proposed algorithm is energy stable with large time steps, and highly scalable to six thousand processor cores.

math.NA↗

arXiv2022

An efficient multi-modes Monte Carlo homogenization method for random materials

In this paper, we propose and analyze a new stochastic homogenization method for diffusion equations with random and fast oscillatory coefficients. In the proposed method, the homogenized solutions are sought through a two-stage procedure. In the first stage, the original oscillatory diffusion equation is approximated, for each fixed random sample w, by a spatially homogenized diffusion equation with piecewise constant coefficients, resulting a random diffusion equation. In the second stage, the resulted random diffusion equation is approximated and computed by using an efficient multi-modes Monte Carlo method which only requires to solve a diffusion equation with a constant diffusion coefficient and a random right-hand side. The main advantage of the proposed method is that it separates the computational difficulty caused by the spatial fast oscillation of the solution and that caused by the randomness of the solution, so they can be overcome separately using different strategies. The convergence of the solution of the spatially homogenized equation (from the first stage) to the solution of the original random diffusion equation is established and the optimal rate of convergence is also obtained for the proposed multi-modes Monte Carlo method. Numerical experiments on some benchmark test problems for random composite materials are also presented to gauge the efficiency and accuracy of the proposed two-stage stochastic homogenization method.

math.NA↗

arXiv2020

Parallel energy-stable solver for a coupled Allen-Cahn and Cahn-Hilliard system

In this paper, we study numerical methods for solving the coupled Allen-Cahn/Cahn-Hilliard system associated with a free energy functional of logarithmic type. To tackle the challenge posed by the special free energy functional, we propose a method to approximate the discrete variational derivatives in polynomial forms, such that the corresponding finite difference scheme is unconditionally energy stable and the energy dissipation law is maintained. To further improve the performance of the algorithm, a modified adaptive time stepping strategy is adopted such that the time step size can be flexibly controlled based on the dynamical evolution of the problem. To achieve high performance on parallel computers, we introduce a domain decomposition based, parallel Newton-Krylov-Schwarz method to solve the nonlinear algebraic system constructed from the discretization at each time step. Numerical experiments show that the proposed algorithm is second-order accurate in both space and time, energy stable with large time steps, and highly scalable to over ten thousands processor cores on the Sunway TaihuLight supercomputer.

math.NA↗

arXiv2017

High order fast algorithm for the Caputo fractional derivative

In the paper, we present a high order fast algorithm with almost optimum memory for the Caputo fractional derivative, which can be expressed as a convolution of $u'(t)$ with the kernel $(t_n-t)^{-α}$. In the fast algorithm, the interval $[0,t_{n-1}]$ is split into nonuniform subintervals. The number of the subintervals is in the order of $\log n$ at the $n$-th time step. The fractional kernel function is approximated by a polynomial function of $K$-th degree with a uniform absolute error on each subinterval. We save $K+1$ integrals on each subinterval, which can be written as a convolution of $u'(t)$ with a polynomial base function. As compared with the direct method, the proposed fast algorithm reduces the storage requirement and computational cost from $O(n)$ to $O((K+1)\log n)$ at the $n$-th time step. We prove that the convergence rate of the fast algorithm is the same as the direct method even a high order direct method is considered. The convergence rate and efficiency of the fast algorithm are illustrated via several numerical examples.

math.NA↗