求解一维非定常对流扩散反应方程的高精度紧致差分格式

提出了数值求解一维非定常对流扩散反应方程的一种高精度紧致隐式差分格式,其截断误差为O(τ~4+τ~2h~2+h~4),即格式整体具有四阶精度.差分方程在每一时间层上只用到了三个网格节点,所形成的代数方程组为三对角型,可采用追赶法进行求解,最后通过数值算例验证了格式的精确性和可靠性.     

求解一维对流方程的高精度紧致差分格式

本文提出数值求解一维对流方程的一种两层隐式紧致差分格式,采用泰勒级数展开法以及对截断误差余项中的三阶导数进行修正的方法对时间和空间导数进行离散.格式的截断误差为O(τ~4+τ~2h~2+h~4),即该格式在时间和空间上均可达到四阶精度.利用von Neumann方法分析得到该格式是无条件稳定的.通过数值实验验证了本文格式的精确性和稳定性.     

一类非线性四阶双曲方程一个低阶混合元方法的超收敛分析

对一类非线性四阶双曲方程利用双线性元Q_(11)给出一个低阶混合元逼近格式.利用双线性元的高精度结果,关于时间t的导数转移技巧,插值与投影相结合的思想及分裂技术,在半离散格和全离散式下,分别导出原始变量u和中间变量v=-?u在H~1模意义下具有O(h~2)/O(h~2+τ~2)阶的超逼近性质.与此同时,借助插值后处理技术,证明在H1模意义下具有O(h~2)/O(h~2+τ~2)阶的整体超收敛结果.这里,h和τ分别表示空间剖分参数和时间剖分参数.     

四阶强阻尼非线性波动方程的Hermite型矩形混合有限元分析

讨论了四阶强阻尼非线性波动方程的Hermite型混合有限元方法,并证明了半离散格式下解的存在唯一性.基于该元积分恒等式结果,利用插值与Ritz投影之间的误差估计,可得到半离散格式下O(h~3)阶的超逼近性质,再借助于插值后处理技术导出整体超收敛.进而,通过构造一个新的金离散格式,得到了O(h~3+τ~2)的超逼近和超收敛结果.     

RLW-KdV方程的紧致有限差分格式

本文研究了RLW-KdV方程的一个三层线性紧致有限差分格式.该格式是质量守恒和能量守恒的,用离散能量法证明了差分格式的收敛性和稳定性.所建格式的收敛阶为O(τ~2+h~4).数值实验验证了该格式的有效性和可靠性.     

关于色散方程的具有高稳定性的显式差分格式

本文对色散方程u_t=au_(xxx)构造了显式差分格式J_4,其截断误差和稳定条件分别为O(τ+ h~2)和|r|≤4.0884,稳定性比[1]的结果|r|≤0.7016和[2]的结果|r|≤1.1851有很大改进,而且格式的形式也比[2]的格式简单得多.     

抛物型积分微分方程新混合元格式的超逼近分析

基于双二次元及其梯度空间,建立了抛物型积分微分方程的一种新混合有限元逼近格式.在不需要Ritz-Volterra投影的前提下,直接利用双二次元插值的高精度结果及关于时间变量的导数转移技巧,在半离散格式下,得到了原始变量u和中间变量p=▽u+integral from n=0 to t▽u(s)ds分别关于H~1模和L~2模的O(h~4)阶超逼近结果,相比插值误差估计,提高了二阶精度.与此同时,对向后Euler格式,导出了u和p分别在H~1模与L~2模意义下的O(h~4+τ)阶超逼近;对Crank-Nicolson-Galerkin格式,在L~2模意义下证明了u和p分别具有O(h~4+τ~2)和O(h~3+τ~2)阶的超逼近性质.其中,h,τ分别表示空间剖分参数和时间步长,t代表时间变量.     

黏弹性方程的Wilson元收敛性分析

对一类黏弹性方程利用Wilson元提出新的半离散和全离散逼近格式.基于单元的性质,通过定义新的双线性型,在不需要外推和插值后处理技术的前提下,分别得到了比传统的H~1-范数更大的模意义下相应的O(h~2)阶和O(h~2+τ~2)阶的误差分析结果,正好比通常的关于Wilson元的误差估计高出一阶.这里,h,τ表示空间剖分参数和时间步长.     

一类非线性延迟抛物偏微分方程的紧致差分格式

对于一类带有Dirichlet边界条件的延迟非线性抛物型偏微分方程的初边值问题建立了一个紧差分格式,用能量分析法证明该差分格式在L_∞范数下是无条件收敛的,且收敛阶为O(τ~2+h~4).最后,通过数值算例验证了理论结果.     

一类半线性变系数抛物型方程的紧差分格式

对一类半线性变系数抛物型方程初边值问题建立了紧差分格式,用能量分析方法证明了差分格式解的存在唯一性、关于初值的无条件稳定性和在L_∞范数下阶数为O(τ~2+h~4)的收敛性,最后给出的数值算例验证了理论结果.     

Four-class skew-symmetric association schemes

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we investigate 4-class skew-symmetric association schemes. In recent work by the first author it was discovered that their character tables fall into three types. We now determine their intersection matrices. We then determine the character tables for 4-class skew-symmetric pseudocyclic association schemes, the only known examples of which are cyclotomic schemes. As a result, we answer a question raised by S.Y. Song in 1996. We characterize and classify 4-class imprimitive skew-symmetric association schemes. We also prove that none of 2-class Johnson schemes admits a 4-class skew-symmetric fission scheme. Based on three types of character tables above, a short list of feasible parameters is generated.     

线性传输方程的几种数值格式的比较

本文研究了线性传输方程的数值计算问题.利用Godunov格式、Entropy格式、Ultra-bee格式和Entropy-Ultra-bee格式对线性传输方程进行了数值计算,获得了相应的数值结果.数值实验结果表明Entropy-Ultra-bee格式结合了Entropy格式和Ultra-bee格式的优点,在整个计算区域都有比较高的分辨率,而且没有出现非物理振荡.     

A category of association schemes

We define a category of association schemes and investigate its basic properties. We characterize monomorphisms and epimorphisms in our category. The category is not balanced. The category has kernels, cokernels, and epimorphic images. The category is not an exact category, but we consider exact sequences. Finally, we consider a full subcategory of our category and show that it is equivalent to the category of finite groups.     

A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes

As a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme from a pseudo-cyclic association scheme, Discrete Math. 285(1–3) (2004) 307–311], we show a construction of amorphous association scheme which is a fusion scheme of a direct product of two pseudo-cyclic association schemes with same first eigenmatrix. By using this construction, we can get at most three amorphous association scheme. We prove that if two pseudo-cyclic association scheme are non-isomorphic, then these three amorphous association schemes are mutually non-isomorphic.     

激波捕捉差分方法研究

在迎风型格式和矢通量分裂技术的基础之上,对捕捉激波方法进行一种新的尝试．该方法首先对原始格式在特征方向上进行投影,然后用限制器对这些特征分量的变化幅值进行限制以抑止非物理波动,最后再把它转换成守恒形式,得到了基本上无振荡的激波捕捉格式．用该方法对两种迎风显示格式(二阶和三阶)和3种迎风紧致格式(三阶、五阶和七阶)进行处理,并在一维和二维的情况下进行了应用测试．通过与高阶WENO、MP、Compact-WENO等格式的比较,表明该方法在光滑捕捉激波的前提下仍有较高精度和分辨率．     

一类TVD型的迎风紧致差分格式

给出一种迎风型TVD(total variation diminishing)格式的构造方法,该方法通过限制器来抑制线性紧致格式在模拟间断流场时的非物理波动,可构造出非线性TVD型紧致格式(CTVD)．然后采用该法构造出了3阶和5阶的TVD型紧致格式,并通过模拟一维组合波和Riemann问题,二维激波-涡相互干扰和激波-边界层相互作用等来考察它们的性能．数值实验表明了该类格式的高阶精度和分辨率,且过间断基本无振荡．     

Quot Functors for Deligne-Mumford Stacks

Abstract

Given a separated and locally finitely-presented Deligne-Mumford stack 𝒳 over an algebraic space S, and a locally finitely-presented 𝒪_𝒳-module ?, we prove that the Quot functor Quot(?/𝒳/S) is represented by a separated and locally finitely-presented algebraic space over S. Under additional hypotheses, we prove that the connected components of Quot(?/𝒳/S) are quasi-projective over S.     

Ideal ramp schemes and related combinatorial objects

In 1996, Jackson and Martin (Jackson and Martin, 1996) proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are not strong. Here we show the equivalence of ideal ramp schemes to a new variant of orthogonal arrays that we term augmented orthogonal arrays. We give some constructions for these new kinds of arrays, and, as a consequence, we also provide parameter situations where ideal ramp schemes exist but strong ideal ramp schemes do not exist.     

Distance-Regular Graphs of Valency 6 and a1 = 1

We give a complete classification of distance-regular graphs of valency 6 and a₁ = 1.