Dirac函数在剪切弯曲问题中的应用

<正> 一、问题的提出弯曲问题常常需要解决如下两个互逆问题:(一)已知梁的载荷分布,求剪力Q(x),弯矩M(x),转角θ(x)及挠度y(x);(二)当梁的挠曲线方程已知时,求其载荷分布。问题(一)可用积分法、初参数法来解决。问题(二),当挠曲线方程是分段给出时,现尚     

由H\"{o}rmander向量场构成的抛物方程的 $W_{\ast}^{1,p}$ 正则性

设 $X_{1},\cdots ,X_{q}\ (q相似文献   

逼近已知函数微商的广义Lanczos算法

给出逼近已知函数微商的广义Lanczos 算法, 构造了一列逼近算子$D_{h}^{n}$以提高稳定近似解的收敛速率. 当$n=2$时, 逼近精度达到$O(\delta^{6 \over 7})$, 而对一般的自然数$n$逼近精度为$O(\delta^{\frac{2n+2}{2n+3}})$, 这里$\delta$是近似函数的误差界.     

依概率收敛与依分布收敛的关系

本文探讨了随机变量序列依概率收敛与依分布收敛的关系 ,并给出了一个依分布收敛能保证依概率收敛的最弱的条件 ,即 :设分布函数列 { Fn(x) }弱收敛于连续的分布函数 F(x) ,则存在随机变量序列{ξn}和随机变量ξ,它们分别以 { Fn(x) }和 F(x)为其对应的分布函数列和分布函数 ,且 {ξn}依概率收敛于ξ.     

非线性时滞差分方程的振动性

考虑非线性时滞差分方程x_{n+1}-x_n+p_nf(x_{n-l_1},x_{n-l_2}x_{n-l_m})=0, n=0,1,2, 获得了方程所有解振动的充分条件, 推广并改进了现有文献中的结果.     

数形结合巧解绝对值方程

定理对于方程|x-a|+|x-b|=c,(1)当|x-a|+|x-b|<|a-b|时,方程无解.(2)当|x-a\+|x-b|=|a-b|时,方程的解为min{a,b}≤x≤max{a,b}.(max{a,b)表示a、b中较大的数,min{a,b}表示a、b中较小的数)(3)当|x-a|+|x-b|>|a-b|时,方程     

多项式函数的极值点与拐点判别及个数公式

本文讨论了多项式函数(x-a)~n,(x-a)~ng(x)(n∈N,n1,a∈R)和∏ki=1(x-a_i)~(n_i)(n_i∈N,n_i0,a_i∈R)的极值点和拐点,并给出了函数∏ki=1(x-a~i)~(n_i)(n_i∈N,n_i0,a_i∈R)所有极值点和拐点的个数公式.     

函数与方程思想在等差数列中的运用

我们知道{an}是等差数列时,an=a1 (n .当d≠0时,an是n的一次函数(n∈三N*),Sn是n的二次函数,且不含常数项(n∈N*). 根据等差数列的定义,容易得到它的几个等价命题: {an}为等差数列d为常数) an=an b(a、b为常数) Sn=an2 bn(a、b为常数). 由此可见,等差数列中的通项及求和问题,与函数、方程知识有着密切关系.下面举例     

强平稳\rho-混合序列的精确渐近性

研究了强平稳\rho-混合序列部分和S_{n}=X_{1}+X_{2}+...+X_{n}的精确渐近性:即当\varepsilon\searrow 0时,概率级数\sum\limits_{n=1}^{\infty}\varphi(n)P(|S_{n}|\geq \varepsilon H(n))的极限行为和收敛速度,并揭示了函数\varphi(n)$与$H(n)之间的关系.     

一类非线性时滞差分方程的全局吸引性

研究非线性时滞差分方程△xn anxn f(n,0√s=-k^-qs,nxs n）＝0，给出保证方程每一解{xn}趋于0的一族充分条件，推广并改进了已有的结果。     

A Double Recursion for Calculating Moments of the Truncated Normal Distribution and its Connection to Change Detection

Methodology and Computing in Applied Probability - The integral ${\int }_{0}^{\infty }x^{m} e^{-\frac {1}{2}(x-a)^{2}}dx$ appears in likelihood ratios used to detect a change in the parameters of a...     

The Solvability Conditions for the Inverse Problem of Matrices Positive Semidefinite on a Subspace

Inverseproblemsforrealsymmetricmatricesandsymmetricnonnegativedefinitematriceshavebeenstudiedin[1],[2].Theconditionsfortheexistenceofasolutiontheexpressionofthegeneralsolutionandoptimalapproximatesolutionhavebeengiven.Thispaperstudiestheinverseproblemofonekindofmatricesbetweentheabovetwokindsofmatrices-matricespositivesemidefiniteonasubspace.Theconditionsfortheexistenceofasolution,theexpressionofthegeneralsolutionandtheoptimalapproximatesolutionaregiven'Inthispaper9Rnxmdenotesthesetofallrealn…     

Modified Shape Functions for Specht's Plate Bending Element

1.IntroductionThesolutionoftheC'-continuityrequlrementofKirchhoffbendingwithfiniteele-mentmodelsresult8incomplicatedhigher.l...nt.I2J'[4'I7].Besidesthelargenumberofunknowns,difficultiesmayalsoarisefrommiredsecondderiVativesattheverticestakenasnodalvari.bl.I8l.Toovercomesuchdifficulties,asplittingsplineelemelltmethodisintrod.cedl5j'l9],butthisalwayscausescomplicatedcomputation-nomthepracticalpoilitofviewlower-degreepolynomialfiniteelemelitsaremoredesirable.Unfortunately,thesimpleelementsbase…     

Two families of approximations for the gamma function

In this paper, we establish two families of approximations for the gamma function: $$ \begin{array}{lll} {\varGamma}(x+1)&=\sqrt{2\pi x}{\left({\frac{x+a}{{\mathrm{e}}}}\right)}^x {\left({\frac{x+a}{x-a}}\right)}^{-\frac{x}{2}+\frac{1}{4}} {\left({\frac{x+b}{x-b}}\right)}^{\sum\limits_{k=0}^m\frac{{\beta}_k}{x^{2k}}+O{{\left(\frac{1}{x^{2m+2}}\right)}}},\\ {\varGamma}(x+1)&=\sqrt{2\pi x}\cdot(x+a)^{\frac{x}{2}+\frac{1}{4}}(x-a)^{\frac{x}{2}-\frac{1}{4}} {\left({\frac{x-1}{x+1}}\right)}^{\frac{x^2}{2}}\\ &\quad\times {\left({\frac{x-c}{x+c}}\right)}^{\sum\limits_{k=0}^m\frac{{\gamma}_k}{x^{2k}}+O{\left({\frac{1}{x^{2m+2}}}\right)}}, \end{array}$$ where the constants ${\beta }_k$ and ${\gamma }_k$ can be determined by recurrences, and $a$ , $b$ , $c$ are parameters. Numerical comparison shows that our results are more accurate than Stieltjes, Luschny and Nemes’ formulae, which, to our knowledge, are better than other approximations in the literature.     

截断和随机乘积的渐近性质

对一列独立同分布平方可积的随机变量序列{Xn,n≥1},当随机变量的分布具有中尾分布时,讨论了其截断和Tn(a)的随机乘积的渐近正态性质,其中Tn(a)=Sn-Sn(a),n=1,2,…,Sn(a)=n∑ j=1 XjI{Mn-a＜Xj≤Mn},a为某一大于零的常数'Mn=max 1≤k≤n{Xk}.     

Transformations z(t) = L(t)y(ϕ(t)) of ordinary differential equations

The paper describes the general form of an ordinary differential equation of an order n + 1 (n ≥ 1) which allows a nontrivial global transformation consisting of the change of the independent variable and of a nonvanishing factor. A result given by J. Aczél is generalized. A functional equation of the form $f\left( {s,w_{00} \upsilon _0 ,...,\sum\limits_{j = 0}^n {w_{nj\upsilon _j } } } \right) = \sum\limits_{j = 0}^n {w_{n + 1j\upsilon j} + w_{n + 1n + 1} f\left( {x,\upsilon ,\upsilon _1 ,...,\upsilon _n } \right),}$ where $w_{n + 10} = h\left( {s,x,x_1 ,u,u_1 ,...,u_n } \right),w_{n + 11} = g\left( {s,x,x_1 ,...,x_n ,u,u_1 ,...,u_n } \right){\text{ and }}w_{ij} = a_{ij} \left( {x_i ,...,x_{i - j + 1} ,u,u_1 ,...,u_{i - j} } \right)$ for the given functions a _ij is solved on $\mathbb{R},u \ne {\text{0}}$ .     

Asymptotic Distributions of Zeros of Quadratic Hermite–Pade Polynomials Associated with the Exponential Function

The asymptotic distributions of zeros of the quadratic Hermite--Pad\'{e} polynomials $p_{n},q_{n},r_{n}\in{\cal P}_{n}$ associated with the exponential function are studied for $n\rightarrow\infty$. The polynomials are defined by the relation $$(*)\qquad p_{n}(z)+q_{n}(z)e^{z}+r_{n}(z)e^{2z}=O(z^{3n+2})\qquad\mbox{as} \quad z\rightarrow0,$$ and they form the basis for quadratic Hermite--Pad\'{e} approximants to $e^{z}$. In order to achieve a differentiated picture of the asymptotic behavior of the zeros, the independent variable $z$ is rescaled in such a way that all zeros of the polynomials $p_{n},q_{n},r_{n}$ have finite cluster points as $n\rightarrow\infty$. The asymptotic relations, which are proved, have a precision that is high enough to distinguish the positions of individual zeros. In addition to the zeros of the polynomials $p_{n},q_{n},r_{n}$, also the zeros of the remainder term of (*) are studied. The investigations complement asymptotic results obtained in [17].     

A general framework for the polynomiality property of the structure coefficients of double-class algebras

In this paper, we build a general framework in which we give a formula that shows the form of the structure coefficients of double-class algebras and centers of group algebras. This formula allows us to give a polynomiality property for the structure coefficients of some important algebras. In particular, we re-obtain the polynomiality property of the structure coefficients in the cases of the center of the symmetric group algebra and the Hecke algebra of the pair \((\mathcal {S}_{2n},\mathcal {B}_{n}).\) We also assign a new polynomiality property for the structure coefficients of the center of the hyperoctahedral group algebra and the Hecke algebra of the pair \((\mathcal {S}_n\times \mathcal {S}_{n-1}^\mathrm{opp},{{\mathrm{diag}}}(\mathcal {S}_{n-1}))\).     

矩阵环中的一类极大的广义的Armendariz子环

An associative ring with identity R is called Armendariz if, whenever （∑^m i=0^aix^i）（∑^n j=0^bjx^j）=0 in R[x],aibj=0 for all i and j. An associative ring with identity is called reduced if it has no non-zero nilpotent elements. In this paper, we define a general reduced ring （with or without identity） and a general Armendariz ring （with or without identity）, and identify a class of maximal general Armendariz subrings of matrix rings over general reduced rings.     

On Factorisations and Generators in Transformation Semigroups

It is shown that the classical decomposition of permutations into disjoint cycles can be extended to more general mappings by means of path-cycles, and an algorithm is given to obtain the decomposition. The device is used to obtain information about generating sets for the semigroup of all singular selfmaps of $X_{n} = \{1, 2, \dots, n\}$. Let $T_{n,r} = S_{n}\cup K_{n,r}$, where $S_{n}$ is the symmetric group and $K_{n,r}$ is the set of maps $\alpha\,:\, X_{n} \to X_{n}$ such that $|im(\alpha)| \le r$. The smallest number of elements of $K_{n,r}$ which, together with $S_{n}$, generate $T_{n,r}$ is $p_{r}(n)$, the number of partitions of $n$ with $r$ terms.