Advertisement

A Fast Algorithm for Approximate Polynomial GCD Based on Structured Matrix Computations

  • Dario A. Bini
  • Paola Boito
Chapter
Part of the Operator Theory: Advances and Applications book series (OT, volume 199)

Abstract

An O(n 2) complexity algorithm for computing an ∈-greatest common divisor (gcd) of two polynomials of degree at most n is presented. The algorithm is based on the formulation of polynomial gcd given in terms of resultant (Bézout, Sylvester) matrices, on their displacement structure and on the reduction of displacement structured matrices to Cauchy-like form originally pointed out by Georg Heinig. A Matlab implementation is provided. Numerical experiments performed with a wide variety of test problems, show the effectiveness of this algorithm in terms of speed, stability and robustness, together with its better reliability with respect to the available software.

Mathematics Subject Classification (2000)

68W30 65F05 15A23 

Keywords

Cauchy matrices polynomial gcd displacement structure Sylvester matrix Bézout matrix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    B. Beckermann, G. Labahn, When are two numerical polynomials relatively prime?, J. Symbolic Comput. 26, 677–689 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    B. Beckermann, G. Labahn, A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials, J. Symb. Comp. 26, 691–714 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    D.A. Bini, V.Y. Pan, Polynomial and Matrix Computations, vol. I, Birkhäuser, 1994.Google Scholar
  4. [4]
    R.M. Corless, S.M. Watt, L. Zhi, QR Factoring to Compute the GCD of Univariate Approximate Polynomials, IEEE Trans. Signal Processing 52, 3394–3402 (2004).CrossRefMathSciNetGoogle Scholar
  5. [5]
    R.M. Corless, P.M. Gianni, B.M. Trager, S.M. Watt, The Singular Value Decomposition for Approximate Polynomial Systems, Proc. International Symposium on Symbolic and Algebraic Computation, July 10-12 1995, Montreal, Canada, ACM Press 1995, pp. 195–207.Google Scholar
  6. [6]
    G.M. Diaz-Toca, L. Gonzalez-Vega, Computing greatest common divisors and squarefree decompositions through matrix methods: The parametric and approximate cases, Linear Algebra Appl. 412, 222–246 (2006).zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    I.Z. Emiris, A. Galligo, H. Lombardi, Certified approximate univariate GCDs, J. Pure Appl. Algebra 117/118, 229–251 (1997).CrossRefMathSciNetGoogle Scholar
  8. [8]
    I. Gohberg, T. Kailath, V. Olshevsky, Fast Gaussian elimination with partial pivoting for matrices with displacement structure, Math. Comp. 64, 1557–1576 (1995).zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    M. Gu, Stable and Efficient Algorithms for Structured Systems of Linear Equations, SIAM J. Matrix Anal. Appl. 19, 279–306 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    G. Heinig, Inversion of generalized Cauchy matrices and other classes of structured matrices, Linear Algebra in Signal Processing, IMA volumes in Mathematics and its Applications 69, 95–114 (1994).Google Scholar
  11. [11]
    G. Heinig, P. Jankowsky, K. Rost, Fast inversion of Toeplitz-plus-Hankel matrices, Numer. Math. 52, 665–682 (1988).zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    V. Hribernig, H.J. Stetter, Detection and validation of clusters of polynomial zeros, J. Symb. Comp. 24, 667–681 (1997).zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    C.-P. Jeannerod, G. Labahn, SNAP User’s Guide, UW Technical Report no. CS-2002–22 (2002).Google Scholar
  14. [14]
    E. Kaltofen, Z. Yang, L. Zhi, Approximate Greatest Common Divisors of Several Polynomials with Linearly Constrained Coefficients and Singular Polynomials, Proc. International Symposium on Symbolic and Algebraic Computations, 2006.Google Scholar
  15. [15]
    N.K. Karmarkar, Y.N. Lakshman, On Approximate GCDs of Univariate Polynomials, J. Symbolic Comp. 26, 653–666 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    B. Li, Z. Yang, L. Zhi, Fast Low Rank Approximation of a Sylvester Matrix by Structure Total Least Norm, Journal of Japan Society for Symbolic and Algebraic Computation 11, 165–174 (2005).Google Scholar
  17. [17]
    M.-T. Noda, T. Sasaki, Approximate GCD and its application to ill-conditioned algebraic equations, J. Comput. Appl. Math. 38, 335–351 (1991).zbMATHCrossRefMathSciNetGoogle Scholar
  18. [18]
    V.Y. Pan, Numerical computation of a polynomial GCD and extensions, Information and Computation 167, 71–85 (2001).zbMATHCrossRefMathSciNetGoogle Scholar
  19. [19]
    A. Schönhage, Quasi-GCD Computations, J. Complexity, 1, 118–137 (1985).zbMATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    L.B. Rall, Convergence of the Newton Process to Multiple Solutions, Num. Math. 9, 23–37 (1966).zbMATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    M. Stewart, Stable Pivoting for the Fast Factorization of Cauchy-Like Matrices, preprint (1997).Google Scholar
  22. [22]
    D.R. Sweet, R.P. Brent, Error analysis of a fast partial pivoting method for structured matrices, in Adv. Signal Proc. Algorithms, Proc. of SPIE, T. Luk, ed., 266–280 (1995).Google Scholar
  23. [23]
    Z. Zeng, The approximate GCD of inexact polynomials Part I: a univariate algorithm, to appearGoogle Scholar
  24. [24]
    L. Zhi, Displacement Structure in computing the Approximate GCD of Univariate Polynomials, Mathematics, W. Sit and Z. Li eds., World Scientific (Lecture Notes Series on Computing), 288–298 (2003).Google Scholar

Copyright information

© Birkhäuser Verlag Basel/Switzerland 2010

Authors and Affiliations

  • Dario A. Bini
    • 1
  • Paola Boito
    • 1
  1. 1.Dipartimento di MatematicaUniversit`a di PisaPisaItaly

Personalised recommendations