排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
The Chow/Van der Waerden approach to algebraic cycles via resultants is used to give a purely algebraic proof for the algebraicity of the complex suspension. The algebraicity of the join pairing on Chow varieties then follows. The approach implies a more algebraic proof of Lawson's complex suspension theorem in characteristic 0. The continuity of the action of the linear isometries operad on the group completion of the stable Chow variety is a consequence.
2.
In the area of broad-band antenna array signal processing, the global minimum of a quadratic equality constrained quadratic cost minimization problem is often required. The problem posed is usually characterized by a large optimization space (around 50–90 tuples), a large number of linear equality constraints, and a few quadratic equality constraints each having very low rank quadratic constraint matrices. Two main difficulties arise in this class of problem. Firstly, the feasibility region is nonconvex and multiple local minima abound. This makes conventional numerical search techniques unattractive as they are unable to locate the global optimum consistently (unless a finite search area is specified). Secondly, the large optimization space makes the use of decision-method algorithms for the theory of the reals unattractive. This is because these algorithms involve the solution of the roots of univariate polynomials of order to the square of the optimization space. In this paper we present a new algorithm which exploits the structure of the constraints to reduce the optimization space to a more manageable size. The new algorithm relies on linear-algebra concepts, basic optimization theory, and a multivariate polynomial root-solving tool often used by decision-method algorithms.This research was supported by the Australian Research Council and the Corporative Research Centre for Broadband Telecommunications and Networking. 相似文献
3.
Karl Dilcher Kenneth B. Stolarsky 《Transactions of the American Mathematical Society》2005,357(3):965-981
We show that the resultants with respect to of certain linear forms in Chebyshev polynomials with argument are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-reciprocal quadrinomials.
4.
We define a class of “algebraic” random matrices. These are random matrices for which the Stieltjes transform of the limiting
eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner and Wishart
matrices whose limiting eigenvalue distributions are given by the semicircle law and the Marčenko–Pastur law are special cases.
Algebraicity of a random matrix sequence is shown to act as a certificate of the computability of the limiting eigenvalue
density function. The limiting moments of algebraic random matrix sequences, when they exist, are shown to satisfy a finite
depth linear recursion so that they may often be efficiently enumerated in closed form.
In this article, we develop the mathematics of the polynomial method which allows us to describe the class of algebraic matrices by its generators and map the constructive approach we employ
when proving algebraicity into a software implementation that is available for download in the form of the RMTool random matrix
“calculator” package. Our characterization of the closure of algebraic probability distributions under free additive and multiplicative
convolution operations allows us to simultaneously establish a framework for computational (noncommutative) “free probability”
theory. We hope that the tools developed allow researchers to finally harness the power of infinite random matrix theory. 相似文献
5.
6.
1