A Trilayer Difference Scheme for One-Dimensional Parabolic Systems

In order to obtain the numerical solution for a one-dimensional parabolic system, an unconditionally stable difference method is investigated in [1]. If the number of unknown functions is M, for each time step only M times of calculation are needed. The rate of convergence is $O(\tau+h^2)$. On the basis of [1], an alternating calculation difference scheme is presented in [2]; the rate of the convergence is $O(\tau^2+h^2)$. The difference schemes in [1] and [2] are economic ones. For the $\alpha$-$th$ equation, only $U_{\alpha}$ is an unknown function; the others $U_{\beta}$ are given evaluated either in the last step or in the present step. So the practical calculation is quite convenient. The purpose of this paper is to derive a trilayer difference scheme for one-dimensional parabolic systems. It is known that the scheme is also unconditionally stable and the rate of convergence is $O(\tau^2+h^2)$.     

求解二维Fisher-KPP方程的一类保正保界差分格式及其Richardson外推法

本文研究求解二维Fisher-Kolmogorov-Petrovsky-Piscounov (Fisher-KPP)方程的一类保正保界差分格式.运用能量分析法证明了当网格比满足$R_{x}+R_{y}+[b\tau (p-1)]/2\leq\frac{1}{2}$时差分解具有一系列数学性质,包括保正性、保界性和单调性,且在无穷范数意义下有$O (\tau+h_{x}^{2}+h_{y}^{2})$的收敛阶.然后通过发展Richardson外推法得到收敛阶为$O (\tau^{2}+h_{x}^{4}+h_{y}^{4})$的外推解.最后数值实验表明数值结果与理论结果相吻合.值得提及的是在运用本文构造的Richardson外推法时对时空网格比没有增加更严格的条件.     

The skin effect in vibrating systems with many concentrated masses

We address the asymptotic behaviour of the vibrations of a body occupying a domain $\Omega\subset\mathbb{R}^n, n=2,3$. The density, which depends on a small parameter $\varepsilon$\nopagenumbers\end , is of the order $O(1)$\nopagenumbers\end out of certain regions where it is $O(\varepsilon^{‐m})$\nopagenumbers\end with $m>2$\nopagenumbers\end . These regions, the concentrated masses with diameter $O(\varepsilon)$\nopagenumbers\end , are located near the boundary, at mutual distances $O(\eta)$\nopagenumbers\end , with $\eta=\eta(\varepsilon)\rightarrow 0$\nopagenumbers\end . We impose Dirichlet (resp. Neumann) conditions at the points of $\partial\Omega$\nopagenumbers\end in contact with (resp. out of) the masses. We look at the asymptotic behaviour, as $\varepsilon\rightarrow 0$\nopagenumbers\end , of the eigenvalues of order $O(1)$\nopagenumbers\end , the high frequencies, of the corresponding eigenvalue problem. We show that they accumulate on the whole positive real axis and characterize those giving rise to global vibrations of the whole system. We use the fact that the corresponding eigenfunctions, microscopically, present a skin effect in the concentrated masses. Copyright © 2001 John Wiley & Sons, Ltd.     

(Semi-)Nonrelativisitic Limit of the Nonlinear Dirac Equations

We consider the nonlinear Dirac equation (NLD) with time dependent external electro-magnetic potentials, involving a dimensionless parameter $ε\in(0,1]$ which is inversely proportional to the speed of light. In the nonrelativistic limit regime $ε\ll1$ (speed of light tends to infinity), we decompose the solution into the eigenspaces associated with the 'free Dirac operator' and construct an approximation to the NLD with $O(ε^2)$ error. The NLD converges (with a phase factor) to a coupled nonlinear Schrödinger system (NLS) with external electric potential in the nonrelativistic limit as $ε\to0^+$, and the error of the NLS approximation is first order $O(ε)$. The constructed $O(ε^2)$ approximation is well-suited for numerical purposes.     

On the numerical computation of blowing‐up solutions for semilinear parabolic equations

Theoretical aspects related to the approximation of the semilinear parabolic equation: $u_t=\Delta u+f(u)$\nopagenumbers\end , with a finite unknown ‘blow‐up’ time T_b have been studied in a previous work. Specifically, for ε a small positive number, we have considered coupled systems of semilinear parabolic equations, with positive solutions and ‘mass control’ property, such that: \def\ve{^\varepsilon}$$u_t\ve=\Delta u\ve+f(u\ve)v\ve\qquad v_t\ve=\Delta v\ve‐\varepsilon f(u\ve)v\ve$$\nopagenumbers\end The solution \def\ve{^\varepsilon}$$\{u\ve,v\ve\}$$\nopagenumbers\end of such systems is known to be global. It is shown that $$\|(u^\varepsilon‐u)(\, .\, ,t)\|_\infty\leq C(M_T)\varepsilon$$\nopagenumbers\end , \def\lt{\char'74}$t\leq T \lt T_b$\nopagenumbers\end where $M_T=\|u(\, .\, ,T)\|_\infty$\nopagenumbers\end and $C(M_T)$\nopagenumbers\end is given by (6). In this paper, we suggest a numerical procedure for approaching the value of the blow‐up time T_b and the blow‐up solution u. For this purpose, we construct a sequence $\{M_\eta\}$\nopagenumbers\end , with $\lim_{\eta\rightarrow 0}M_\eta=\infty$\nopagenumbers\end . Correspondingly, for $\varepsilon\leq1/2C(M_\eta+1)=\eta^\alpha$\nopagenumbers\end and \def\lt{\char'74}$0\lt\alpha\lt\,\!1$\nopagenumbers\end , we associate a specific sequence of times $\{T_\varepsilon\}$\nopagenumbers\end , defined by $\|u^\varepsilon(\, .\, ,T_\varepsilon)\|_\infty=M_\eta$\nopagenumbers\end . In particular, when $\varepsilon=\eta\leq\eta^\alpha$\nopagenumbers\end , the resulting sequence $\{T_\varepsilon\equiv T_\eta\}$\nopagenumbers\end , verifies, $\|(u‐u^\eta)(\, .\, ,t)\|_\infty\leq{1\over2}(\eta)^{1‐\alpha}$\nopagenumbers\end , \def\lt{\char'74}$0\leq t\leq T_\eta\lt T_{\rm b}$\nopagenumbers\end with $\lim_{\eta\rightarrow 0}T_\eta=T_{\rm b}$\nopagenumbers\end . The two special cases of a single‐point blow‐up where $f(u)=\lambda{\rm e}^u$\nopagenumbers\end and $f(u)=u^p$\nopagenumbers\end are then studied, yielding respectively sequences $\{M_\eta\}$\nopagenumbers\end of order $O(\ln|\ln(\eta)|)$\nopagenumbers\end and $O(\{|\ln(\eta)|\}^{1/p‐1})$\nopagenumbers\end . The estimate $|T_\eta‐T_{\rm b}|/T_{\rm b}=O(1/|\ln(\eta)|)$\nopagenumbers\end is proven to be valid in both cases. We conduct numerical simulations that confirm our theoretical results. Copyright © 2001 John Wiley & Sons, Ltd.     

空间-时间分数阶对流扩散方程的数值解法

本文考虑一个空间-时间分数阶对流扩散方程.这个方程是将一般的对流扩散方程中的时间一阶导数用α(0＜α＜1)阶导数代替,空间二阶导数用β(1＜β＜2)阶导数代替.本文提出了一个隐式差分格式,验证了这个格式是无条件稳定的,并证明了它的收敛性,其收敛阶为O(ι h).最后给出了数值例子.     

自正则化和Davis大数律和重对数律的精确渐近性

本文证明了自正则化Davis大数律和重对数律的精确渐近性, 即 {\heiti\bf 定理1}\hy 设$\ep X=0$, 且$\ep X^2I_{(|X|\leq x)}$在无穷远处是缓变函数, 则$\lim_{\varepsilon\searrow0}\varepsilon^2\tsm_{n\geq3}\frac{1}{n\log n}\pr\Big(\Big|\frac{S_n}{V_n}\Big|\geq\varepsilon\sqrt{\log\log n}\Big)=1.${\heiti\bf 定理2}\hy 设$\ep X=0$, 且$\ep X^2I_{(|X|\leq x)}$在无穷远处是缓变函数, 则对本文证明了目正则化Davis大数律和重对数律的精确渐近性,即定理1设EX=0,且EX~2I_(|x|≤x)在无穷远处是缓变函数,则■定理2设EX=0,且EX~2I_(|x|≤x)在无穷远处是缓变函数,则对0≤δ≤1,有■其中N为标准正态随机变量．     

A high order difference method for fractional sub-diffusion equations with the spatially variable coefficients under periodic boundary conditions

In this paper, we propose a difference scheme with global convergence order $O(\tau^{2}+h^4)$ for a class of the Caputo fractional equation. The difficulty caused by the spatially variable coefficients is successfully handled. The unique solvability, stability and convergence of the finite difference scheme are proved by use of the Fourier method. The obtained theoretical results are supported by numerical experiments.     

A compact difference scheme for fourth-order fractional sub-diffusion equations with Neumann boundary conditions

In this paper, a compact finite difference scheme with global convergence order $O(\tau^{2}+h^4)$ is derived for fourth-order fractional sub-diffusion equations subject to Neumann boundary conditions. The difficulty caused by the fourth-order derivative and Neumann boundary conditions is carefully handled. The stability and convergence of the proposed scheme are studied by the energy method. Theoretical results are supported by numerical experiments.     

Finite element algorithm based on high-order time approximation for time fractional convection-diffusion equation

In this paper, finite element method with high-order approximation for time fractional derivative is considered and discussed to find the numerical solution of time fractional convection-diffusion equation. Some lemmas are introduced and proved, further the stability and error estimates are discussed and analyzed, respectively. The convergence result $O(h^{r+1}+\tau^{3-\alpha})$ can be derived, which illustrates that time convergence rate is higher than the order $(2-\alpha)$ derived by $L1$-approximation. Finally, to validate our theoretical results, some computing data are provided.     

On the dynamical law of the Ginzburg‐Landau vortices on the plane

We study the Ginzburg‐Landau equation on the plane with initial data being the product of n well‐separated +1 vortices and spatially decaying perturbations. If the separation distances are O(ϵ⁻¹), ϵ ≪ l, we prove that the n vortices do not move on the time scale $O(\varepsilon^{‐2}\lambda_{\varepsilon}), \lambda_{\varepsilon} = o(\log {1\over \varepsilon})$; instead, they move on the time scale according to the law ẋ_j = − ∇_xj W, W = − Σ_l≠j log|x_l −x_j|, x_j = (ξ_j, η_j) ∈ ℝ², the location of the j^th vortex. The main ingredients of our proof consist of estimating the large space behavior of solutions, a monotonicity inequality for the energy density of solutions, and energy comparisons. Combining these, we overcome the infinite energy difficulty of the planar vortices to establish the dynamical law. © John & Wiley Sons, Inc.     

A Two-Grid Finite Element Approximation for Nonlinear Time Fractional Two-Term Mixed Sub-Diffusion and Diffusion Wave Equations

In this paper, we develop a two-grid method (TGM) based on the FEM for 2D nonlinear time fractional two-term mixed sub-diffusion and diffusion wave equations. A two-grid algorithm is proposed for solving the nonlinear system, which consists of two steps: a nonlinear FE system is solved on a coarse grid, then the linearized FE system is solved on the fine grid by Newton iteration based on the coarse solution. The fully discrete numerical approximation is analyzed, where the Galerkin finite element method for the space derivatives and the finite difference scheme for the time Caputo derivative with order $\alpha\in(1,2)$ and $\alpha_{1}\in(0,1)$. Numerical stability and optimal error estimate $O(h^{r+1}+H^{2r+2}+\tau^{\min\{3-\alpha,2-\alpha_{1}\}})$ in $L^{2}$-norm are presented for two-grid scheme, where $t,$ $H$ and $h$ are the time step size, coarse grid mesh size and fine grid mesh size, respectively. Finally, numerical experiments are provided to confirm our theoretical results and effectiveness of the proposed algorithm.     

Structured backward error for palindromic polynomial eigenvalue problems

A detailed structured backward error analysis for four kinds of palindromic polynomial eigenvalue problems (PPEP)

Geometric applications of Chernoff-type estimates and a ZigZag approximation for balls

In this paper we show that the euclidean ball of radius in can be approximated up to , in the Hausdorff distance, by a set defined by linear inequalities. We call this set a ZigZag set, and it is defined to be all points in space satisfying or more of the inequalities. The constant we get is , where is some universal constant. This should be compared with the result of Barron and Cheang (2000), who obtained . The main ingredient in our proof is the use of Chernoff's inequality in a geometric context. After proving the theorem, we describe several other results which can be obtained using similar methods.

     

A Fast Conservative Scheme for the Space Fractional Nonlinear Schrödinger Equation with Wave Operator

A new efficient compact difference scheme is proposed for solving a space fractional nonlinear Schrödinger equation with wave operator. The scheme is proved to conserve the total mass and total energy in a discrete sense. Using the energy method, the proposed scheme is proved to be unconditionally stable and its convergence order is shown to be of $ \mathcal{O}( h^6 + \tau^2) $ in the discrete $ L_2 $ norm with mesh size $ h $ and the time step $ \tau $. Moreover, a fast difference solver is developed to speed up the numerical computation of the scheme. Numerical experiments are given to support the theoretical analysis and to verify the efficiency, accuracy, and discrete conservation laws.     

Dimension Reduction for Finite Trees in \varvec{\ell _1}

We show that every $n$ -point tree metric admits a $(1+\varepsilon )$ -embedding into $\ell _1^{C(\varepsilon ) \log n}$ , for every $\varepsilon > 0$ , where $C(\varepsilon ) \le O\big ((\frac{1}{\varepsilon })^4 \log \frac{1}{\varepsilon })\big )$ . This matches the natural volume lower bound up to a factor depending only on $\varepsilon $ . Previously, it was unknown whether even complete binary trees on $n$ nodes could be embedded in $\ell _1^{O(\log n)}$ with $O(1)$ distortion. For complete $d$ -ary trees, our construction achieves $C(\varepsilon ) \le O\big (\frac{1}{\varepsilon ^2}\big )$ .     

On the moduli of convexity

It is known that, given a Banach space , the modulus of convexity associated to this space is a non-negative function, non-decreasing, bounded above by the modulus of convexity of any Hilbert space and satisfies the equation for every , where is a constant. We show that, given a function satisfying these properties then, there exists a Banach space in such a way its modulus of convexity is equivalent to , in Figiel's sense. Moreover this Banach space can be taken to be two-dimensional.

     

Existence and concentration result for Kirchhoff equations with critical exponent and Hartree nonlinearity

This paper is concerned with the following Kirchhoff-type equations $$ \left\{ \begin{array}{ll} \displaystyle -\big(\varepsilon^{2}a+\varepsilon b\int_{\mathbb{R}^{3}}|\nabla u|^{2}\mathrm{d}x\big)\Delta u + V(x)u+\mu\phi |u|^{p-2}u=f(x,u), &\quad \mbox{ in }\mathbb{R}^{3},\(-\Delta)^{\frac{\alpha}{2}} \phi=\mu|u|^{p},~u>0, &\quad \mbox{ in }\mathbb{R}^{3},\\end{array} \right. $$ where $f(x,u)=\lambda K(x)|u|^{q-2}u+Q(x)|u|^{4}u$, $a>0,~b,~\mu\geq0$ are constants, $\alpha\in(0,3)$, $p\in[2,3),~q\in[2p,6)$ and $\varepsilon,~\lambda>0$ are parameters. Under some mild conditions on $V(x),~K(x)$ and $Q(x)$, we prove that the above system possesses a ground state solution $u_{\varepsilon}$ with exponential decay at infinity for $\lambda>0$ and $\varepsilon$ small enough. Furthermore, $u_{\varepsilon}$ concentrates around a global minimum point of $V(x)$ as $\varepsilon\rightarrow0$. The methods used here are based on minimax theorems and the concentration-compactness principle of Lions. Our results generalize and improve those in Liu and Guo (Z Angew Math Phys 66: 747-769, 2015), Zhao and Zhao (Nonlinear Anal 70: 2150-2164, 2009) and some other related literature.     

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, and numerical solution of symmetric positive definite linear systems. In this paper, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm, which is called the universal greedy approach (UGA) for the graph sparsification problem. For a general spectral sparsification problem, e.g., the positive subset selection problem from a set of $m$ vectors in $\mathbb{R}^n$, we propose a nonnegative UGA algorithm which needs $O(mn^2+ n^3/\epsilon^2)$ time to find a $\frac{1+\epsilon/\beta}{1-\epsilon/\beta}$-spectral sparsifier with positive coefficients with sparsity at most $\lceil\frac{n}{\epsilon^2}\rceil$, where $\beta$ is the ratio between the smallest length and largest length of the vectors. The convergence of the nonnegative UGA algorithm is established. For the graph sparsification problem, another UGA algorithm is proposed which can output a $\frac{1+O(\epsilon)}{1-O(\epsilon)}$-spectral sparsifier with $\lceil\frac{n}{\epsilon^2}\rceil$ edges in $O(m+n^2/\epsilon^2)$ time from a graph with $m$ edges and $n$ vertices under some mild assumptions. This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for. The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear, i.e. $O(m^{1+o(1)})$ for some $o(1)=O(\frac{(\log\log(m))^{2/3}}{\log^{1/3}(m)})$. Finally, extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches.     

On Numerical Solution of Quasilinear Boundary Value Problems with Two Small Parameters

We consider the singular perturbation problem $$-\varepsilon^2u"+\mu b(x,u)u'+c(x,u)=0,u(0),u(1)$$ given with two small parameters $\varepsilon$ and $\mu$ , $\mu =\varepsilon^{1+p},p>0$. The problem is solved numerically by using finite difference schemes on the mesh which is dense in the boundary layers. The convergence uniform in $\varepsilon$ is proved in the discrete $L^1$ norm. Some convergence results are given in the maximum norm as well.