一类微分方程的解和小函数的关系

研究二阶线性微分方程 f'+e^az f'+h(z)e^bz f =0 的解以及它们的一阶、二阶、三阶导数, 微分多项式取小函数的点的收敛指数, 其中a, b 是非零复常数且a =cb(c>1), h(z)是非零多项式.     

正则型控制系统的全局反馈镇定

在对非线性控制系统全局镇定的研究中 ,Byrness,Isidori讨论了光滑非线性系统的光滑反馈与全局正则型的等价条件 ;Kokotovic,Sussmann则在讨论了全局镇定的正实条件后 ,得到了一个判定系统为全局光滑可镇定的重要条件 .本文则考察一类正则型控制系统 ,通过变换系统和构造全局反馈镇定律的方法 ,得到全局光滑镇定     

一类全局优化问题的区间斜率算法

考虑下面的全局优化问题: global minimize f(x),f:X~0 R~1→R~1 (1)其中X~0=[a~0,b~0],f是X~0上连续的多峰函数.在本文中f在X~0上的全局极小值记为f~*,f在X~0上所有全局极小点集合记为X~*.以下恒假定X~*仅由有限个点组成. 我们的目标是求f~*及X~*.求解这一问题已有诸多方法,这些方法一般可分为确定型和非确定型两类.前者以Lipschitz导数法,填充函数法等为代表,它们依据某一     

全局拓扑线性化理论的推广

微分方程dx/dt=Ax+f(x)(其中A的特征根实部异于零)拓扑线性化的经典结论是由Hartman与Grobman给出的,但是他们的结论都是局部拓扑线性化,即要求同胚函数限制在原点的小邻域内.如果要延伸到全局上的话,必须f(x)有界.本文研究了系统(1.3),证明当此系统满足适当的条件时可全局线性化.     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

一类微分方程零解全局弱吸引和全局吸引到充要条件

考虑二阶微分方程 x =φ(y)-F(x),y=- g(x)q(y) 零解的全局弱吸引和全局吸引性, 说明了Filippov条件(A₂) 不能排除最大椭圆扇形S^* 的存在性, 也不能排除∂S^* 作为其外侧邻域轨线正向极限集的可能. 全面回答了文献[8]末提出的问题;得到了方程(E)满足或不满足Filippov 条件时零解全局弱吸引和全局吸引的一系列充分必要条件, 同时也得到了零解全局渐近稳定的一些新条件.     

具有三对特殊方向的一类平面齐五次系统的全局拓扑结构

研究了一类平面齐五次系统dxdxdt=a50x5+a41x4y+a32x3y2+a23x2y3+a14xy4+a05y5,dydt=b50x5+b41x4y+b32x3y2+b23x2y3+b14xy4+b05y5当其只有唯一的有限远奇点且具有三对特殊方向时的全局拓扑结构及系数条件.假设系统只有唯一的有限远奇点(0,0),不妨设b50=0,其特殊方向由示性方程G(θ)=0给出,引进poincare变换研究无穷远奇点,再根据定理中的系数条件,列出系统所有可能的无穷远奇点和特殊方向,并判断其类型,由此画出系统具有三对特殊方向时的全局相图.     

参系数零维分片代数簇的实零点

分片代数簇是一些多元样条函数的公共零点集. 文中表明: 解参系数分片代数簇问题可转化为解有限个包含严格不等式的参系数多项式系统. 利用半代数系统的正则分解和柱形代数分解方法, 提出了计算零维参系数分片代数簇无挠实零点数的上确界, 以及达到上确界时实零点在各个胞腔内的数目分布情形的算法. 该算法同时能产生达到上确界的充要条件, 以及达到上确界时实零点数在各个$n$维胞腔内 取得某种分布的充要条件. 也给出了另一算法, 用于产生零维分片代数簇在$n$维复形中的 各个$n$维胞腔内恰有指定数目的相异无挠实零点的充分必要条件.     

奇异特征值问题正解的全局结构

本文研究了奇异二阶微分方程特征值问题{y"(t)+μh(t)f(y(t))=0,0＜t＜1,αy(0)-βy'(0)=0,γy(1)+δy'(1)=0,其中α,γ＞0,β,δ≥0,h∈C((0,1),(0,+∞))且h在t=0和/或t=1处可能有奇性,f∈C([0,+∞),(0,+∞)),f(0)＞0和f∞=limf(s)/s=+∞.利用全局连续性定理、解的上下界和不动点指数相结合,给出了方程正解的存在性,多重性和不存在性,同时讨论了参数变化时解的变化趋势.     

高阶非线性差分方程的全局吸引性

研究了差分方程 xn 1 =a - bxn- k A - xn( a≥ 0 ,A≥ b≥ 0 )的全局稳定性和正解的周期性质 .证明了方程的一个正平衡点是一个全局吸引子 ,并给出了相应的吸引域     

Algorithms for computing the global infimum and minimum of a polynomial function

By catching the so-called strictly critical points,this paper presents an effective algorithm for computing the global infimum of a polynomial function.For a multivariate real polynomial f ,the algorithm in this paper is able to decide whether or not the global infimum of f is finite.In the case of f having a finite infimum,the global infimum of f can be accurately coded in the Interval Representation.Another usage of our algorithm to decide whether or not the infimum of f is attained when the global infimum of f is finite.In the design of our algorithm,Wu’s well-known method plays an important role.     

Global minimization of multivariate polynomials using nonstandard methods

The purpose of this paper is to present two algorithms for global minimization of multivariate polynomials. For a multivariate real polynomial f, we provide an effective algorithm for deciding whether or not the infimum of f is finite. In the case of f having a finite infimum, the infimum of f can be accurately coded as (h; a, b), where h is a real polynomial in one variable, a and b is two rational numbers with a?<?b, and (h, a, b) stands for the only real root of h in the open interval ]a, b[. Moreover, another algorithm is provided to decide whether or not the infimum of f is attained when the infimum of f is finite. Our methods are called ??nonstandard??, because an infinitesimal element is introduced in our arguments.     

A note on homological properties of Nakayama algebras

Using the resolution quiver for a connected Nakayama algebra, a fast algorithm is given to decide whether its global dimension is finite or not and whether it is Gorenstein or not. The latter strengthens a result of Ringel.     

Global Minimization of a Multivariate Polynomial using Matrix Methods

The problem of minimizing a polynomial function in several variables over R ⁿ is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimal value and finds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm computes its infimum. No assumption is made on the polynomial.     

一类单中心二次可积系统的Abel积分零点个数

讨论了首次积分为H(x,y)=x~k(1/2y~2+Ax~2+Bx+C)的Abel积分的代数构造,并研究了k=2时具有一个中心的平面二次可积系统在n次扰动下的Abel积分零点个数上界问题,得到了较小的上界估计,     

带非卷积位相的粗糙核振荡奇异积分算子的加权L^p估计

文研究一类位相较多项式更一般的振荡奇异积分算子．在积分核Ω∈Llog^＋L（S^n-1）的条件下,建立了该类算子在加权Lp空间的有界性．     

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations

In this paper we present necessary conditions for global optimality for polynomial problems with box or bivalent constraints using separable polynomial relaxations. We achieve this by first deriving a numerically checkable characterization of global optimality for separable polynomial problems with box as well as bivalent constraints. Our necessary optimality conditions can be numerically checked by solving semi-definite programming problems. Then, by employing separable polynomial under-estimators, we establish sufficient conditions for global optimality for classes of polynomial optimization problems with box or bivalent constraints. We construct underestimators using the sum of squares convex (SOS-convex) polynomials of real algebraic geometry. An important feature of SOS-convexity that is generally not shared by the standard convexity is that whether a polynomial is SOS-convex or not can be checked by solving a semidefinite programming problem. We illustrate the versatility of our optimality conditions by simple numerical examples.     

Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs

We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fails to be attained, a difficulty that has been identified but not directly addressed in the literature. In this case, it yields a “better than fully polynomial time” approximation scheme with running time polynomial in the logarithm of the absolute precision. For the pure integer case where the leader’s variables are integer, and hence optimal solutions are guaranteed to exist, we present an algorithm which runs in polynomial time when the total number of variables is fixed.     

关于上密度无限制的缺项多项式加权逼近

令Ca为由在实轴R上连续且满足f(t)exp(-a(t))→0的函数f组成的Banach空间,其中a(t)为非负连续函数.在本文中,我们得到缺项的多项式在Ca中不完备的充分条件.本文的要点在于我们不要求上密度是有限的.     

A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative

In this paper we give an algorithm to compute a finite presentation for any finitely generated commutative cancellative monoid, and in particular we apply it to derive an algorithm to decide whether a finitely presented commutative monoid is cancellative or not.