arXiv subjects

Xiangxiong Zhang

Publications and source records attributed to Xiangxiong Zhang.

40 records · Page 3Linked to original sources

arXiv2019

Superconvergence of high order finite difference schemes based on variational formulation for elliptic equations

The classical continuous finite element method with Lagrangian $Q^k$ basis reduces to a finite difference scheme when all the integrals are replaced by the $(k+1)\times (k+1)$ Gauss-Lobatto quadrature. We prove that this finite difference scheme is $(k+2)$-th order accurate in the discrete 2-norm for an elliptic equation with Dirichlet boundary conditions, which is a superconvergence result of function values.

math.NA↗

arXiv2019

On the monotonicity and discrete maximum principle of the finite difference implementation of $C^0$-$Q^2$ finite element method

We show that the fourth order accurate finite difference implementation of continuous finite element method with tensor product of quadratic polynomial basis is monotone thus satisfies the discrete maximum principle for solving a scalar variable coefficient equation $-\nabla\cdot(a\nabla u)+cu=f$ under a suitable mesh constraint.

math.NA↗

arXiv2018

Asymptotic-preserving and positivity-preserving implicit-explicit schemes for the stiff BGK equation

We develop a family of second-order implicit-explicit (IMEX) schemes for the stiff BGK kinetic equation. The method is asymptotic-preserving (can capture the Euler limit without numerically resolving the small Knudsen number) as well as positivity-preserving --- a feature that is not possessed by any of the existing second or high order IMEX schemes. The method is based on the usual IMEX Runge-Kutta framework plus a key correction step utilizing the special structure of the BGK operator. Formal analysis is presented to demonstrate the property of the method and is supported by various numerical results. Moreover, we show that the method satisfies an entropy-decay property when coupled with suitable spatial discretizations. Additionally, we discuss the generalization of the method to some hyperbolic relaxation system and provide a strategy to extend the method to third order.

math.NA↗

arXiv2013

Eventual linear convergence of the Douglas Rachford iteration for basis pursuit

We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of $\ell^1$ minimization with linear constraints, and quantify the asymptotic linear convergence rate in terms of principal angles between relevant vector spaces. In the compressed sensing setting, we show how to bound this rate in terms of the restricted isometry constant. More general iterative schemes obtained by $\ell^2$-regularization and over-relaxation including the dual split Bregman method are also treated, which answers the question how to choose the relaxation and soft-thresholding parameters to accelerate the asymptotic convergence rate. We make no attempt at characterizing the transient regime preceding the onset of linear convergence.

math.NA↗