高次三角形有限元外推的探讨

探讨泊松方程高次三角形有限元外推公式.为此先推导离散格林函数的权模估计和有限元解的渐近不等式展开,然后给出公式的证明.     

二维非线性Volterra积分方程数值解的渐近展开及其外推

本文讨论了求解二维非线性Ｖｏｌｔｅｒｒａ积分方程的Ｎｙｓｔｒｏｍ方法，得到了数值解的逐项渐近展开。从而可进行Ｒｉｃｈａｒｄｓｏｎ外推，提高数值解的精度。     

高精度特征解及其外推求解位势方程

根据位势理论,基本边界特征值问题可转化为具有对数奇性的边界积分方程.利用机械求积方法求解特征值和特征向量,以及利用这些特征解求解Laplace方程.特征解和Laplace方程的解具有高精度和低的计算复杂度.利用Anselone聚紧和渐近紧理论,证明了方法的收敛性和稳定性.此外,还给出了误差的奇数阶渐近展开.利用h3-Richardson外推,不仅误差近似的精度阶大为提高,而且,得到的后验误差估计可以构造自适应算法.具体的数值例子说明了算法的有效性.     

非齐次小周期复合材料稳态热问题的多尺度渐近展开和收敛性分析

利用多尺度渐近展开和均匀化思想讨论了小周期复合材料的稳态热问题,得到了非齐次边界条件下二阶椭圆型方程的渐近解,并给出了原始解与渐近解之间的误差估计,数值结果表明了结论的正确性.     

一类小周期椭圆方程的三重尺度渐近分析

利用三重尺度方法对一类小周期椭圆方程进行了三重尺度渐近展开分析,构造了对应的三重尺度形式渐近展开式,得到了均匀化常数和均匀化方程.在形式渐近展开的基础上,构造了对应边值问题解的三重尺度渐近近似解,并分析了对应三重尺度形式渐近误差估计.     

一类非线性Neumann问题的渐近展开算法

Lions引入的变分形式中的渐近展开方法,用于线性问题是很有效的,但用于非线性问题,就会迂到很多麻烦,有时问题存在唯一,但找到解的渐近展开非常困难(见注记3.1).设Ω=Ω_0+?_1,在Ω_1上是线性算子,在Ω_0上是非线性算子,对有些问题可给出解的渐近展开算法.但在Ω_0和Ω_1上,同时是非线性算子时,直到现在仍是未解决的问题.设Ω=Ω_e+?_1(如图1)?=R~n,引入记号     

二维Volterra积分方程数值解的渐近展开及其外推

本文讨论了求解二维Ｖｏｌｔｅｒｒａ积分方程的Ｎｙｓｔｒｏｍ方法，得到了数值解的逐项渐近展开，从而可进行Ｒｉｃｈａｒｄｓｏｎ外推，提高数值解的精度。     

四阶方程两点边值问题Hermite有限元解的渐近展式与外推

1引言有限元解的渐近展式是提高微分方程数值解精度的重要工具,比如亏量校正和外推就是建立在有限元解的渐近展式的基础之上．许多作者对此进行了大量的研究(见[1]-[4]),特别是文[1],提出了在研究有限元解的渐近展式中十分有用的能量嵌入技巧．本文利用能量嵌入定理得到了四阶方程两点边值问题Hermite有限元解及其二阶平均导数的渐近展式,进一步我们还讨论了它们的Richardson外推公式．考虑四阶方程两点边值问题     

一类摄动超越方程的渐近解

用直接展开法得到了一类摄动超越方程的渐近解。     

自适应有限元和后验误差估计——渐近准确估计

在[7]中,作者讨论了有限元误差的1-模等价估计.本文是[7]的继续,给出一种自适应有限元计算中误差的1-模渐近准确估计,即对于误差的1-模||e||_1,Ω给出可计算的估计量?,当||e||_1,Ω→0时,成立?/||e||_1,Ω→1. 本文将沿用[7]中的定义及符号.     

带梯度项的椭圆型方程边界爆破解的高阶估计

In this paper,the higher order asymptotic behaviors of boundary blow-up solutions to the equation■in bounded smooth domain■are systematically investigated for p and q.The second and third order boundary behaviours of the equation are derived.The results show the role of the mean curvature of the boundary■and its gradient in the high order asymptotic expansions of the solutions.     

一类非自治Brinkman-Forchheimer系统的拉回$\mathcal{D}$-吸引子

The asymptotic behavior of solutions of the three-dimensional nonautonomous Brinkman-Forchheimer equation is investigated. And the existence of pullback global attractors in L2 (Ω) and H01(Ω) is proved, respectively.     

Function Spaces in Lipschitz Domains and Optimal Rates of Convergence for Sampling

Assume that we want to recover $f : \Omega \to {\bf C}$ in the $L_r$-quasi-norm ($0 < r \le \infty$) by a linear sampling method $$ S_n f = \sum_{j=1}^n f(x^j) h_j , $$ where $h_j \in L_r(\Omega )$ and $x^j \in \Omega$ and $\Omega \subset {\bf R}^d$ is an arbitrary bounded Lipschitz domain. We assume that $f$ is from the unit ball of a Besov space $B^s_{pq} (\Omega)$ or of a Triebel--Lizorkin space $F^s_{pq} (\Omega)$ with parameters such that the space is compactly embedded into $C(\overline{\Omega})$. We prove that the optimal rate of convergence of linear sampling methods is $$ n^{ -{s}/{d} + ({1}/{p}-{1}/{r})_+} , $$ nonlinear methods do not yield a better rate. To prove this we use a result from Wendland (2001) as well as results concerning the spaces $B^s_{pq} (\Omega) $ and $F^s_{pq}(\Omega)$. Actually, it is another aim of this paper to complement the existing literature about the function spaces $B^s_{pq} (\Omega)$ and $F^s_{pq} (\Omega)$ for bounded Lipschitz domains $\Omega \subset {\bf R}^d$. In this sense, the paper is also a continuation of a paper by Triebel (2002).     

Limitations of VCG-based mechanisms

We consider computationally-efficient truthful mechanisms that use the VCG payment scheme, and study how well they can approximate the social welfare in auction settings. We present a novel technique for setting lower bounds on the approximation ratio of this type of mechanisms. Our technique is based on setting lower bounds on the communication complexity by analyzing combinatorial properties of the algorithms. Specifically, for combinatorial auctions among submodular (and thus also subadditive) bidders we prove an $\Omega \left( {m^{\tfrac{1} {6}} } \right)$\Omega \left( {m^{\tfrac{1} {6}} } \right) lower bound, which is close to the known upper bound of ${\rm O}\left( {m^{\tfrac{1} {2}} } \right)${\rm O}\left( {m^{\tfrac{1} {2}} } \right), and qualitatively higher than the constant factor approximation possible from a purely computational point of view.     

Krawtchouk多项式的渐近性态

在前人的基础上,对Krawtchouk多项式及其零点的渐近性态进行了研究.首先推导出对于任意固定的u=n/N∈(0,P)或(0,q)Krawtchouk多项式Kn(λN)(其中λ=xN,0<λ<1)的一致有效渐近展开式.然后又得到了它的零点的渐近性态,并对其相应的误差限进行分析.该误差限为o(n-4/3).     

局部分数阶拉普拉斯算子的狄利克雷问题弱解的细正则性

In this paper, we study the Holder regularity of weak solutions to the Dirichlet problem associated with the regional fractional Laplacian (-△)^αΩ on a bounded open set Ω ■R(N ≥ 2) with C^(1,1) boundary ■Ω. We prove that when f ∈ L^p(Ω), and g ∈ C(Ω), the following problem (-△)^αΩu = f in Ω, u = g on ■Ω, admits a unique weak solution u ∈ W^(α,2)(Ω) ∩ C(Ω),where p >N/2-2α and 1/2< α < 1. To solve this problem, we consider it into two special cases, i.e.,g ≡ 0 on ■Ω and f ≡ 0 in Ω. Finally, taking into account the preceding two cases, the general conclusion is drawn.     

Extremal Functions for Adams Inequalities in Dimension Four

Let $\Omega\subset \mathbb{R}^4$ be a smooth bounded domain, $W_0^{2,2}(\Omega)$ be the usual Sobolev space. For any positive integer $\ell$, $\lambda_{\ell}(\Omega)$ is the $\ell$-th eigenvalue of the bi-Laplacian operator. Define $E_{\ell}=E_{\lambda_1(\Omega)}\oplus E_{\lambda_2(\Omega)}\oplus\cdots\oplus E_{\lambda_{\ell}(\Omega)}$, where $E_{\lambda_i(\Omega)}$ is eigenfunction space associated with $\lambda_i(\Omega)$. $E^{\bot}_{\ell}$ denotes the orthogonal complement of $E_\ell$ in $W_0^{2,2}(\Omega)$. For $0\leq\alpha<\lambda_{\ell+1}(\Omega)$, we define a norm by $\|u\|_{2,\alpha}^{2}=\|\Delta u\|^2_2-\alpha \|u\|^2_2$ for $u\in E^\bot_{\ell}$. In this paper, using the blow-up analysis, we prove the following Adams inequalities$$\sup_{u\in E_{\ell}^{\bot},\,\| u\|_{2,\alpha}\leq 1}\int_{\Omega}e^{32\pi^2u^2}{\rm d}x<+\infty;$$moreover, the above supremum can be attained by a function $u_0\in E_{\ell}^{\bot}\cap C^4(\overline{\Omega})$ with $\|u_0\|_{2,\alpha}=1$. This result extends that of Yang (J. Differential Equations, 2015), and complements that of Lu and Yang (Adv. Math. 2009) and Nguyen (arXiv: 1701.08249, 2017).     

一类具有奇异灵敏度的logistic趋化系统解的渐近行为

本文在无边界流的光滑有界区域$\Omega\subset\mathbb{R}^n~(n>2)$上研究了具有奇异灵敏度及logistic源的抛物-椭圆趋化系统$$\left\{\begin{array}{ll}u_t=\Delta u-\chi\nabla\cdot(\frac{u}{v}\nabla v)+r u-\mu u^k,&x\in\Omega,\,t>0,\\ 0=\Delta v-v+u,&x\in\Omega,\,t>0\end{array}\right.$$ 其中$\chi$, $r$, $\mu>0$, $k\geq2$. 证明了若当$r$适当大, 则当$t\rightarrow\infty$时该趋化系统全局有界解呈指数收敛于$((\frac{r}{\mu})^{\frac{1}{k-1}}, (\frac{r}{\mu})^{\frac{1}{k-1}})$.     

An Adaptive Mesh-Refining Algorithm Allowing for an <Emphasis Type="Italic">H</Emphasis><Superscript>1</Superscript> Stable <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> Projection onto Courant Finite Element Spaces

Suppose $\cal{S}^1({\cal T})\subset H^1(\Omega)$ is the $P_1$-finite element space of $\cal{T}$-piecewise affine functions based on a regular triangulation $\cal{T}$ of a two-dimensional surface $\Omega$ into triangles. The $L^2$ projection $\Pi$ onto $\cal{S}^1(\cal{T})$ is $H^1$ stable if $\norm{\Pi v}{H^1(\Omega)}\le C\norm{v}{H^1(\Omega)}$ for all $v$ in the Sobolev space $H^1(\Omega)$ and if the bound $C$ does not depend on the mesh-size in $\cal{T}$ or on the dimension of $\cal{S}^1(\cal{T})$. \hskip 1em A red–green–blue refining adaptive algorithm is designed which refines a coarse mesh $\cal{T}_0$ successively such that each triangle is divided into one, two, three, or four subtriangles. This is the newest vertex bisection supplemented with possible red refinements based on a careful initialization. The resulting finite element space allows for an $H^1$ stable $L^2$ projection. The stability bound $C$ depends only on the coarse mesh $\cal{T}_0$ through the number of unknowns, the shapes of the triangles in $\cal{T}_0$, and possible Dirichlet boundary conditions. Our arguments also provide a discrete version $\norm{h_\cal{T}^{-1}\,\Pi v}{L^2(\Omega)}\le C\norm{h_\cal{T}^{-1}\,v}{L^2(\Omega)}$ in $L^2$ norms weighted with the mesh-size $h_\T$.     

Estimates of Dirichlet Eigenvalues for One-Dimensional Fractal Drums

Let $\Omega$, with finite Lebesgue measure $|\Omega|$, be a non-empty open subset of $\mathbb{R}$, and $\Omega=\bigcup_{j=1}^\infty\Omega_j$, where the open sets $\Omega_j$ are pairwise disjoint and the boundary $\Gamma=\partial\Omega$ has Minkowski dimension $D\in (0,1)$. In this paper we study the Dirichlet eigenvalues problem on the domain $\Omega$ and give the exact second asymptotic term for the eigenvalues, which is related to the Minkowski dimension $D$. Meanwhile, we give sharp lower bound estimates for Dirichlet eigenvalues for such one-dimensional fractal domains.