Masaru Sanuki
ABSTRACT
Given polynomials with floating-point number coefficients, one can now compute the approximate GCD stably, except in ill-conditioned cases where the GCD has small or large leading coefficient/constant term. The cost is O(m2), where m is the maximum of degrees of given polynomials. On the other hand, for polynomial with integer coefficients, one can compute the polynomial GCD faster by using the half-GCD method with the cost less than O(m2). In this paper, we challenge to compute the approximate GCD faster, with the cost less than O(m2). Our idea is to use the displacement technique and the half-GCD method.
- A. V. Aho, J. E. Hopcroft and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974. Google Scholar
Digital Library
- S. Belhaj. Block factorization of Hankel matrices and Euclidean algorithm. Math. Medel. Nat. Phenom. 5(7), 2010, 48--54.Google ScholarCross Ref
- D. Bini and P. Boito. Structured matrix-based methods for polynomial ε-gcd: analysis and comparisons. Proc. of ISSAC'07, ACM Press, 2007, 9--16. Google ScholarDigital Library
- B. Beckermann and G. Labahn. A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials. J. Symb. Comput., 26 (1998), 691--714. Google ScholarDigital Library
- S. Chandrasekaran and A. H. Sayed. A fast stable for nonsymmetric Toeplitz and quasi-Toeplitz systems of linear equations. SIAM J. Matrix Anal. Appl., 19 (1) (1998), 107--139. Google ScholarDigital Library
- R. Corless, P. Gianni, B. Trager and S. Watt. The singular value decomposition for polynomial systems. Proc. of ISSAC'95, ACM Press, 1995, 195--207. Google ScholarDigital Library
- R. Corless, S. Watt and L. Zhi. QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Proces., 52(12) (2004), 3394--3402. Google ScholarDigital Library
- G. M. Diaz-Toca and L. Gonzalez-Vega. Computing greatest common divisors and squarefree decompositions through matrix methods: The parametric and approximate cases, Linear Algebra Appl., 412(2-3), (2006), 222--246.Google ScholarCross Ref
- I. Emiris, A. Galligo and H. Lombardi. Certified approximate univariate GCDs. J. Pure and Applied Alge., 117&118 (1997), 229--251.Google ScholarCross Ref
- I. Gohberg, T. Kailath and Y. Olshevsky. Fast Gaussian elimination with partial pivoting for matrices with displacement structure. Math. Comp., 64(212), 1996, 1557--1576. Google ScholarDigital Library
- T. Kailath and A. H. Sayed. Displacement structute: theory and applications. SIAM Review, 37 (3), 1995, 297--386. Google ScholarDigital Library
- F. Kako and T. Sasaki. Proposal of "effective floating-point number" for approximate algebraic computation. Preprint of Tsukuba Univ., 1997.Google ScholarDigital Library
- E. Kaltofen, Z. Yang and L. Zhi. Structured low rank approximation of a Sylvester matrix. International Workshop on SNC'05, D. Wang & L. Zhi (Eds.), 2005, 188--201; full paper appear in Symbolic-Numeric Computation (Trends in Mathematics), D. Wang & L. Zhi (Eds.), Birkhääuser Verlag, 2007, 69--83.Google Scholar
- Z. Li, Z. Yang, and L. Zhi. Blind image deconvolution via fast approximate GCD Proc. of ISSAC'10, ACM Press, 2010, 155--162. Google ScholarDigital Library
- M. Mitrouli and N. Karcanias. Computation of the gcd of polynomials using Gaussian transformation and shifting, Int. Journ. Control, 58 1993, 211--228.Google ScholarCross Ref
- R. T. Moenck. Fast computation of GCDs. Proc. 5th ACM Symp. Thory of Comput., 1973, 142--151. Google ScholarDigital Library
- K. Nagasaka. Ruppert matrix as subresultant mapping, Proc. of CASC 2007, Springer Berlin. 2007, 316--327. Google ScholarDigital Library
- H. Ohsako, H. Sugiura and T. Torii. A stable extended algorithm for generating polynomial remainder sequence (in Japanese). Trans. of JSIAM (Japan Society for Indus. Appl. Math.) 7 (1997), 227--255.Google Scholar
- V. Pan. Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. Proc. of ISSAC'01, ACM Press, 2001, 253--267. Google ScholarDigital Library
- V. Pan and X. Yang. Acceleration of Euclidean algorithm and extensions. Proc. of ISSAC'02, ACM Press, 2002, 207--213. Google ScholarDigital Library
- W. Qiub, Y. Huaa, and K. Abed-Meraima. A subspace method for the computation of the GCD of polynomials. Automatica, 33(4) 1997, 741--743. Google ScholarDigital Library
- M. Sanuki. Improvement of stabulized polynomial remainder sequence algorithm, submitted, 2009.Google Scholar
- T. Sasaki. A study of approximate polynomials, I --- representation and arithmetic ---. Japan J. Indust. Appl. Math. 12 (1995), 137--161.Google ScholarCross Ref
- T. Sasaki. A practical method for floating-point Gröbner basis computation. Proc. of ASCM 2009, Fukuoka, Japan, Math-for-industry series, 22 2009, 167--176.Google Scholar
- A. Schönhage. Quasi-GCD. J. Complexity, 1, 1985, 118--147.Google ScholarCross Ref
- M. Stewart. Stable pivoting for the fast factorization of Cauchy-like matrix. Preprint, 15 page, 1997.Google Scholar
- D. R. Sweet and R. P. Brent. Error analysis of a fast partial pivoting method for structured matrices. Adv. Signal Proc. Algorithms, Proc. of SPIE, T. Luk, ed., 2363 (1995), 266--280.Google ScholarCross Ref
- T. Sasaki and M-T. Noda. Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations. J. Inform. Proces., 12 (1989), 159--168. Google ScholarDigital Library
- T. Sasaki and A. Furukawa. Secondary polynomial remainder sequence and an extension of subresultant theory. J. Inform. Proces., 7 (1984), 175--184.Google Scholar
- T. Sasaki and F. Kako. Computing floating-point Gröbner bases stably. Proc. of SNC'07, ACM Press, 2007, 180--189, Google ScholarDigital Library
- T. Suzuki and T. Sasaki. On Sturm sequence with floating-point number coefficients. RIMS Kokyuroku, 685 (1989), 1--14.Google Scholar
- M. Sanuki and T. Sasaki. Computing approximate GCD in ill-conditioned cases. Proc. of SNC'07, ACM Press, 2007, 170--179. Google ScholarDigital Library
- T. Sasaki and M. Sasaki. Polynomial remainder sequence and approximate GCD. SIGSAM Buletin 31, 1997, 4--10. Google ScholarDigital Library
- A. Terui. An iterative method for calculating approximate GCD of univariate polynomials. Proc. of ISSAC'09, ACM Press, 2009, 351--358. Google ScholarDigital Library
- K. Thull and C. K. Yap. A unified approach to HGCD algorithms for polynomials and integers. Manuscript, Available from http://cs.nyu.edu/cs/faculty/yap/papers/.Google Scholar
- Z. Zeng. The approximate GCD of inexact polynomials part I: a univariate algorithm. Preprint, 2004.Google Scholar
- L. Zhi. Displacement structure in computing the approximate GCD of univariate polynomials. Proc. of ASCM2003 (Asian Symposium on Computer Mathematics), World Scientific, 2003, 288--298.Google ScholarCross Ref
- C. J. Zarowski, X. Ma and F. W. Fairman. QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients. IEEE Trans. Signal Proces., 48(11) (2000), 3042--3051. Google ScholarDigital Library
Index Terms
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
Recommendations
Approximate GCD by bernstein basis, and its applications
ISSAC '20: Proceedings of the 45th International Symposium on Symbolic and Algebraic ComputationFor the given pair of univariate polynomials generated by empirical data hence with a priori error on their coefficients, computing their greatest common divisor can be done by several known approximate GCD algorithms that are usually for polynomials ...
Computing multivariate approximate GCD based on Barnett's theorem
SNC '09: Proceedings of the 2009 conference on Symbolic numeric computationWe present algorithms for multivariate GCD and approximate GCD by modifying Barnett's theorem, which is based on the LU-decomposition of Bézout matrix. Our method is suited for multivariate polynomials with large degrees. Also, we analyze ill-...
Approximate polynomial GCD over integers
Symbolic numeric algorithms for polynomials are very important, especially for practical computations since we have to operate with empirical polynomials having numerical errors on their coefficients. Recently, for those polynomials, a number of ...
Comments