Search Sciweavers | Sciweavers

358 search results - page 1 / 72

» Sparse squares of polynomials

click to vote

MOC
2002

149views more MOC 2002»

Sparse squares of polynomials

13 years 4 months ago

Download www.ams.org

We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...

John Abbott

claim paper

Read More »

click to vote

TCS
2008

161views Theoretical Computer Science» more TCS 2008»

Approximate GCDs of polynomials and sparse SOS relaxations

13 years 4 months ago

Download www.mmrc.iss.ac.cn

The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...

Bin Li, Jiawang Nie, Lihong Zhi

claim paper

Read More »

click to vote

SIAMJO
2008

108views more SIAMJO 2008»

Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials

13 years 4 months ago

Download math.ucsd.edu

This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...

Jiawang Nie, James Demmel

claim paper

Read More »

click to vote

SIAMSC
2011

177views more SIAMSC 2011»

Computing f(A)b via Least Squares Polynomial Approximations

12 years 12 months ago

Download www.mcs.anl.gov

Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...

Jie Chen, Mihai Anitescu, Yousef Saad

claim paper

Read More »

click to vote

DM
2006

72views more DM 2006»

Sparse anti-magic squares and vertex-magic labelings of bipartite graphs

13 years 4 months ago