搜索结果: 1-15 共查到“数学 Polynomial”相关记录138条 . 查询时间(0.274 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:The Proper Basis for Zero-dimensional Polynomial Ideals
零维 多项式理想 正确基 Grobner基
2023/11/29
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:A New Framework for SIMD Bootstrapping in Polynomial Modulus
多项式 模数 SIMD自举 新框架
2023/4/28
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:On polynomial method and its application(III)
多项式方法 多项式划分 关联几何
2023/5/10
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:On polynomial method and its application(II)
多项式方法 应用 代数
2023/5/17
Jones polynomial and knot transitions in Hermitian and non-Hermitian topological semimetals
Hermitian Topological semimetal Junction Transition
2023/1/4
2018 Workshop on Expected Characteristic Polynomial Techniques and Applications
2018 Workshop Expected Characteristic Polynomial Techniques and Applications
2017/12/20
A central goal of the program is to further connections between problems in infinite and finite dimensioQLAWS1_imagenal linear algebra. This workshop will focus on the expected characteristic polynomi...
We define Ptolemy coordinates for representations that are not necessarily
boundary-unipotent. This gives rise to a new algorithm for computing the SL(2; C) Apolynomial, and more generally the ...
SMALL POLYNOMIAL MATRIX PRESENTATIONS OF NONNEGATIVE MATRICES
SMALL POLYNOMIAL MATRIX NONNEGATIVE MATRICES
2015/9/29
We investigate the use of polynomial matrices to give efficient presentations of nonnegative matrices exhibiting prescribed spectral and algebraic behavior.
It is well known that the real cohomology of a compact Riemannian manifold
M is isomorphic to the algebra of its harmonic forms. When M is a fiat
Riemannian manifold, i.e. a Euclidean manifold, a ...
Let K be an algebraically closed field of characteristic zero and let f ∈ K[x]. The m-th cyclic resultant of f is rm = Res(f, xm − 1). A generic monic polynomial is determined by its full sequen...
A polynomial-time algorithm for determining quadratic Lyapunov functions for nonlinear systems
Nonlinear systems quadratic lyapunov function and convex programming function
2015/8/12
We consider nonlinear systems dx/dt=f(x(t)) where Df(x(t)) is known to lie in the convex hull of L n times n matrices A_1,ldots,A_L. For such systems, quadratic Lyapunov functions can be determined us...
Polynomial level-set methods for nonlinear dynamical systems analysis
dynamical systems analysis level-set methods
2015/6/19
In this paper, we present a method for computing the domain of attraction for non-linear dynamical systems. We propose a level-set method where sets are represented as sublevel sets of polynomials. Th...
Decentralized Stochastic Decision Problems and Polynomial Optimization
Decision Problems Polynomial Optimization
2015/6/19
In this paper we consider the problem of computing decentralized control policies in a discrete stochastic decision problem. For the problem we consider, computation of optimal decentralized policies ...
A Polynomial Eigenproblem Approach for General Joint Block Diagonalization
general joint block diagonalization polynomial eigenproblem
2014/9/26
oint Block Diagonalization (JBD) of a given Hermitian matrix set A=fAi
g
p
i=0
is to nd
a nonsingular matrixWsuch that W
H
AiWfor i = 0;1;:::;pare all block diagonal matrices
with the same pr...
AVERAGES ALONG POLYNOMIAL SEQUENCES IN DISCRETE NILPOTENT GROUPS: SINGULAR RADON TRANSFORMS
AVERAGES ALONG POLYNOMIAL SEQUENCES DISCRETE NILPOTENT GROUPS SINGULAR RADON TRANSFORMS
2014/4/3
We consider a class of operators defined by taking averages along polynomial sequences in discrete nilpotent groups. As in the continuous case, one can consider discrete maximal Radon transforms...