Semiconvergence analysis of the randomized row iterative method and its extended variants

The row iterative method is popular in solving the large‐scale ill‐posed problems due to its simplicity and efficiency. In this work we consider the randomized row iterative (RRI) method to tackle this issue. First, we present the semiconvergence analysis of RRI method for the overdetermined and inconsistent system, and derive upper bounds for the noise error propagation in the iteration vectors. To achieve a least squares solution, we then propose an extended version of the RRI (ERRI) method, which in fact can converge in expectation to the solution of the overdetermined or underdetermined, consistent or inconsistent systems. Finally, some numerical examples are given to demonstrate the convergence behaviors of the RRI and ERRI methods for these types of linear system.     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

Generalized Jacobi spectral Galerkin method for fractional pantograph differential equation

This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.     

Local discontinuous Galerkin method for a nonlocal viscous conservation laws

The purpose of this article is to investigate high‐order numerical approximations of scalar conservation laws with nonlocal viscous term. The viscous term is given in the form of convolution in space variable. With the help of the characteristic of viscous term, we design a semidiscrete local discontinuous Galerkin (LDG) method to solve the nonlocal model. We prove stability and convergence of semidiscrete LDG method in L² norm. The theoretical analysis reveals that the present numerical scheme is stable with optimal convergence order for the linear case, and it is stable with sub‐optimal convergence order for nonlinear case. To demonstrate the validity and accuracy of our scheme, we test the Burgers equation with two typical nonlocal fractional viscous terms. The numerical results show the convergence order accuracy in space for both linear and nonlinear cases. Some numerical simulations are provided to show the robustness and effectiveness of the present numerical scheme.     

Fast Evaluation of Linear Combinations of Caputo Fractional Derivatives and Its Applications to Multi-Term Time-Fractional Sub-Diffusion Equations

In the present work, linear combinations of Caputo fractional derivatives are fast evaluated based on the efficient sum-of-exponentials (SOE) approximation for kernels in Caputo fractional derivatives with an absolute error $\epsilon,$ which is a further work of the existing results in [13] (Commun. Comput. Phys., 21 (2017), pp. 650-678) and [16] (Commun. Comput. Phys., 22 (2017), pp. 1028-1048). Both the storage needs and computational amount are significantly reduced compared with the direct algorithm. Applications of the proposed fast algorithm are illustrated by solving a second-order multi-term time-fractional sub-diffusion problem. The unconditional stability and convergence of the fast difference scheme are proved. The CPU time is largely reduced while the accuracy is kept, especially for the cases of large temporal level, which is displayed by numerical experiments.     

On inexact alternating direction implicit iteration for continuous Sylvester equations

In this paper, we study the alternating direction implicit (ADI) iteration for solving the continuous Sylvester equation AX + XB = C , where the coefficient matrices A and B are assumed to be positive semi‐definite matrices (not necessarily Hermitian), and at least one of them to be positive definite. We first analyze the convergence of the ADI iteration for solving such a class of Sylvester equations, then derive an upper bound for the contraction factor of this ADI iteration. To reduce its computational complexity, we further propose an inexact variant of the ADI iteration, which employs some Krylov subspace methods as its inner iteration processes at each step of the outer ADI iteration. The convergence is also analyzed in detail. The numerical experiments are given to illustrate the effectiveness of both ADI and inexact ADI iterations.     

Analysis of a micro–macro acceleration method with minimum relative entropy moment matching

We analyse convergence of a micro–macro acceleration method for the simulation of stochastic differential equations with time-scale separation. The method alternates short bursts of path simulations with the extrapolation of macroscopic state variables forward in time. After extrapolation, a new microscopic state is constructed, consistent with the extrapolated macroscopic state, that minimises the perturbation caused by the extrapolation in a relative entropy sense. We study local errors and numerical stability of the method to prove its convergence to the full microscopic dynamics when the extrapolation time step tends to zero and the number of macroscopic state variables tends to infinity.     

Asymptotic results for weighted means of linear combinations of independent Poisson random variables

ABSTRACT

In this paper we prove the large deviation principle for a class of weighted means of linear combinations of independent Poisson distributed random variables, which converge weakly to a normal distribution. The interest in these linear combinations is motivated by the diffusion approximation in Lansky [On approximations of Stein's neuronal model, J. Theoret. Biol. 107 (1984), pp. 631–647] of the Stein's neuronal model (see Stein [A theoretical analysis of neuronal variability, Biophys. J. 5 (1965), pp. 173–194]). We also prove an analogue result for sequences of multivariate random variables based on the diffusion approximation in Tamborrino, Sacerdote, and Jacobsen [Weak convergence of marked point processes generated by crossings of multivariate jump processes. Applications to neural network modeling, Phys. D 288 (2014), pp. 45–52]. The weighted means studied in this paper generalize the logarithmic means. We also investigate moderate deviations.