224 search results - page 4 / 45 » Homogeneous Decomposition of Polynomials |
JSC
2008
13 years 10 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
ISSAC
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
ISSAC
1995
Springer
14 years 2 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
TIT
2010
13 years 5 months ago
2010
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
COLT
2005
Springer
14 years 4 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...