Sciweavers

358 search results - page 3 / 72
» Sparse squares of polynomials
Sort
View
MP
2006
80views more  MP 2006»
13 years 7 months ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels
CAP
2010
13 years 2 months ago
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
Michael B. Monagan, Roman Pearce
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 6 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
13 years 7 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd
ICASSP
2011
IEEE
12 years 11 months ago
The asymptotic properties of polynomial phase estimation by least squares phase unwrapping
Estimating the coefficients of a noisy polynomial phase signal is important in many fields including radar, biology and radio communications. One approach to estimation attempts...
Robby G. McKilliam, I. Vaughan L. Clarkson, Barry ...