Results 21 to 30 of about 972,893 (286)
Computing Minimal Polynomials of Matrices [PDF]
LMS Journal of Computation and Mathematics, 2008 AbstractWe present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of ann × nmatrix over a finite field that requiresO(n3) field operations andO(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We
Max Neunhöffer, Cheryl E. Praeger
openaire +3 more sources
Relationships Between Generalized Bernoulli Numbers and Polynomials and Generalized Euler Numbers and Polynomials [PDF]
, 2002 In this paper, concepts of the generalized Bernoulli and Euler numbers and polynomials are introduced, and some relationships between them are ...
Qi, Feng, Luo, Qiu-Ming
core +6 more sources
Skew-orthogonal Laguerre polynomials for chiral real asymmetric random matrices [PDF]
, 2010 We apply the method of skew-orthogonal polynomials (SOP) in the complex plane to asymmetric random matrices with real elements, belonging to two different classes. Explicit integral representations valid for arbitrary weight functions are derived for the
Akemann, G +10 more
core +7 more sources
Minimizing polynomial functions [PDF]
, 2003 We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gröbner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation technique, due to N.Z. Shor and the first author, which involves sums of squares and semidefinite programming.
Pablo A. Parrilo, Bernd Sturmfels
openaire +2 more sources
On polar Legendre polynomials [PDF]
, 2010 10 pages, no figures.-- MSC2000 codes: Primary 42C05; Secondary 33C25.-- ArXiv pre-print available at: http://arxiv.org/abs/0709.4537Accepted in Rocky Mountain Journal of Mathematics.We introduce a new class of polynomials {Pn}, that we call polar ...
Urbina, Wilfredo +6 more
core +2 more sources
The number of unimodular roots of some reciprocal polynomials
Comptes Rendus. Mathématique, 2020 We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when $d$ tends to ...
Stankov, Dragan
doaj +1 more source
On the minimal distance of a polynomial code [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity For a polynomial f(x) is an element of Z(2)[x] it is natural to consider the near-ring code generated by the polynomials f circle x, f circle x(2) ,..., f circle x(k) as a vectorspace.
Peter Pal Pach, Csaba Szabo
openaire +4 more sources
Asymptotics of orthogonal polynomials generated by a Geronimus perturbation of the Laguerre measure [PDF]
, 2016 This paper deals with monic orthogonal polynomials generated by a Geronimus canonical spectral transformation of the Laguerre classical measure for x in [0,?), ?
Deaño Cabrera, Alfredo +6 more
core +1 more source
Orthogonal Polynomials, Paraorthogonal Polynomials, and Point Perturbation [PDF]
, 2009 This thesis consists of three parts. Part 1 starts with an introduction to orthogonal polynomials, to be followed by some well-known theorems pertinent to the results we shall discuss.
Wong, Manwah Lilian
core +1 more source
On Values of Cyclotomic Polynomials. V [PDF]
, 2003 In this paper, we present three results on cyclotomic polynomials. First, we present results about factorization of cyclotomic polynomials over arbitrary fields K.
Motose, Kaoru, Kaoru Motose
core +1 more source