Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

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 STLN-based method that computes 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 non-real complex coefficients.

[1]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[2]  G. Stewart.  Introduction to matrix computations , 1973 .

[3]  Donna K. Dunaway.  Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm , 1974 .

[4]  Arnold Schönhage,et al.  Quasi-GCD computations , 1985, J. Complex..

[5]  T. Sasaki,et al.  Approximate square-free decomposition and root-finding of lll-conditioned algebraic equations , 1989 .

[6]  Haesun Park,et al.  Fast Plane Rotations with Dynamic Scaling , 1994, SIAM J. Matrix Anal. Appl..

[7]  Stephen M. Watt,et al.  The singular value decomposition for polynomial systems , 1995, ISSAC '95.

[8]  Haesun Park,et al.  Self-scaling fast rotations for stiff and equality-constrained linear least squares problems , 1996 .

[9]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[10]  Erich Kaltofen,et al.  Efficient algorithms for computing the nearest polynomial with constrained roots , 1998, ISSAC '98.

[11]  Zhi Lihong,et al.  Nearest Singular Polynomials , 1998 .

[12]  George Labahn,et al.  A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials , 1998, J. Symb. Comput..

[13]  Narendra Karmarkar,et al.  On Approximate GCDs of Univariate Polynomials , 1998, J. Symb. Comput..

[14]  J. B. Rosen,et al.  Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm , 1999 .

[15]  Sabine Van Huffel,et al.  Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem , 2000, SIAM J. Matrix Anal. Appl..

[16]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[17]  S. Huffel,et al.  STRUCTURED TOTAL LEAST SQUARES Analysis, Algorithms and Applications , 2002 .

[18]  R. Plemmons,et al.  Structured low rank approximation , 2003 .

[19]  L. Zhi.  DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS , 2003 .

[20]  Erich Kaltofen,et al.  On approximate irreducibility of polynomials in several variables , 2003, ISSAC '03.

[21]  Siegfried M. Rump,et al.  Structured Perturbations Part I: Normwise Distances , 2003, SIAM J. Matrix Anal. Appl..

[22]  Sabine Van Huffel,et al.  Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem , 2004, Numerical Algorithms.

[23]  Erich Kaltofen,et al.  Approximate factorization of multivariate polynomials via differential equations , 2004, ISSAC '04.

[24]  Zhonggang Zeng,et al.  The approximate GCD of inexact polynomials Part II: a multivariate algorithm , 2004, ISSAC 2004.

[25]  Stephen M. Watt,et al.  QR factoring to compute the GCD of univariate approximate polynomials , 2004, IEEE Transactions on Signal Processing.

[26]  Zhonggang Zeng,et al.  The approximate GCD of inexact polynomials , 2004, ISSAC '04.

[27]  L. Zhi,et al.  Hybrid method for computing the nearest singular polynomials , 2004 .

[28]  L. Zhi,et al.  Fast Low Rank Approximation of a Sylvester Matrix by Structured Total Least Norm , 2005 .

[29]  Jon P. May.  Approximate Factorization of Polynomials in Many Variables and Other Problems in Approximate Algebra via Singular Value Decomposition Methods , 2005 .

[30]  E. Kaltofen,et al.  Structured Low Rank Approximation of a Sylvester Matrix , 2007 .

[31]  L. Zhi,et al.  Structured Low Rank Approximation of a , 2007 .

[32]  Erich Kaltofen,et al.  Approximate factorization of multivariate polynomials using singular value decomposition , 2008, J. Symb. Comput..