Searcharxiv⌕ Search

arXiv subjects

Xiaochuan Tian

Publications and source records attributed to Xiaochuan Tian.

At least 19 recordsLinked to original sources

A Robust Model-Based Approach for Continuous-Time Policy Evaluation with Unknown Lévy Process Dynamics

This paper develops a model-based framework for continuous-time policy evaluation (CTPE) in reinforcement learning, incorporating both Brownian and Lévy noise to model stochastic dynamics influenced by rare and extreme events. Our approach formulates the policy evaluation problem as solving a partial integro-differential equation (PIDE) for the value function with unknown coefficients. A key challenge in this setting is accurately recovering the unknown coefficients in the stochastic dynamics, particularly when driven by Lévy processes with heavy tail effects. To address this, we propose a robust numerical approach that effectively handles both unbiased and censored trajectory datasets. This method combines maximum likelihood estimation with an iterative tail correction mechanism, improving the stability and accuracy of coefficient recovery. Additionally, we establish a theoretical bound for the policy evaluation error based on coefficient recovery error. Through numerical experiments, including a real-data BTC price experiment, we demonstrate the effectiveness and robustness of our method in recovering heavy-tailed Lévy dynamics and verify the theoretical error analysis in policy evaluation.

math.NA↗

A Fast and Accurate Solver for the Fractional Fokker-Planck Equation with Dirac-Delta Initial Conditions

The classical Fokker-Planck equation (FPE) is a key tool in physics for describing systems influenced by drag forces and Gaussian noise, with applications spanning multiple fields. We consider the fractional Fokker-Planck equation (FFPE), which models the time evolution of probability densities for systems driven by Lévy processes, relevant in scenarios where Gaussian assumptions fail. The paper presents an efficient and accurate numerical approach for the free-space FFPE with constant coefficients and Dirac-delta initial conditions. This method utilizes the integral representation of the solutions and enables the efficient handling of very high-dimensional problems using fast algorithms. Our work is the first to present a high-precision numerical solver for the free-space FFPE with Dirac-delta initial conditions. In addition to Dirac-delta initial data, we demonstrate the effectiveness of our method for initial conditions given by sums of Gaussians. This opens the door for future research on more complex scenarios, including those with variable coefficients and other types of initial conditions.

math.NA↗

Solving Nonlinear PDEs with Sparse Radial Basis Function Networks

We propose a novel framework for solving nonlinear PDEs using sparse radial basis function (RBF) networks. Sparsity-promoting regularization is employed to prevent over-parameterization and reduce redundant features. This work is motivated by longstanding challenges in traditional RBF collocation methods, along with the limitations of physics-informed neural networks (PINNs) and Gaussian process (GP) approaches, aiming to blend their respective strengths in a unified framework. The theoretical foundation of our approach lies in the function space of Reproducing Kernel Banach Spaces (RKBS) induced by one-hidden-layer neural networks of possibly infinite width. We prove a representer theorem showing that the sparse optimization problem in the RKBS admits a finite solution and establishes error bounds that offer a foundation for generalizing classical numerical analysis. The algorithmic framework is based on a three-phase algorithm to maintain computational efficiency through adaptive feature selection, second-order optimization, and pruning of inactive neurons. Numerical experiments demonstrate the effectiveness of our method and highlight cases where it offers notable advantages over GP approaches. This work opens new directions for adaptive PDE solvers grounded in rigorous analysis with efficient, learning-inspired implementation.

math.NA↗

Sparse RBF Networks for PDEs and nonlocal equations: function space theory, operator calculus, and training algorithms

This work presents a systematic analysis and extension of the sparse radial basis function network (SparseRBFnet) previously introduced for solving nonlinear partial differential equations (PDEs). Based on its adaptive-width shallow kernel network formulation, we further investigate its function-space characterization, operator evaluation, and computational algorithm. We provide a unified description of the solution space for a broad class of radial basis functions (RBFs). Under mild assumptions, this space admits a characterization as a Besov space, independent of the specific kernel choice. We further demonstrate how the explicit kernel-based structure enables quasi-analytical evaluation of both differential and nonlocal operators, including fractional Laplacians. On the computational end, we study the adaptive-width network and related three-phase training strategy through a comparison with variants concerning the modeling and algorithmic details. In particular, we assess the roles of second-order optimization, inner-weight training, network adaptivity, and anisotropic kernel parameterizations. Numerical experiments on high-order, fractional, and anisotropic PDE benchmarks illustrate the empirical insensitivity to kernel choice, as well as the resulting trade-offs between accuracy, sparsity, and computational cost. Collectively, these results consolidate and generalize the theoretical and computational framework of SparseRBFnet, supporting accurate sparse representations with efficient operator evaluation and offering theory-grounded guidance for algorithmic and modeling choices.

math.NA↗

On parameterized nonlocal-fractional transmission problems and associated function spaces

In this paper, we consider a family of seamlessly coupled nonlocal models associated with transmission conditions across an interface. The models are derived from the variation of a parameterized family of energies consisting of a fractional type Dirichlet energy on one subdomain and a nonlocal Dirichlet energy involving a finite range of interactions on another subdomain. We present the rigorous mathematical formulation and its well-posedness. We also investigate the behavior of the model in various limiting regimes.

math.AP↗

Monotone Peridynamic Neural Operator for Nonlinear Material Modeling with Conditionally Unique Solutions

Data-driven methods have emerged as powerful tools for modeling the responses of complex nonlinear materials directly from experimental measurements. Among these methods, the data-driven constitutive models present advantages in physical interpretability and generalizability across different boundary conditions/domain settings. However, the well-posedness of these learned models is generally not guaranteed a priori, which makes the models prone to non-physical solutions in downstream simulation tasks. In this study, we introduce monotone peridynamic neural operator (MPNO), a novel data-driven nonlocal constitutive model learning approach based on neural operators. Our approach learns a nonlocal kernel together with a nonlinear constitutive relation, while ensuring solution uniqueness through a monotone gradient network. This architectural constraint on gradient induces convexity of the learnt energy density function, thereby guaranteeing solution uniqueness of MPNO in small deformation regimes. To validate our approach, we evaluate MPNO's performance on both synthetic and real-world datasets. On synthetic datasets with manufactured kernel and constitutive relation, we show that the learnt model converges to the ground-truth as the measurement grid size decreases both theoretically and numerically. Additionally, our MPNO exhibits superior generalization capabilities than the conventional neural networks: it yields smaller displacement solution errors in down-stream tasks with new and unseen loadings. Finally, we showcase the practical utility of our approach through applications in learning a homogenized model from molecular dynamics data, highlighting its expressivity and robustness in real-world scenarios.

cs.LG↗

A neural network kernel decomposition for learning multiple steady states in parameterized dynamical systems

We develop a data-driven machine learning approach to identifying parameters with steady-state solutions, locating such solutions, and determining their linear stability for systems of ordinary differential equations and dynamical systems with parameters. Our approach first constructs target functions for these tasks, then designs a parameter-solution neural network (PSNN) that couples a parameter neural network and a solution neural network to approximate the target functions. We further develop efficient algorithms to train the PSNN and locate steady-state solutions. An approximation theory for the target functions with PSNN is developed based on kernel decomposition. Numerical results are reported to show that our approach is robust in finding solutions, identifying phase boundaries, and classifying solution stability across parameter regions. These numerical results also validate our analysis. While this study focuses on steady states of parameterized dynamical systems, our approach is equation-free and is applicable generally to finding solutions for parameterized nonlinear systems of algebraic equations. Some potential improvements and future work are discussed.

math.NA↗

Compactness results for a Dirichlet energy of nonlocal gradient with applications

We prove two compactness results for function spaces with finite Dirichlet energy of half-space nonlocal gradients. In each of these results, we provide sufficient conditions on a sequence of kernel functions that guarantee the asymptotic compact embedding of the associated nonlocal function spaces into the class of square-integrable functions. Moreover, we will demonstrate that the sequence of nonlocal function spaces converges in an appropriate sense to a limiting function space. As an application, we prove uniform Poincaré-type inequalities for sequence of half-space gradient operators. We also apply the compactness result to demonstrate the convergence of appropriately parameterized nonlocal heterogeneous anisotropic diffusion problems. We will construct asymptotically compatible schemes for these type of problems. Another application concerns the convergence and robust discretization of a nonlocal optimal control problem.

math.AP↗

Numerical analysis of a class of penalty discontinuous Galerkin methods for nonlocal diffusion problems

In this paper, we consider a class of discontinuous Galerkin (DG) methods for one-dimensional nonlocal diffusion (ND) problems. The nonlocal models, which are integral equations, are widely used in describing many physical phenomena with long-range interactions. The ND problem is the nonlocal analog of the classic diffusion problem, and as the interaction radius (horizon) vanishes, then the nonlocality disappears and the ND problem converges to the classic diffusion problem. Under certain conditions, the exact solution to the ND problem may exhibit discontinuities, setting it apart from the classic diffusion problem. Since the DG method shows its great advantages in resolving problems with discontinuities in computational fluid dynamics over the past several decades, it is natural to adopt the DG method to compute the ND problems. Based on [Du-Ju-Lu-Tian-CAMC2020], we develop the DG methods with different penalty terms, ensuring that the proposed DG methods have local counterparts as the horizon vanishes. This indicates the proposed methods will converge to the existing DG schemes as the horizon vanishes, which is crucial for achieving asymptotic compatibility. Rigorous proofs are provided to demonstrate the stability, error estimates, and asymptotic compatibility of the proposed DG schemes. To observe the effect of the nonlocal diffusion, we also consider the time-dependent convection-diffusion problems with nonlocal diffusion. We conduct several numerical experiments, including accuracy tests and Burgers' equation with nonlocal diffusion, and various horizons are taken to show the good performance of the proposed algorithm and validate the theoretical findings.

math.NA↗

Nonlocal half-ball vector operators on bounded domains: Poincaré inequality and its applications

This work contributes to nonlocal vector calculus as an indispensable mathematical tool for the study of nonlocal models that arises in a variety of applications. We define the nonlocal half-ball gradient, divergence and curl operators with general kernel functions (integrable or fractional type with finite or infinite supports) and study the associated nonlocal vector identities. We study the nonlocal function space on bounded domains associated with zero Dirichlet boundary conditions and the half-ball gradient operator and show it is a separable Hilbert space with smooth functions dense in it. A major result is the nonlocal Poincaré inequality, based on which a few applications are discussed, and these include applications to nonlocal convection-diffusion, nonlocal correspondence model of linear elasticity, and nonlocal Helmholtz decomposition on bounded domains.

math.AP↗

Asymptotically compatible schemes for nonlinear variational models via Gamma-convergence and applications to nonlocal problems

We present a study on asymptotically compatible Galerkin discretizations for a class of parametrized nonlinear variational problems. The abstract analytical framework is based on variational convergence, or Gamma-convergence. We demonstrate the broad applicability of the theoretical framework by developing asymptotically compatible finite element discretizations of some representative nonlinear nonlocal variational problems on a bounded domain. These include nonlocal nonlinear problems with classically-defined, local boundary constraints through heterogeneous localization at the boundary, as well as nonlocal problems posed on parameter-dependent domains.

math.NA↗

Gaussian radial basis functions collocation for fractional PDEs: methodology and error analysis

The paper introduces a new meshfree pseudospectral method based on Gaussian radial basis functions (RBFs) collocation to solve fractional Poisson equations. Hypergeometric functions are used to represent the fractional Laplacian of Gaussian RBFs, enabling an efficient computation of stiffness matrix entries. Unlike existing RBF-based methods, our approach ensures a Toeplitz structure in the stiffness matrix with equally spaced RBF centers, enabling efficient matrix-vector multiplications using fast Fourier transforms. We conduct a comprehensive study on the shape parameter selection, addressing challenges related to ill-conditioning and numerical stability. The main contribution of our work includes rigorous stability analysis and error estimates of the Gaussian RBF collocation method, representing a first attempt at the rigorous analysis of RBF-based methods for fractional PDEs to the best of our knowledge. We conduct numerical experiments to validate our analysis and provide practical insights for implementation.

math.NA↗

$L^{p}$ compactness criteria with an application to variational convergence of some nonlocal energy functionals

Motivated by some variational problems from a nonlocal model of mechanics, this work presents a set of sufficient conditions that guarantee a compact inclusion in the function space of $L^{p}$ vector fields defined on a domain $Ω$ that is either a bounded domain in $\mathbb{R}^{d}$ or $\mathbb{R}^{d}$ itself. The criteria are nonlocal and are given with respect to nonlocal interaction kernels that may not be necessarily radially symmetric. Moreover, these criteria for vector fields are also different from those given for scalar fields in that the conditions are based on nonlocal interactions involving only parts of the components of the vector fields. The $L^{p}$ compactness criteria are utilized in demonstrating the convergence of minimizers of parametrized nonlocal energy functionals.

math.AP↗

Monotone meshfree methods for linear elliptic equations in non-divergence form via nonlocal relaxation

We design a monotone meshfree finite difference method for linear elliptic equations in the non-divergence form on point clouds via a nonlocal relaxation method. The key idea is a novel combination of a nonlocal integral relaxation of the PDE problem with a robust meshfree discretization on point clouds. Minimal positive stencils are obtained through a local $l_1$-type optimization procedure that automatically guarantees the stability and, therefore, the convergence of the meshfree discretization for linear elliptic equations. A major theoretical contribution is the existence of consistent and positive stencils for a given point cloud geometry. We provide sufficient conditions for the existence of positive stencils by finding neighbors within an ellipse (2d) or ellipsoid (3d) surrounding each interior point, generalizing the study for Poisson's equation by Seibold (Comput Methods Appl Mech Eng 198(3-4):592-601, 2008). It is well-known that wide stencils are in general needed for constructing consistent and monotone finite difference schemes for linear elliptic equations. Our result represents a significant improvement in the stencil width estimate for positive-type finite difference methods for linear elliptic equations in the near-degenerate regime (when the ellipticity constant becomes small), compared to previously known works in this area. Numerical algorithms and practical guidance are provided with an eye on the case of small ellipticity constant. At the end, we present numerical results for the performance of our method in both 2d and 3d, examining a range of ellipticity constants including the near-degenerate regime.

math.NA↗

Nonlocal diffusion models with consistent local and fractional limits

For some spatially nonlocal diffusion models with a finite range of nonlocal interactions measured by a positive parameter $δ$, we review their formulation defined on a bounded domain subject to various conditions that correspond to some inhomogeneous data. We consider their consistency to similar inhomogeneous boundary value problems of classical partial differential equation (PDE) models as the nonlocal interaction kernel gets localized in the local $δ\to 0$ limit, and at the same time, for rescaled fractional type kernels, to corresponding inhomogeneous nonlocal boundary value problems of fractional equations in the global $δ\to \infty$ limit. Such discussions help to delineate issues related to nonlocal problems defined on a bounded domain with inhomogeneous data.

math.AP↗

A Meshfree Peridynamic Model for Brittle Fracture in Randomly Heterogeneous Materials

In this work we aim to develop a unified mathematical framework and a reliable computational approach to model the brittle fracture in heterogeneous materials with variability in material microstructures, and to provide statistic metrics for quantities of interest, such as the fracture toughness. To depict the material responses and naturally describe the nucleation and growth of fractures, we consider the peridynamics model. In particular, a stochastic state-based peridynamic model is developed, where the micromechanical parameters are modeled by a finite-dimensional random vector, or a combination of random variables truncating the Karhunen-Loève decomposition or the principle component analysis (PCA). To solve this stochastic peridynamic problem, probabilistic collocation method (PCM) is employed to sample the random field representing the micromechanical parameters. For each sample, the deterministic peridynamic problem is discretized with an optimization-based meshfree quadrature rule. We present rigorous analysis for the proposed scheme and demonstrate its convergence for a number of benchmark problems, showing that it sustains the asymptotic compatibility spatially and achieves an algebraic or sub-exponential convergence rate in the random space as the number of collocation points grows. Finally, to validate the applicability of this approach on real-world fracture problems, we consider the problem of crystallization toughening in glass-ceramic materials, in which the material at the microstructural scale contains both amorphous glass and crystalline phases. The proposed stochastic peridynamic solver is employed to capture the crack initiation and growth for glass-ceramics with different crystal volume fractions, and the averaged fracture toughness are calculated. The numerical estimates of fracture toughness show good consistency with experimental measurements.

cond-mat.mtrl-sci↗

Efficient optimization-based quadrature for variational discretization of nonlocal problems

Casting nonlocal problems in variational form and discretizing them with the finite element (FE) method facilitates the use of nonlocal vector calculus to prove well-posedeness, convergence, and stability of such schemes. Employing an FE method also facilitates meshing of complicated domain geometries and coupling with FE methods for local problems. However, nonlocal weak problems involve the computation of a double-integral, which is computationally expensive and presents several challenges. In particular, the inner integral of the variational form associated with the stiffness matrix is defined over the intersections of FE mesh elements with a ball of radius $δ$, where $δ$ is the range of nonlocal interaction. Identifying and parameterizing these intersections is a nontrivial computational geometry problem. In this work, we propose a quadrature technique where the inner integration is performed using quadrature points distributed over the full ball, without regard for how it intersects elements, and weights are computed based on the generalized moving least squares method. Thus, as opposed to all previously employed methods, our technique does not require element-by-element integration and fully circumvents the computation of element-ball intersections. This paper considers one- and two-dimensional implementations of piecewise linear continuous FE approximations, focusing on the case where the element size h and the nonlocal radius $δ$ are proportional, as is typical of practical computations. When boundary conditions are treated carefully and the outer integral of the variational form is computed accurately, the proposed method is asymptotically compatible in the limit of $h \sim δ\to 0$, featuring at least first-order convergence in L^2 for all dimensions, using both uniform and nonuniform grids.

math.NA↗

Fractional Hardy-type and trace theorems for nonlocal function spaces with heterogeneous localization

In this work, we prove some trace theorems for function spaces with a nonlocal character that contain the classical $W^{s,p}$ space as a subspace. The result we obtain generalizes well known trace theorems for $W^{s,p}(Ω)$ functions which has a well-defined $W^{1-s/p, p}$ trace on the boundary of a domain with sufficient regularity. The new generalized spaces are associated with norms that are characterized by nonlocal interaction kernels defined heterogeneously with a special localization feature on the boundary. Intuitively speaking, the class contains functions that are as rough as an $L^p$ function inside the domain of definition but as smooth as a $W^{s,p}$ function near the boundary. Our result is that the $W^{1-s/p, p}$ norm of the trace on the boundary such functions is controlled by the nonlocal norms that are weaker than the classical $W^{s, p}$ norm. These results are improvement and refinement of the classical results since the boundary trace can be attained without imposing regularity of the function in the interior of the domain. They also extend earlier results in the case of $p=2$. In the meantime, we prove Hardy-type inequalities for functions in the new generalized spaces that vanish on the boundary, showing them having the same decay rate to the boundary as functions in the smaller space $W^{s,p}(Ω)$. A Poincaré-type inequality is also derived. An application of the new theory leads to the well-posedness of a nonlinear variational problem that allows possible singular behavior in the interior with imposed smoother data on the boundary.

math.AP↗