搜索结果: 151-165 共查到“理学 A-POLYNOMIAL”相关记录169条 . 查询时间(0.066 秒)
LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
Linear complexity over Z/(m) uniqueness
font style='font-size:12px;'>
2007/8/7
In this note we discuss the annihilating properties of sequences over Z/(m). By considering the linear complexity and the annihilator structure, we derive the uniqueness condition for the minimal poly...
A MECHANIZATION METHOD OF GEOMETRY AND ITS APPLICATIONS Ⅲ.MECHANICAL PROVING OF POLYNOMIAL INEQUALITIES AND EQUATION-SOLVING
font style='font-size:12px;'>
2007/8/7
This is the third paper of the series entitled “A mechanization method of geometryand its applications”, cf.[WU3—5]. In the present paper it is shown how inequalities can be proved by means of the aut...
Poincare equation: a new polynomial and its unusual properties
font style='font-size:12px;'>
2007/7/28
专著信息
书名
Poincare equation: a new polynomial and its unusual properties
语种
英文
撰写或编译
作者
Zhang K.,Liao. X
第一作者单位
出版社
J of Mathematical Physics, 45:4777-4790
出版地
出版日期
年
月
日
标准书号
介质类型
页数
字数
开本
相关项目
行星地球分层结...
The Abelian Integrals of a One-parameter Hamiltonian System under Polynomial Perturbations
font style='font-size:12px;'>
2007/7/28
期刊信息
篇名
The Abelian Integrals of a One-parameter Hamiltonian System under Polynomial Perturbations
语种
英文
撰写或编译
撰写
作者
张同华,陈文成
第一作者单位
山东科技大学
刊物名称
Inter. J. of Bifurcation and Chaos (SCI)
页面
2004, 14(7),...
Detecting Change Points in Polynomial Regression Models with an Application to Cable Data Sets
font style='font-size:12px;'>
2007/7/28
期刊信息
篇名
Detecting Change Points in Polynomial Regression Models with an Application to Cable Data Sets
语种
英文
撰写或编译
作者
汤银才,费鹤良
第一作者单位
刊物名称
Acta Mathematicae Applicatae Sinica, English Series
页面
Vol. 20...
An Interior-point Trust-region Polynomial Algorithm for Convex Programming
interior-point algorithm self-concordant barrier trust-region subproblem
font style='font-size:12px;'>
2012/8/1
An interior-point trust-region algorithm is proposed for minimization of a convex quadratic objective function over a general convex set. The algorithm uses a trust-region model to ensure descent on a...
On Cauchy's Bound for Zeros of a Polynomial
Zeros polynomials upper bound moduli refinement
font style='font-size:12px;'>
2010/2/26
In this note, we improve upon Cauchy's classical bound, and upon some recent bounds for the moduli of the zeros of a polynomial.
A Polynomial Time Algorithm to Find Rational General Solutions of First Order Autonomous ODEs
Rational general solution rst order autonomous ODE rational parameterizations Laurent series Pade approximants polynomial time algorithm
font style='font-size:12px;'>
2013/9/9
We give a necessary and su±cient condition for an algebraic ODE to have a rational type general solution. For a ˉrst order autonomous ODE F = 0, we give an exact degree bound for its rational solution...
UNIVARIATE ORE POLYNOMIAL RINGS IN COMPUTER ALGEBRA
UNIVARIATE POLYNOMIAL RINGS COMPUTER ALGEBRA
font style='font-size:12px;'>
2013/9/3
We present some algorithms related to rings of Ore polynomials (or, briefly, Ore rings) and describe a computer algebra library for basic operations in an arbitrary Ore ring. The library can be used a...
Integer Sequences associated with Integer Monic Polynomial
Integer Sequences Integer Monic Polynomial
font style='font-size:12px;'>
2010/10/29
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of...
Roots of any Polynomial with Complex Integer Coefficients using Replacement Sequences, Ruler and Compass
Roots Polynomial Complex Integer Coefficients Replacement Sequences
font style='font-size:12px;'>
2010/11/1
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. T...
Polynomial and rational solutions of holonomic systems
Polynomial rational solutions holonomic systems
font style='font-size:12px;'>
2010/10/29
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential oper...
Polynomial hulls and H-infinity control for a hypoconvex constraint
Polynomial hulls H-infinity control hypoconvex constraint
font style='font-size:12px;'>
2010/10/29
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall...
Symbolic computation of the roots of any polynomial with integer coefficients
Symbolic computation roots polynomial integer coefficients
font style='font-size:12px;'>
2010/11/1
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This ...
An inequality for the norm of a polynomial factor
norm polynomial factor
font style='font-size:12px;'>
2010/11/1
Let $p(z)$ be a monic polynomial of degree $n$, with complex coefficients, and let $q(z)$ be its monic factor. We prove an asymptotically sharp inequality of the form $\|q\|_{E} \le C^n \|p\|_E$, whe...