Results 1  10
of
18
Approximate Factorization of Multivariate Polynomials via Differential Equations
 Manuscript
, 2004
"... The input to our algorithm is a multivariate polynomial, whose complex rational coe#cients are considered imprecise with an unknown error that causes f to be irreducible over the complex numbers C. We seek to perturb the coe#cients by a small quantitity such that the resulting polynomial factors ove ..."
Abstract

Cited by 37 (9 self)
 Add to MetaCart
The input to our algorithm is a multivariate polynomial, whose complex rational coe#cients are considered imprecise with an unknown error that causes f to be irreducible over the complex numbers C. We seek to perturb the coe#cients by a small quantitity such that the resulting polynomial factors over C. Ideally, one would like to minimize the perturbation in some selected distance measure, but no e#cient algorithm for that is known. We give a numerical multivariate greatest common divisor algorithm and use it on a numerical variant of algorithms by W. M. Ruppert and S. Gao. Our numerical factorizer makes repeated use of singular value decompositions. We demonstrate on a significant body of experimental data that our algorithm is practical and can find factorizable polynomials within a distance that is about the same in relative magnitude as the input error, even when the relative error in the input is substantial (10 3 ).
Towards Factoring Bivariate Approximate Polynomials
"... A new algorithm is presented for factoring bivariate approximate polynomials over C [x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its irreducible factors. Subject to a conjecture, the time to produce the factors is polynomial in the de ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
A new algorithm is presented for factoring bivariate approximate polynomials over C [x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its irreducible factors. Subject to a conjecture, the time to produce the factors is polynomial in the degree of the problem. This method has been implemented in Maple, and has been demonstrated to be efficient and numerically robust.
On Approximate Irreducibility of Polynomials in Several Variables
"... We study the problem of bounding a polynomial away from polynomials which are absolutely irreducible. Such separation bounds are useful for testing whether a numerical polynomial is absolutely irreducible, given a certain tolerance on its coefficients. Using an absolute irreducibility criterion due ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
We study the problem of bounding a polynomial away from polynomials which are absolutely irreducible. Such separation bounds are useful for testing whether a numerical polynomial is absolutely irreducible, given a certain tolerance on its coefficients. Using an absolute irreducibility criterion due to Ruppert, we are able to find useful separation bounds, in several norms, for bivariate polynomials. We also use Ruppert's criterion to derive new, more effective Noether forms for polynomials of arbitrarily many variables. These forms lead to small separation bounds for polynomials of arbitrarily many variables.
Exact Certification of Global Optimality of Approximate Factorizations Via Rationalizing SumsOfSquares with Floating Point Scalars
, 2008
"... We generalize the technique by Peyrl and Parillo [Proc. SNC 2007] to computing lower bound certificates for several wellknown factorization problems in hybrid symbolicnumeric computation. The idea is to transform a numerical sumofsquares (SOS) representation of a positive polynomial into an exact ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
We generalize the technique by Peyrl and Parillo [Proc. SNC 2007] to computing lower bound certificates for several wellknown factorization problems in hybrid symbolicnumeric computation. The idea is to transform a numerical sumofsquares (SOS) representation of a positive polynomial into an exact rational identity. Our algorithms successfully certify accurate rational lower bounds near the irrational global optima for benchmark approximate polynomial greatest common divisors and multivariate polynomial irreducibility radii from the literature, and factor coefficient bounds in the setting of a model problem by Rump (up to n = 14, factor degree = 13). The numeric SOSes produced by the current fixed precision semidefinite programming (SDP) packages (SeDuMi, SOSTOOLS, YALMIP) are usually too coarse to allow successful projection to exact SOSes via Maple 11’s exact linear algebra. Therefore, before projection we refine the SOSes by rankpreserving Newton iteration. For smaller problems the starting SOSes for Newton can be guessed without SDP (“SDPfree SOS”), but for larger inputs we additionally appeal to sparsity techniques in our SDP formulation.
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
 Manuscript
, 2006
"... We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials have a greatest common divisor (GCD) of at least a given degree k. In addition, we restrict the defo ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real or complex multivariate polynomials such that the deformed polynomials have a greatest common divisor (GCD) of at least a given degree k. In addition, we restrict the deformed coefficients by a given set of linear constraints, thus introducing the linearly constrained approximate GCD problem. We present an algorithm based on a version of the structured total least norm (STLN) method and demonstrate, on a diverse set of benchmark polynomials, that the algorithm in practice computes globally minimal approximations. As an application of the linearly constrained approximate GCD problem, we present an STLNbased method that computes for a real or complex polynomial the nearest real or complex polynomial that has a root of multiplicity at least k. We demonstrate that the algorithm in practice computes, on the benchmark polynomials given in the literature, the known globally optimal nearest singular polynomials. Our algorithms can handle, via randomized preconditioning, the difficult case when the nearest solution to a list of real input polynomials actually has nonreal complex coefficients.
Approximate Bivariate Factorization, a Geometric Viewpoint
, 2007
"... We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in C[x, y]. Given a composite polynomial, stably squarefree, satisfying a genericity hypothesis, we describe the effect of a perturbation on the roots of its d ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in C[x, y]. Given a composite polynomial, stably squarefree, satisfying a genericity hypothesis, we describe the effect of a perturbation on the roots of its discriminant with respect to one variable, and the perturbation of the corresponding monodromy action on a smooth fiber. A novel geometric approach is presented, based on guided projection in the parameter space and continuation method above randomly chosen loops, to reconstruct from a perturbed polynomial a nearby composite polynomial and its irreducible factors. An algorithm and its ingredients are described.
Computing dynamic output feedback laws
 IEEE Trans. Automatic Control
"... The pole placement problem asks to find laws to feed the output of a plant governed by a linear system of differential equations back to the input of the plant so that the resulting closedloop system has a desired set of eigenvalues. Converting this problem into a question of enumerative geometry, ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The pole placement problem asks to find laws to feed the output of a plant governed by a linear system of differential equations back to the input of the plant so that the resulting closedloop system has a desired set of eigenvalues. Converting this problem into a question of enumerative geometry, efficient numerical homotopy algorithms to solve this problem for general MultiInputMultiOutput (MIMO) systems have been proposed recently. While dynamic feedback laws offer a wider range of use, the realization of the output of the numerical homotopies as a machine to control the plant in the time domain has not been addressed before. In this paper we present symbolicnumeric algorithms to turn the solution to the question of enumerative geometry into a useful control feedback machine. We report on numerical experiments with our publicly available software and illustrate its application on various control problems from the literature.
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg’s method
, 2010
"... ..."
Computing approximate GCD of univariate polynomials by structured total least norm
 Institute of Systems Science, AMSS, Academia Sinica
, 2004
"... Abstract. The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylveste ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylvester matrix of given lower rank. We present algorithms for computing the nearest GCD and a certified ɛGCD for a given tolerance ɛ. The running time of our algorithm is polynomial in the degrees of polynomials. We also show the performance of the algorithms on a set of univariate polynomials.