The Finite Element Analysis of the Controlled-Source Electromagnetic Induction Problems by Fractional-Step Projection Method

This paper provides a convergence analysis of a fractional-step projection method for the controlled-source electromagnetic induction problems in heterogenous electrically conduting media by means of finite element approximations. Error estimates in finite time are given. And it is verified that provided the time step $\tau$ is sufficiently small, the proposed algorithm yields for finite time $T$ an error of $\mathcal{O}(h^s+\tau)$) in the $L^2$-norm for the magnetic field $\boldsymbol{H},$ where $h$ is the mesh size and $1/2 < s≤1$.     

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.     

Analysis of a Fully Discrete Finite Element Method for Parabolic Interface Problems with Nonsmooth Initial Data

This article concerns numerical approximation of a parabolic interface problem with general $L^2$ initial value. The problem is discretized by a finite element method with a quasi-uniform triangulation of the domain fitting the interface, with piecewise linear approximation to the interface. The semi-discrete finite element problem is furthermore discretized in time by the $k$-step backward difference formula with $ k=1,\ldots,6 $. To maintain high-order convergence in time for possibly nonsmooth $L^2$ initial value, we modify the standard backward difference formula at the first $k-1$ time levels by using a method recently developed for fractional evolution equations. An error bound of $\mathcal{O}(t_n^{-k}\tau^k+t_n^{-1}h^2|\log h|)$ is established for the fully discrete finite element method for general $L^2$ initial data.     

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.     

双曲空间中完备子流形的特征值估计

研究了$(n+p)$维双曲空间$\mathbb{H}^{n+p}$中完备非紧子流形的第一特征值的上界.特别地,证明了$\mathbb{H}^{n+p}$中具有平行平均曲率向量$H$和无迹第二基本形式有限$L^q(q\geq n)$范数的完备子流形的第一特征值不超过$\frac{(n-1)^2(1-|H|^2)}{4}$,和$\mathbb{H}^{n+1}(n\leq5)$中具有常平均曲率向量$H$和无迹第二基本形式有限$L^q(2(1-\sqrt{\frac{2}{n}})相似文献   

带有幂型的广义Zakharov方程组解的爆破率的下界估计

主要研究了关于R~2中一类带有幂型非线性的广义Zakharov方程组的Cauchy问题的有限时间爆破解的爆破率的下界估计.在α≤0和p≥3条件下,对于Cauchy问题任意给定的属于能量空间H~1(R~2)×L~2(R~2)×L~2(R~2)的有限时间的爆破解,得到了对于t靠近有限爆破时间T时的爆破率的最优下界估计.此外,给出了Cauchy问题维里等式的一个应用.     

Analysis of finite element approximation for time-dependent Maxwell problems

We provide an error analysis of finite element methods for solving time-dependent Maxwell problem using Nedelec and Thomas-Raviart elements. We study the regularity of the solution and develop some new error estimates of Nedelec finite elements. As a result, the optimal -error bound for the semidiscrete scheme is obtained.

     

Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers

We study the approximation problem (or problem of optimal recovery in the $L_2$-norm) for weighted Korobov spaces with smoothness parameter $\a$. The weights $\gamma_j$ of the Korobov spaces moderate the behavior of periodic functions with respect to successive variables. The nonnegative smoothness parameter $\a$ measures the decay of Fourier coefficients. For $\a=0$, the Korobov space is the $L_2$ space, whereas for positive $\a$, the Korobov space is a space of periodic functions with some smoothness and the approximation problem corresponds to a compact operator. The periodic functions are defined on $[0,1]^d$ and our main interest is when the dimension $d$ varies and may be large. We consider algorithms using two different classes of information. The first class $\lall$ consists of arbitrary linear functionals. The second class $\lstd$ consists of only function values and this class is more realistic in practical computations. We want to know when the approximation problem is tractable. Tractability means that there exists an algorithm whose error is at most $\e$ and whose information cost is bounded by a polynomial in the dimension $d$ and in $\e^{-1}$. Strong tractability means that the bound does not depend on $d$ and is polynomial in $\e^{-1}$. In this paper we consider the worst case, randomized, and quantum settings. In each setting, the concepts of error and cost are defined differently and, therefore, tractability and strong tractability depend on the setting and on the class of information. In the worst case setting, we apply known results to prove that strong tractability and tractability in the class $\lall$ are equivalent. This holds if and only if $\a>0$ and the sum-exponent $s_{\g}$ of weights is finite, where $s_{\g}= \inf\{s>0 : \xxsum_{j=1}^\infty\g_j^s\,<\,\infty\}$. In the worst case setting for the class $\lstd$ we must assume that $\a>1$ to guarantee that functionals from $\lstd$ are continuous. The notions of strong tractability and tractability are not equivalent. In particular, strong tractability holds if and only if $\a>1$ and $\xxsum_{j=1}^\infty\g_j<\infty$. In the randomized setting, it is known that randomization does not help over the worst case setting in the class $\lall$. For the class $\lstd$, we prove that strong tractability and tractability are equivalent and this holds under the same assumption as for the class $\lall$ in the worst case setting, that is, if and only if $\a>0$ and $s_{\g} < \infty$. In the quantum setting, we consider only upper bounds for the class $\lstd$ with $\a>1$. We prove that $s_{\g}<\infty$ implies strong tractability. Hence for $s_{\g}>1$, the randomized and quantum settings both break worst case intractability of approximation for the class $\lstd$. We indicate cost bounds on algorithms with error at most $\e$. Let $\cc(d)$ denote the cost of computing $L(f)$ for $L\in \lall$ or $L\in \lstd$, and let the cost of one arithmetic operation be taken as unity. The information cost bound in the worst case setting for the class $\lall$ is of order $\cc (d) \cdot \e^{-p}$ with $p$ being roughly equal to $2\max(s_\g,\a^{-1})$. Then for the class $\lstd$ in the randomized setting, we present an algorithm with error at most $\e$ and whose total cost is of order $\cc(d)\e^{-p-2} + d\e^{-2p-2}$, which for small $\e$ is roughly $$ d\e^{-2p-2}. $$ In the quantum setting, we present a quantum algorithm with error at most $\e$ that uses about only $d + \log \e^{-1}$ qubits and whose total cost is of order $$ (\cc(d) +d) \e^{-1-3p/2}. $$ The ratio of the costs of the algorithms in the quantum setting and the randomized setting is of order $$ \frac{d}{\cc(d)+d}\,\left(\frac1{\e}\right)^{1+p/2}. $$ Hence, we have a polynomial speedup of order $\e^{-(1+p/2)}$. We stress that $p$ can be arbitrarily large, and in this case the speedup is huge.     

Unconditionally Superclose Analysis of a New Mixed Finite Element Method for Nonlinear Parabolic Equation

This paper develops a framework to deal with the unconditional superclose analysis of nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example, a new mixed finite element method (FEM) is established and the $τ$ -independent superclose results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an error splitting technique, with which the time-discrete and the spatial-discrete systems are constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require certain time step conditions. Finally, some numerical results are provided to confirm the theoretical analysis, and show the efficiency of the proposed method.     

Weak Galerkin finite element methods combined with Crank-Nicolson scheme for parabolic interface problems

This article is devoted to the a priori error estimates of the fully discrete Crank-Nicolson approximation for the linear parabolic interface problem via weak Galerkin finite element methods (WG-FEM). All the finite element functions are discontinuous for which the usual gradient operator is implemented as distributions in properly defined spaces. Optimal order error estimates in both $L^{\infty}(H^1)$ and $L^{\infty}(L^2)$ norms are established for lowest order WG finite element space $({\cal P}_{k}(K),\;{\cal P}_{k-1}(\partial K),\;\big[{\cal P}_{k-1}(K)\big]^2)$. Finally, we give numerical examples to verify the theoretical results.