efficient parallel rooting of complex polynomials on the unit circle an efficient method is presented for rooting complex polynomial equations of any order where the root space is restricted to the unit circle the method restates the evaluation of polynomials as a recursive algorithm involving only additions by means of the bilinear transformation the straight line uniformly spaced recursive polynomials evaluation method of a h nuttall 1987 is extended to the unit circle where the root positions are determined by thresholding general coefficient transformations are provided along with a comparison to the horner method

on the measure of totally real algebraic integers ii for a certain measure s2 a defined for totally real algebraic integers a 0 1 we find the four smallest values of q a the methods used involve linear programming and the results are verified using interval arithmetic

efficient evaluation of 1 d and 2 d polynomials at equispaced points an extension to the two dimensional case of a previously published fast algorithm for evaluating exponential functions and polynomials over periodically distributed points is generalized to evaluate two dimensional polynomials efficiently over general periodic parallelograms the problem of getting the initial values required for other fast algorithms is treated in a general manner fast algorithms are presented for computing initial values in both cases of one and two dimensional polynomials it is observed that the two dimensional recursion is not always advantageous compared with taking the one dimensional recursion for each variable separately

a generalization of the schur siegel smyth trace problem abstract let be a totally positive algebraic integer and define its absolute trace to be tr deg the trace of divided by the degree of elementary considerations show that the absolute trace is always at least one while it is plausible that for any 0 the absolute trace is at least 2 with only finitely many exceptions this is known as the schur siegel smyth trace problem our aim in this paper is to show that the schur siegel smyth trace problem can be considered as a special case of a more general problem

on fast evaluation of bivariate polynomials at equispaced arguments the initial value problem arising in the recursive evaluation of a 2d polynomial at equispaced points is treated in detail the results facilitate efficient implementation of bose s recursive algorithm the computational complexity is compared with that involved in a direct computation and some general observations are made for an alternative scheme proposed by x nie and r unbehauen 1989

algebro geometric analogues of donaldson s polynomials donaldson 5 has introduced polynomials on the second homology of any simply connected closed four manifold m with b odd at least 3 which up to are invariant under orientation preserving diffeomorphisms for every c ibm there is a polynomial 7c m syma h2 s where d c 4c z2 b 1 to define it one considers j c the set which is in a natural way a manifold of gauge equivalence classes of connections on the su 2 bundle on m with c2 c antiself dual with respect to a generic metric on m there is a natural map h2 m h2 j c namely slant product with 88 where p is the universal so 3 principal bundle on m x j c one way of defining 7c m 10 is to construct a compactification of r xc carrying a fundamental class xc one proves that extends to a map h2 m h2 xc then one defines

efficient evaluation of polynomials and exponentials of polynomials for equispaced arguments a kth order polynomial can be evaluated by means of k additions and no multiplications when done in a recursive fashion at equispaced arguments the evaluation of an exponential of a kth order polynomial can be accomplished by k multiplications and no additions or exponentiations combinations of rational functions and exponentials can therefore be realized very efficiently by combining these properties

efficient evaluation of multivariate polynomials over multidimensional grids let p x 1 x 2 x n be a multivariate polynomial in n variables x 1 x 2 x n and suppose that p x 1 x 2 x n is of degree m i in x i i 1 2 n it is shown how p x 1 x 2 x n may be evaluated at x i x 0i n i i for n i 0 1 2 and i 1 2 n using not more than m 1 m 2 m n additions per point feasibility of reduction from this upper bound is demonstrated in the n 2 case

the integer chebyshev problem the main problem of this chapter is to find a polynomial in z n of minimal supremum norm on an interval this is p1 and it is of a slightly different flavour than most of the other problems in this book in that there is no restriction on the size of the coefficients we now state p1 with greater precision

polynomial phase signal analysis based on the polynomial derivatives decompositions an exact decomposition of the derivatives of any order of a polynomial spl phi t is proposed in terms of spl phi t t sub 0 spl phi t t sub n this result allows us to introduce generalized time frequency distributions for studying signals having a polynomial phase and a constant amplitude in order to determine the degree and the coefficients of the corresponding phase the relationships between these distributions and the already known polynomial distributions i e the polynomial phase transform and the polynomial wigner ville distribution are discussed illustrations by example are proposed

groupe de picard des varietes de modules de fibres semi stables sur les courbes algebriques soient x une courbe algebrique projective lisse de genre g 2 sur r d des entiers avec r 2 on note u r d la variete de modules des fibres algebriques semi stables sur x de rang r et de degre d us r d l ouvert de u r d correspondant aux fibres stables on sait que u r d est une variete algebrique projective irreductible et normale si r et d ne sont pas premiers entre eux u r d n est pas lisse sauf dans une exception le cas ou g 2 r 2 et d est pair on supposera dans cet article qu on n est pas dans ce cas on a alors codimu r d u r d us r d 2 et u r d us r d est le lieu des points singuliers de u r d si l est un fibre en droites de degre d sur x on note u r l la sous variete fermee de u r d correspondant aux fibres vectoriels de determinant isomorphe a l on etudie dans cet article les groupes de picard pic u r d et pic u r l on montre d abord que les varietes u r d et u r l sont localement factorielles on calcule ensuite pic u r d et pic u r l qui sont decrits au moyen des diviseurs thetas generalises

two new points in the spectrum of the absolute mahler measure of totally positive algebraic integers for totally positive algebraic integers 0 1 of degree d we consider the set l of values of m 1 d where m is the mahler measure of c j smyth has found the four smallest values of l and conjectured that the fifth point is 2 cos 2 60 2 we prove that this is so and moreover we give the sixth point of l

the discrete polynomial phase transform the discrete polynomial phase transform dpt is a new tool for analyzing constant amplitude polynomial phase signals the main properties of the dpt are its ability to identify the degree of the phase polynomial and to estimate its coefficients the transform is robust to deviations from the ideal signal model such as slowly varying amplitude additive noise and nonpolynomial phase the authors define the dpt derive its basic properties and use it to develop computationally efficient estimation and detection algorithms a statistical accuracy analysis of the estimated parameters is also presented

the genus minimizing property of algebraic curves a viable and still unproved conjecture states that if x is a smooth algebraic surface and c is a smooth algebraic curve in x then c realizes the smallest possible genus amongst all smoothly embedded 2 manifolds in its homology class a proof is announced here for this conjecture for a large class of surfaces x under the assumption that the normal bundle of c has positive degree

a relationship between the z transform and the fourier transform a relationship between the one sided z transform and the one sided discrete time fourier transform is discussed every discrete time function that can result from the sampling of a periodic continuous time function is considered to be periodic a simple general equation is presented and discussed

estimating the doa and the polarization of a polynomial phase signal using a single polarized vector sensor this paper introduces a novel algorithm to estimate the direction of arrival doa and the polarization of a completely polarized polynomial phase signal of an arbitrary degree the algorithm utilizes a polarized vector sensor comprising a spatially collocated six component electromagnetic vector sensor a dipole triad or a loop triad this esprit based algorithm is based on a time invariant matrix pencil pair derived from the time delayed data sets collected by a single polarized vector sensor the high order difference function of the signal s phase constructs the invariant factor used in the esprit algorithm the steering vector is estimated from the signal subspace eigenvector of the data correlation matrix following which the closed form doa and polarization can be obtained given the degree of the polynomial phase signal this approach resolves the two dimensional azimuth elevation angle and the polarization of the source and requires neither a priori knowledge of the polynomial phase signal s coefficients nor a priori knowledge of the polynomial phase signal s frequency spectrum the efficacy of the proposed algorithm is verified by monte carlo simulations estimation accuracies of the doa and the polarization parameters are evaluated by the closed form cramer rao bounds which are independent of the polynomial coefficients the degree of the polynomial phase signal and the azimuth angle of the source

on fixed point roundoff error analysis the author points out the existence of work published by the author us dept of commerce tech rep ad a086826 57 pp apr 1980 prior to the appearance of the paper by barnes et al ibid vol assp 33 p 595 606 june 1985 covering the same subject

edge preserving filtering by combining nonlinear mean and median filters a very general class of nonlinear filters called mapping order statistics filters mosfs is introduced a subclass of the mosfs called l sub p mean median filters l sub p mmfs is discussed the l sub p mmf shows better properties in preserving edges and attenuating positive and negative impulse noise simultaneously than do the nonlinear mean filters in the analysis of the deterministic properties of the l sub p mmf the concept of a monotonic trend region is introduced a necessary condition for a signal to be a root signal is given this necessary condition is also valid for the known finite impulse response median hybrid filter

new efficient ls and svd based techniques for high resolution frequency estimation new least squares and singular value decomposition based methods for the estimation of the frequencies of complex sinusoids in white noise are presented the methods are based on a new symmetric prediction problem that has some very useful properties leading to algorithms that have considerably reduced complexity the new symmetric predictor is superior in performance as compared to the well known symmetric smoother and has a performance comparable to other well known methods finally a new ls based method which combines the new prediction technique with the fblp method is proposed this method performs slightly better than the fblp offering at the same time a significant computational saving as a by product in the derivation of the new methods is the establishment of some useful properties concerning the eigenstructure of hermitian and persymmetric matrices

a note on efficient evaluation of polynomials and exponentials of polynomials for equispaced arguments by a h nuttall a h nuttall s see ibid vol assp 35 no 10 p 1486 7 1987 algorithm for the evaluation of a polynomial at a large number of arguments is addressed the authors supplement nuttall s treatment of the problem by 1 giving a relationship between the coefficients of the original polynomial and those of the equivalent one in terms of the integer variable n and 2 by deriving a formula for the computation of the initial values required for nuttall s recursive procedure to commence as a result of these supplements the recursive algorithm is completely programmable and can be efficiently implemented for any order n of the polynomial some general observations are made on the computational complexity in recursive evaluation in contrast to direct evaluation of a polynomial