渐近因子分离法及其在多项式求根中的应用

[1]提出了一种渐近分离多项式因子的方法,并考虑了在求根中的应用,但尚有许多问题没有解决,也没有给出实用的算法。其实Sebastiao,Silva早就提出过类似的方法。[1]和[2]都只考虑了f(x)没有重根的特殊情形,本文把渐近因子分离过程推广到任意f(x)的情形,并且给出了几种有实用价值的算法和两个实例。     

复样条及偶次(实)多项式样条的渐近展开

自 Ahlberg 等在1967年讨论复三次样条以来,有关复样条的讨论并不多。在[2]中给出了等距节点复样条的误差估计,但至今未见到关于复样条渐近展开的讨论。本文的主要目的是讨论渐近展开,给出复样条的逐项渐近展开。在证明过程中,很自然地导出复样条的误差估计,并改进了[2]中关于误差的估计,此外,我们的方法完全适用于实轴上实多项式样条,从而在本文中也给出实多项式样条的逐项渐近展开,所得的结果不仅大大改进了[4]中的结如,且把周期性的限制也去掉了,方法上也大大简化了。     

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

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

密切多项式与渐近多项式

我们对文献 [1 ]中的平面曲线的切线与渐近线之间的关系予以推广 ,得到密切多项式与渐近多项式之间的类似关系 .     

Morgan-Voyce多项式的一些新性质

本文证明了Morgan-Voyce多项式的零点在闭区间$[-4,0]$上是稠密的.本文也证明了Morgan-Voyce多项式系数的分布是渐近正态的,以及它的系数矩阵是全正的.     

ECT插值余项的表示及其应用

在多项式插值理论及样条逼近中,Hermite插值多项式余项的讨论是很重要的。在[1,2]中,给出了一系列Hermite插值多项式余项的表达式,特别是各阶导数余项的表达式。还运用这些表达式讨论了样条函数,给出其余项估计和渐近展开。 随着样条理论的发展,已经用其它函数系代替多项式组成了各种样条函数空间,其中最引人注目的是ECT样条。Pruess讨论的张力样条及C.A.Micchelli讨论的?-样     

Banach空间中具有数列的渐近拟非扩张型映象的不动点及其具有误差的Ishikawa迭代逼近

1引言及相关定义 引文[1～5]讨论了渐近非扩张映象和渐近非扩张型映象不动点的迭代逼近问题.文[6]改进了文[1]中条件,将T由渐近非扩张型映象推广到T是渐近拟非扩张型映象.     

亚纯函数微分多项式f~kQ[f]+P[f]的零点分布

文[4]对简单形式的微分多项式fkf’+a的零点分布进行了讨论,文[1]对一般形式的微分多项式fkQ[f]+P[f]的零点分布进行了讨论.但由于极点给证明带来的困难,这些工作主要是对整函数来做的.本文证明了任一满足δ(∞,f)>k+2ΓQ+3ΓP+2/2k+2ΓQ+1的超越亚纯函数f,微分多项式fkQ[f]+P[f]在不含f,Q[f]极点和P[f]零、极点的可数个圆盘并集之外有无穷多个零点,其中k≥3Γp+2,而ΓQ,ΓP分别是f的微分多项式Q[f],P[f]的权.文[1]和[2,4,6]中的结论是本文结论的特殊情况.     

关于多项式矩阵的快速除法

本文讨论了分块 T 型三角矩阵求逆和多项式矩阵除法的 O(k~2nlogn)快速算法,推广了文[3]的结果.     

“Eisenstein判别法的应用”一文的注记

文[1]对Eisenstein判别法的应用范围进行了讨论,对二次不可约多项式得到了非常完整的结果。对一般的n次整系数不可约多项式f(x)作变换x=y+k后能否用Eisenstein判别法来判定也作了一些有益的探讨. 文[1]同时提出了疑问,“是否对任何有理     

序列的一种无组合系数的根表示

本文在讨论了组合数C_x~k等在GF(q)上的多元多项式表示的基础上,给出了序列的一种避免组合系数的根表示法,并利用它对两个有重根的反馈多项式生成序列之积的线性复杂性进行了讨论.     

关于用Hermitfe插值逼近函数及其导数的点态估计

本文给出了以第一类Chebyshev多项式的零点为节点的Hermitfe插值多项式来逼近函数及其导数时的逼近阶的点态估计式,该结果回答了谢庭藩教授在文[4]中提出的问提.     

Galois groups of polynomials arising from circulant matrices

Circulant matrices are used to construct polynomials, associated with Chebyshev polynomials of the first kind, whose roots are real and made explicit. Then the Galois groups of the polynomials are computed, giving rise to new examples of polynomials with cyclic Galois groups and Galois groups of order p(p−1) that are generated by a cycle of length p and a cycle of length p−1.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

Gale duality bounds for roots of polynomials with nonnegative coefficients

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most d. For this, we interpret the basis polynomials as vector fields in the real plane, and at each point in the plane analyze the combinatorics of the Gale dual vector configuration. This approach permits us to incorporate arbitrary linear equations and inequalities among the coefficients in a unified manner to obtain more precise bounds on the location of roots. We apply our technique to bound the location of roots of Ehrhart and chromatic polynomials. Finally, we give an explanation for the clustering seen in plots of roots of random polynomials.     

Tchebyshev triangulations of stable simplicial complexes

We generalize the notion of the Tchebyshev transform of a graded poset to a triangulation of an arbitrary simplicial complex in such a way that, at the level of the associated F-polynomials j_∑fj−1(j(x−1)/2), the triangulation induces taking the Tchebyshev transform of the first kind. We also present a related multiset of simplicial complexes whose association induces taking the Tchebyshev transform of the second kind. Using the reverse implication of a theorem by Schelin we observe that the Tchebyshev transforms of Schur stable polynomials with real coefficients have interlaced real roots in the interval (−1,1), and present ways to construct simplicial complexes with Schur stable F-polynomials. We show that the order complex of a Boolean algebra is Schur stable. Using and expanding the recently discovered relation between the derivative polynomials for tangent and secant and the Tchebyshev polynomials we prove that the roots of the corresponding pairs of derivative polynomials are all pure imaginary, of modulus at most one, and interlaced.     

On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method

In this paper we explore two sets of polynomials, the orthogonal polynomials and the residual polynomials, associated with a preconditioned conjugate gradient iteration for the solution of the linear system Ax = b. In the context of preconditioning by the matrix C, we show that the roots of the orthogonal polynomials, also known as generalized Ritz values, are the eigenvalues of an orthogonal section of the matrix C A while the roots of the residual polynomials, also known as pseudo-Ritz values (or roots of kernel polynomials), are the reciprocals of the eigenvalues of an orthogonal section of the matrix (C A)^?1. When C A is selfadjoint positive definite, this distinction is minimal, but for the indefinite or nonselfadjoint case this distinction becomes important. We use these two sets of roots to form possibly nonconvex regions in the complex plane that describe the spectrum of C A.     

$R(G)\ge -1$的图族伴随多项式最小根极值的刻画

本文引入了图族伴随多项式的最小根极值,用它刻画了特征标不小于$-1$的图族伴随多项式的最小根极值,给出了其对应的极图, 并由此得到了一些有关这些图族伴随多项式最小根序关系的新结果.     

Stabilizer quantum codes defined by trace-depending polynomials

Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a constant plus the trace of a polynomial) and show that this procedure gives rise to stabilizer quantum error-correcting codes with a wider range of lengths than in [18] and with excellent parameters. Namely, we are able to provide new binary records according to [21] and non-binary codes improving the ones available in the literature.     

Real polynomial iterative roots in the case of nonmonotonicity height ≥ 2

It is known that a strictly piecewise monotone function with nonmonotonicity height ≥ 2 on a compact interval has no iterative roots of order greater than the number of forts. An open question is: Does it have iterative roots of order less than or equal to the number of forts? An answer was given recently in the case of "equal to". Since many theories of resultant and algebraic varieties can be applied to computation of polynomials, a special class of strictly piecewise monotone functions, in this paper we investigate the question in the case of "less than" for polynomials. For this purpose we extend the question from a compact interval to the whole real line and give a procedure of computation for real polynomial iterative roots. Applying the procedure together with the theory of discriminants, we find all real quartic polynomials of non-monotonicity height 2 which have quadratic polynomial iterative roots of order 2 and answer the question.