一类多项式系数二阶线性微分方程解法的研究

给出了一类具有多项式系数的二阶线性微分方程有多项式型特解和通解的充要条件,并在Maple下实现了这类微分方程具有多项式型特解和通解自动判定和求解的算法.     

分块平方和分解

本文定义了分块平方和可分解多项式的概念.粗略地说,它是这样一类多项式,只考虑其支撑集(不考虑系数)就可以把它的平方和分解问题等价地转换为较小规模的同类问题(换句话说,相应的半正定规划问题的矩阵可以分块对角化).本文证明了近年文献中提出的两类方法—分离多项式(split polynomial)和最小坐标投影(minimal coordinate projection)—都可以用分块平方和可分解多项式来描述,证明了分块平方和可分解多项式集在平方和多项式集中为零测集.     

利用半群代数中良序基构造解稀疏多项式方程组特征值方法

本文利用半群代数k[A]中良序基,构造了求稀疏多项式方程组解的特征值矩阵,并给出了可以构造方阵的条件.     

基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

五点二重融合型细分法

提出了一种新的细分算法——五点二重融合型细分法.利用生成多项式对该细分法的一致收敛性和C~k连续性进行了分析,通过对融合型细分法中参数的不同取值,可以分别生成C~1～C~6连续的极限曲线.数值实例表明,与现有一些格式相比,细分算法生成的极限曲线不仅可以保持较高光滑性,并且更接近初始控制多边形.     

一类融合逼近和插值的曲线细分

采用生成多项式为主的方法对一类融合逼近和插值三重细分格式的支撑区间、多项式生成、连续性、多项式再生及分形性质进行了分析,给出并证明了极限曲线C^k连续的充分条件.通过对融合型细分规则中参数变量的适当选择来实现对极限曲线的形状调整,从而衍生出具有良好性质的新格式,并将这类新格式与现有格式进行比较.数值实例表明这类新格式生成的极限曲线具有较好的保形性.     

一类带多项式约束的不确定凸优化问题的鲁棒可行性半径刻画

该文旨在刻画一类约束函数是带有不确定信息的凸多项式的不确定凸优化问题的鲁棒可行性半径的下界.首先借助鲁棒优化方法,引入了该不确定凸优化问题的鲁棒对等问题(Robust counterpart),并给出了其鲁棒可行性半径的定义.随后通过引入一类上图集和借助由不确定集所生成的Minkowski泛函,刻画了该不确定凸优化问题的鲁棒可行性半径的下界.进一步的,在不确定集是仿射不确定集以及约束函数是平方和凸多项式时,得到了该不确定优化问题的鲁棒可行性半径的一个精确公式,推广和改进了文献[10]的相应结果.     

求解互补问题的不可行内点法及其计算复杂性

给出了求解一类非单调非线性互补问题的一种不可行内点法,讨论了该算法的收敛性及计算复杂性.分析结果表明,所给方法是一多项式时间算法.     

指数多项式不等式的自动证明北大核心CSCD

讨论了指数多项式不等式的自动证明问题,运用Taylor展开式将目标不等式的证明转化为一系列的一元多项式不等式的验证,然后借助代数不等式证明工具(如Bottema)完成最后的工作.运用Maple实现了上述算法,算法对所有指数多项式不等式终止,并且可以输出"可读"的证明过程.     

关于厄米特多项式的新微分公式及其在量子光学中的应用

基于量子光学厄米特多项式和Weyl对应规则,该文给出了一类双变量厄米特多项式的生成函数.考虑到Weyl编序的相似变换不变性特征,还得到了另一个厄米特多项式广义生成函数,这些生成函数能被用于研究量子光场的非经典特征.     

Semidefinite programming and sums of hermitian squares of noncommutative polynomials

An algorithm for finding sums of hermitian squares decompositions for polynomials in noncommuting variables is presented. The algorithm is based on the “Newton chip method”, a noncommutative analog of the classical Newton polytope method, and semidefinite programming.     

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. Throughout the paper several examples are given illustrating the results.     

Newton Polytopes and Witness Sets

We present two algorithms that compute the Newton polytope of a polynomial f defining a hypersurface \({\mathcal{H}}\) in \({\mathbb{C}^n}\) using numerical computation. The first algorithm assumes that we may only compute values of f—this may occur if f is given as a straight-line program, as a determinant, or as an oracle. The second algorithm assumes that \({\mathcal{H}}\) is represented numerically via a witness set. That is, it computes the Newton polytope of \({\mathcal{H}}\) using only the ability to compute numerical representatives of its intersections with lines. Such witness set representations are readily obtained when \({\mathcal{H}}\) is the image of a map or is a discriminant. We use the second algorithm to compute a face of the Newton polytope of the Lüroth invariant, as well as its restriction to that face.     

A lifting and recombination algorithm for rational factorization of sparse polynomials

We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with a polynomial complexity in the volume of the Newton polytope. We adopt a geometrical point of view, the main tool being derived from some algebraic osculation criterion in toric varieties.     

Coloring,sparseness and girth

Using the classical analysis resolution of singularities algorithm of [G4], we generalize the theorems of [G3] on Rⁿ sublevel set volumes and oscillatory integrals with real phase function to functions over an arbitrary local field of characteristic zero. The p-adic cases of our results provide new estimates for exponential sums as well as new bounds on how often a function f(x), such as a polynomial with integer coefficients, is divisible by various powers of a prime p when x is an integer. Unlike many papers on such exponential sums and p-adic oscillatory integrals, we do not require the Newton polyhedron of the phase to be nondegenerate, but rather as in [G3] we have conditions on the maximum order of the zeroes of certain polynomials corresponding to the compact faces of this Newton polyhedron.     

There are significantly more nonegative polynomials than sums of squares

We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of even powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient dimension) of compact sections of the three cones. We show that the bounds are asymptotically exact if the degree is fixed and number of variables tends to infinity. When the degree is larger than two, it follows that there are significantly more nonnegative polynomials than sums of squares and there are significantly more sums of squares than sums of even powers of linear forms. Moreover, we quantify the exact discrepancy between the cones; from our bounds it follows that the discrepancy grows as the number of variables increases.     

Irreducibility of polynomials modulo p via Newton polytopes

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.     

A facial reduction algorithm for finding sparse SOS representations

The facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial [M. Kojima, S. Kim, H. Waki, Sparsity in sums of squares of polynomials, Math. Program. 103 (2005) 45-62] removes monomials which do not appear in any SOS representations. In this paper, we establish a relationship between a facial reduction algorithm and the elimination method for a sparse SOS polynomial.     

Generic exponential sums associated with polynomials of degree 3 in two variables

The generic Newton polygon of L-functions associated with the exponential sums of polynomials of degree 3 in two variables is studied by Dwork’s analytic methods. Wan’s conjecture is shown to be true for this case.