一道分式不等式的进一步改进及简证

文［１］、［２］、［３］分别对下面的不等式进行了证明和改进．本文将作进一步的改进,并给出一个相当简洁的证明．设ｘｉ∈（０,１）,ｉ＝１,２,…,ｎ,且∑ｎｉ＝１ｘｉ＝ａ,∑ｎｉ＝１ｘ２ｉ＝ｂ,求证：∑ｎｉ＝１ｘ３ｉ１－ｘｉ≥ａ２＋ａｂ－ｎｂｎ－ａ．改...     

混合序列加权和的强收敛性

本文给出混合序列加权和的强收敛性的一些充分条件，这些结论推广和改进了文［１］定理３，文［２］定理３；文［３］定理４．１５以及文［４］定理４．     

Banach空间中微分方程的渐近平衡性

该文考虑微分方程组的渐近平衡性，这里ｆ１（ｔ，ｘ，ｙ）满足非紧性条件，ｆ２满足耗散型条件．其中的推论１．１去掉了文［１］中的一致连续性条件，改进和推广了文［１］的结果．     

相依序列加权和的收敛性

本文在相依序列下考虑加权和的ａ．ｓ．收敛性和完全收敛性．所得结论推广并改进了［１］、［２］中有关结论．     

乘子猜想在n=5n_1时的一些结果

用［１］中的方法，我们得到乘子猜想在ｎ＝５ｎ１情形时的一些新结果，对此情形下的ＭａｃＦａｒｌａｎｄ的结论（见［２］）作了较大的改进．     

求反三角函数值方法的再改进

形如ａｒｃｓｉｎ（ｓｉｎｘ）（ｘ∈Ｒ）的一类式子的求值问题已有一些文章提到了它们的重要性，并讨论了解答这些问题的公式和方法，如文［１］就给出了八个公式．但正如文［２］指出的那样，文［１］给出的八个公式太繁琐，不容易付诸教学和应用．文［２］也给出了改进...     

Kloosterman和的角度

有限域 Ｆｑ（ｑ为奇）上的 Ｋｌｏｏｓｔｅｒｍａｎ和是两个模为 ｑ１／２的共轭复数之和．这个复数的角度就称为相应的Ｋｌｏｏｓｔｅｒｍａｎ和的角度．我们在本文给出了Ｋｌｏｏｓｔｅｒｍａｎ和的角度的一些结果,改进了Ｋａｔｚ Ｎ．［１］的一些结果,也改进和推广了Ｃｏｎｒｅｙ　Ｊ．和Ｉｗａｎｉｅ Ｈ．［２］的结果．     

广义三次Hermite样条插值及其对振荡函数的积分等的数值逼近

本文在等距分划上引入在似于文［１］的Ｉ型广义Ｈｅｒｍｌｉｅ样条插值，改进了Ⅱ型广义Ｈｅｒｍｉｔｅ样条．与文［１］比较，我们证明了改进后的Ⅱ型广义Ｈｅｒｍｉｔｅ样条插值的逼近精度得到了充分的提高．并利用这二种样条插值，讨论了对振荡积分，有限Ｆｏｕｒｉｅｒ积分等的数值逼近．     

关于Hille-Yosida条件的等价刻画

本文得到了算子半群理论中的Ｈｉｌｅ－Ｙｏｓｉｄａ条件［１－５］的等价刻画，同时对Ａｒｅａｄｔ与Ｋｅｌｅｒｍａｎｎ的结果［４］作了相应的改进．     

有理样条不可约解的行列式表示

１引言在文［１］中,对于剖分ａ＝ｘ０＜ｘ１＜…＜ｍｎ＝ｂ及给定的ｙ０,ｙ１,…,　…,Ｌ＋Ｍ－１,我们构造了有理样条Ｓ［Ｌ,Ｍ（ｘ）Ｑ［Ｌ,Ｍ］为次数不超过ｍ的多项式全体．在［１］中,已经讨论了Ｓ［Ｌ,Ｍ］（ｘ）的存在性,并指出：若问题（１）（２）（３）可解,则解唯一这里总假设问题（１）（２）（３）可解．２有理样条解不可约的充要条件由Ｓ［Ｌ,Ｍ］（ｘ）的依区间递推算法（见［１］）,我们只需讨论［ｘ０,ｘ１］上的情形．当［Ｘ０,ｘ１］时,将Ｓ［Ｌ,Ｍ］　（ｘ）,Ｐ［Ｌ,Ｍ］　（ｘ）和Ｑ［Ｌ,Ｍ］（…     

A note on construction of upper bound graphs

In this paper, we consider construction of upper bound graphs. An upper bound graph can be transformed into a nova by contractions and a nova can be transformed into an upper bound graph by splits. These results include a characterization on upper bound graphs.     

Error bounds for spatial discretization and waveform relaxation applied to parabolic functional differential equations

The process of semi-discretization and waveform relaxation are applied to general nonlinear parabolic functional differential equations. Two new theorems are presented, which extend and improve some of the classical results. The first of these theorems gives an upper bound for the norm of the error of finite difference semi-discretization. This upper bound is sharper than the classical error bound. The second of these theorems gives an upper bound for the norm of the error, which is caused by both semi-discretization and waveform relaxation. The focus in the paper is on estimating this error directly without using the upper bound for the error, which is caused by the process of semi-discretization and the upper bound for the error, which is caused by the waveform relaxation method. Such estimating gives sharper error bound than the bound, which is obtained by estimating both errors separately.     

Estimates of the rate of convergence of a dynamic reconstruction algorithm under incomplete information about the phase state

In this paper, we study a dynamic reconstruction algorithm which reconstructs the unknown unbounded input and all unobservable phase coordinates from the results of measurements of part of the coordinates. An upper and a lower bound for the accuracy of the reconstruction is obtained. We determine the class of inputs for which the upper bound is uniform. We give a condition for optimally matching the algorithm parameters, ensuring the highest order of the upper bound and equating the orders of the upper and lower bounds. Thus, we establish the sharpness of the upper bound.     

On field extensions given by periods of Drinfeld modules

In this short note, we answer a question raised by M. Papikian on a universal upper bound for the degree of the extension of $$K_\infty $$ given by adjoining the periods of a Drinfeld module of rank 2. We show that contrary to the rank 1 case such a universal upper bound does not exist, and the proof generalies to higher rank. Moreover, we give an upper and lower bound for the extension degree depending on the valuations of the defining coefficients of the Drinfeld module. In particular, the lower bound shows the non-existence of a universal upper bound.     

An upper bound for the number of matroids

An upper bound for the number of matroids is obtained. This upper bound complements the lower bound obtained by Piff and Welsh in [1].     

Maximal amplitudes of hyperelliptic solutions of the derivative nonlinear Schrödinger equation

A simple formula is proven for an upper bound for amplitudes of hyperelliptic (finite-gap or N-phase) solutions of the derivative nonlinear Schrödinger equation. The upper bound is sharp, viz, it is attained for some initial conditions. The method used to prove the upper bound is the same method, with necessary modifications, used to prove the corresponding bound for solutions of the focusing NLS equation (Wright OC, III. Sharp upper bound for amplitudes of hyperelliptic solutions of the focusing nonlinear Schrödinger equation. Nonlinearity. 2019;32:1929-1966).     

相关随机利率下的双二项模型的破产概率

研究带有相关随机利率的双二项风险模型,得到了破产概率的积分表达式,并利用鞅分析的方法得到了破产概率的经典Lundberg上界,另外给出了一个破产概率的比经典Lundberg上界更精确的上界.     

Upper bound and stability of scaled pseudoinverses

Summary. For given matrices and where is positive definite diagonal, a weighed pseudoinverse of is defined by and an oblique projection of is defined by . When is of full column rank, Stewart [3] and O'Leary [2] found sharp upper bound of oblique projections which is independent of , and an upper bound of weighed pseudoinverse by using the bound of . In this paper we discuss the sharp upper bound of over a set of positive diagonal matrices which does not depend on the upper bound of , and the stability of over . Received September 29, 1993 / Revised version received October 31, 1994     

A new upper bound for unconstrained two-dimensional cutting and packing

A new upper bound for the unconstrained two-dimensional cutting or packing problem is proposed in this paper. The proposed upper bound can be calculated for any size of plate by solving just two knapsack problems at the beginning of the algorithm. In this research, the proposed upper bound was applied to the well known exact cutting algorithm, although it can be used for both cutting and packing applications. The experimental results demonstrate that the new upper bound is very efficient, and reduces the search time required to find an optimal solution.     

A strengthened Barvinok-Pataki bound on SDP rank

The Barvinok-Pataki bound provides an upper bound on the rank of extreme points of a spectrahedron. This bound depends solely on the number of affine constraints of the problem, i.e., on the algebra of the problem. Specifically, the triangular number of the rank r is upper bounded by the number of affine constraints. We revisit this bound and provide a strengthened upper bound on the rank using the singularity degree of the spectrahedron. Thus we bring in the geometry and stability of the spectrahedron, i.e., increased instability as seen by higher singularity degree, yields a lower, strengthened rank bound.