The RCH Method for Computing Minimal Polynomials of Polynomial Matrices

In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.

ZONAL SPHERICAL POLYNOMIALS WITH MINIMAL L_1-NORM

Radial functions have become a useful tool in numerical mathematics. On the sphere they have to be identified with the zonal functions. We investigate zonal polynomials with mass concentration at the pole, in the sense of their L1-norm is attaining the minimum value. Such polynomials satisfy a complicated system of nonlinear e-quations (algebraic if the space dimension is odd, only) and also a singular differential equation of third order. The exact order of decay of the minimum value with respect to the polynomial degree is determined. By our results we can prove that some nodal systems on the sphere, which are defined by a minimum-property, are providing fundamental matrices which are diagonal-dominant or bounded with respect to the ∞-norm, at least, as the polynomial degree tends to infinity.

Fast algorithm for determining the minimal polynomial of up^n-periodic sequence

A fast algorithm for determining the minimal polynomial and linear complexity of a upn-periodic sequence over a finite field Fq is given.Let p,q,and u be distinct primes,q a primitive root modulo p2,m the smallest positive integer such that qm≡1 mod u,and gcd（m,p（p-1））=1.An algorithm is used to reduce a periodic upn sequence over Fq to several pn-periodic sequences over Fq（ζ）,where ζ is a u-th primitive root of unity,and an algorithm proposed by Xiao et al.is employed to obtain the minimal polynomial of each pn-periodic sequence.

CHARACTERIZATION OF THE CONVERGENCE DOMAINS OF POLYNOMIAL SERIES AND THE MINIMAL CONVERGENCE DOMAIN

A characterization of the convergence domains of polynomial series is disucssed. the minimal convergence domain for a kind of polynomial series is shown.

Linear complexity of Ding generalized cyclotomic sequences

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.

SVD-MPE: An SVD-Based Vector Extrapolation Method of Polynomial Type

An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors , where , N being very large. Such sequences arise, for example, in the solution of systems of linear or nonlinear equations by fixed-point iterative methods, and are simply the required solutions. In most cases of interest, however, these sequences converge to their limits extremely slowly. One practical way to make the sequences converge more quickly is to apply to them vector extrapolation methods. Two types of methods exist in the literature: polynomial type methods and epsilon algorithms. In most applications, the polynomial type methods have proved to be superior convergence accelerators. Three polynomial type methods are known, and these are the minimal polynomial extrapolation (MPE), the reduced rank extrapolation (RRE), and the modified minimal polynomial extrapolation (MMPE). In this work, we develop yet another polynomial type method, which is based on the singular value decomposition, as well as the ideas that lead to MPE. We denote this new method by SVD-MPE. We also design a numerically stable algorithm for its implementation, whose computational cost and storage requirements are minimal. Finally, we illustrate the use of SVD-MPE with numerical examples.

A note for preconditioning nonsymmetric matrices

In this paper, we consider preconditioners for generalized saddle point systems with a nonsymmetric coefficient matrix. A constraint preconditioner for this systems is constructed, and some spectral properties of the preconditioned matrix are given. Our results extend the corresponding ones in [3] and [4].

Linear Complexity of New Generalized Cyclotomic Sequences of Length 2pq

The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.

Two Eigenvector Theorems

In this paper, we established a connection between a square matrix “A” of order “n” and a matrix defined through a new approach of the recursion relation . (where is any column matrix with n real elements). Now the new matrix gives us a characteristic equation of matrix A and we can find the exact determination of Eigenvalues and its Eigenvectors of the matrix A. This new approach was invented by using Two eigenvector theorems along with some examples. In the subsequent paper we apply this approach by considering some examples on this invention.

R-matrix for the 8-Dimensional Spin Representation of Uq(so7)

The purpose of the paper is to describe the solution to the quantum Yang-Baxter equation associated with the 8-dimensional spin representation Tsp of Uq(so7).The self-duality of Tsp and the symmetry of the corresponding braiding matrix are proved.Also,the minimal polynomial of the braiding R-matrix of Tsp is presented explicitly in an ingenious method by taking advantage of nice features of the spin representation Tsp.

On the Arithmetic of Endomorphism Ring End (Zp×Zpm)

For a prime p,let E_（p,p^m）={（a p^（m-1） b d）｜a,b,c∈Z_p,d∈Z_（p^m）}. We first establish a ring isomorphism from Z_（p,p^m） onto E_（p,p^m）. Then we provide a way to compute-d and d^（-1） by using arithmetic in Z_p and Z_（p^m）, and characterize the invertible elements of E_（p,p^m）. Moreover, we introduce the minimal polynomial for each element in E_（p,p^m） and give its applications.

A fast algorithm for determining the linear complexity of a binary sequence with period 2~np^m

An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2.

A property of Pisot numbers and Fourier transforms of self-similar measures

For any Pisot number β it is known that the set F（β） ={t ： limn→∞‖tβn‖ = 0} is countable, where ‖α‖ is the distance between a real number a and the set of integers. In this paper it is proved that every member in this set is of the form cβn, where n is a nonnegative integer and e is determined by a linear system of equations. Furthermore, for some self-similar measures μ associated with β, the limit at infinity of the Fourier transforms limn→μ（tβn）≠0 if and only if t is in a certain subset of F（β）. This generalizes a similar result of Huang and Strichartz.

Exact Bivariate Polynomial Factorization over Q by Approximation of Roots

Factorization of polynomials is one of the foundations of symbolic computation.Its applications arise in numerous branches of mathematics and other sciences.However,the present advanced programming languages such as C++ and J++,do not support symbolic computation directly.Hence,it leads to difficulties in applying factorization in engineering fields.In this paper,the authors present an algorithm which use numerical method to obtain exact factors of a bivariate polynomial with rational coefficients.The proposed method can be directly implemented in efficient programming language such C++ together with the GNU Multiple-Precision Library.In addition,the numerical computation part often only requires double precision and is easily parallelizable.