Advertisement

Computing Approximate Greatest Common Right Divisors of Differential Polynomials

  • Mark GiesbrechtEmail author
  • Joseph Haraldson
  • Erich Kaltofen
Article
  • 6 Downloads

Abstract

Differential (Ore) type polynomials with “approximate” polynomial coefficients are introduced. These provide an effective notion of approximate differential operators, with a strong algebraic structure. We introduce the approximate greatest common right divisor problem (GCRD) of differential polynomials, as a non-commutative generalization of the well-studied approximate GCD problem. Given two differential polynomials, we present an algorithm to find nearby differential polynomials with a non-trivial GCRD, where nearby is defined with respect to a suitable coefficient norm. Intuitively, given two linear differential polynomials as input, the (approximate) GCRD problem corresponds to finding the (approximate) differential polynomial whose solution space is the intersection of the solution spaces of the two inputs. The approximate GCRD problem is proven to be locally well posed. A method based on the singular value decomposition of a differential Sylvester matrix is developed to produce an initial approximation of the GCRD. With a sufficiently good initial approximation, Newton iteration is shown to converge quadratically to an optimal solution. Finally, sufficient conditions for existence of a solution to the global problem are presented along with examples demonstrating that no solution exists when these conditions are not satisfied.

Keywords

Symbolic–numeric computation Approximate polynomial computation Approximate GCD Differential polynomials Linear differential operators 

Mathematics Subject Classification

12Y05 13P05 13N10 49M15 

Notes

Acknowledgements

The authors would like to thank George Labahn for his comments. The authors would also like to thank the two anonymous referees for their careful reading and comments.

References

  1. 1.
    Abramov S, Le H, Li Z (2005) Univariate Ore polynomial rings in computer algebra. J Math Sci 131(5):5885–5903MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bell J, Heinle A, Levandovskyy V (2017) On noncommutative finite factorization domains. Trans AMS 369:2675–2695MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Botting B, Giesbrecht M, May J (2005) Using the Riemannian SVD for problems in approximate algebra. In: Proceedings workshop on symbolic-numeric computation (SNC’05), pp 209–219Google Scholar
  4. 4.
    Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, New YorkCrossRefzbMATHGoogle Scholar
  5. 5.
    Bronstein M, Petkovšek M (1994) On Ore rings, linear operators and factorisation. Programmirovanie 20:27–45zbMATHGoogle Scholar
  6. 6.
    Bronstein M, Petkovšek M (1996) An introduction to pseudo-linear algebra. Theor Comput Sci 157(1):3-33MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Corless RM, Gianni PM, Trager BM, Watt SM (1995) The singular value decomposition for polynomial systems. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’95), pp 189–205Google Scholar
  8. 8.
    Emiris IZ, Galligo A, Lombardi H (1997) Certified approximate univariate GCDs. J Pure Appl Algebra 117–118:229–251.  https://doi.org/10.1016/S0022-4049(97)00013-3
  9. 9.
    Giesbrecht M, Haraldson J (2014) Computing GCRDs of approximate differential polynomials. In: Proceedings symposium on symbolic-numeric computation (SNC ’14), pp 78–87Google Scholar
  10. 10.
    Giesbrecht M, Kim M (2013) Computing the hermite form of a matrix of Ore polynomials. J Algebra 376:341–362MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Giesbrecht M, Heinle A, Levandovskyy V (2016) Factoring linear partial differential operators in \(n\) variables. J Symb Comput 75:127–148MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Grigor’ev D (1990) Complexity of factoring and calculating the GCD of linear ordinary differential operators. J Symb Comput 10(1):7–37MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Haraldson J (2015) Computing approximate GCRDs of differential polynomials. Master’s thesis, University of WaterlooGoogle Scholar
  14. 14.
    Heinle A, Levandovskyy V (2016) A factorization algorithm for g-algebras and applications. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC 16), ACM Press, pp 263–270Google Scholar
  15. 15.
    Kaltofen E, Yang Z, Zhi L (2005) Structured low rank approximation of a Sylvester matrix. In: Proceedings workshop on symbolic-numeric computation (SNC’05), pp 69–83Google Scholar
  16. 16.
    Kaltofen E, Yang Z, Zhi L (2006) Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’06), pp 169–176Google Scholar
  17. 17.
    Kaltofen E, Yang Z, Zhi L (2007a) Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials, unpublished manuscriptGoogle Scholar
  18. 18.
    Kaltofen E, Yang Z, Zhi L (2007b) Structured low rank approximation of a sylvester matrix. In: Symbolic-numeric computation, Birkhäuser Verlag, Basel, Switzerland, Trends in Mathematics, pp 69–83CrossRefGoogle Scholar
  19. 19.
    Karmarkar N, Lakshman YN (1996) Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’96), pp 35–39Google Scholar
  20. 20.
    Karmarkar N, Lakshman YN (1998) On approximate GCDs of univariate polynomials. J Symb Comput 26(6):653–666MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Li Z (1998) A subresultant theory for Ore polynomials with applications. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’98), ACM, pp 132–139Google Scholar
  22. 22.
    Li Z, Nemes I (1997) A modular algorithm for computing greatest common right divisors of Ore polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’97), pp 282–289Google Scholar
  23. 23.
    Ore O (1933) Theory of non-commutative polynomials. Ann Math Second Ser 34:480–508MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Rudin W (1976) Principles of mathematical analysis. . New YorkzbMATHGoogle Scholar
  25. 25.
    Salvy B, Zimmermann P (1994) Gfun: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans Math Softw 20(2):163–177CrossRefzbMATHGoogle Scholar
  26. 26.
    Sasaki T, Sasaki M (1997) Polynomial remainder sequence and approximate GCD. ACM SIGSAM Bull 31:4–10CrossRefGoogle Scholar
  27. 27.
    Schönhage A (1985) . J Complex 1:118–137MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Schost É, Spaenlehauer P (2016) A quadratically convergent algorithm for structured low-rank approximation. Found Comput Math 16(2):457–492MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    von zur Gathen J, Gerhard J (2013) Modern Computer Algebra, 3rd edn. Cambridge University Press, New YorkGoogle Scholar
  30. 30.
    Zeng Z (2011) The numerical greatest common divisor of univariate polynomials. In: Randomization, relaxation, and complexity in polynomial equation solving, contemporary mathematics, vol 556. ACM Press, pp 187–217Google Scholar
  31. 31.
    Zeng Z, Dayton BH (2004) The approximate GCD of inexact polynomials. In: Proceedings international symposium on symbolic and algebraic computation (ISSAC’04), pp 320–327Google Scholar

Copyright information

© SFoCM 2019

Authors and Affiliations

  • Mark Giesbrecht
    • 1
    Email author
  • Joseph Haraldson
    • 1
  • Erich Kaltofen
    • 2
  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of MathematicsNorth Carolina State UniversityRaleighUSA

Personalised recommendations