Cited By
View all- Nagasaka K(2020)Approximate square-free part and decompositionJournal of Symbolic Computation10.1016/j.jsc.2020.08.004Online publication date: Aug-2020
Seeking better algorithms for approximate GCD
Pages 15 - 17
Abstract
We are interested in seeking better algorithms by just slightly updating and combining the well-known algorithms for the following well-known problem in Symbolic-Numeric Computations.
References
[1]
D. A. Bini and P. Boito. Structured matrix-based methods for polynomial ϵ-gcd: Analysis and comparisons. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC '07, pages 9--16, New York, NY, USA, 2007. ACM.
[2]
P. Boito. Structured Matrix Based Methods for Approximate GCD. Ph.D. Thesis. Department of Mathematics, University of Pisa, Italia, 2007.
[3]
R. M. Corless, S. M. Watt, and L. Zhi. QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Process., 52(12):3394--3402, 2004.
[4]
K. Nagasaka and T. Masui. Extended qrgcd algorithm. In Proceedings of the 15th International Workshop on Computer Algebra in Scientific Computing - Volume 8136, CASC 2013, pages 257--272, New York, NY, USA, 2013. Springer-Verlag New York, Inc.
[5]
Z. Zeng. The numerical greatest common divisor of univariate polynomials. In Randomization, relaxation, and complexity in polynomial equation solving, volume 556 of Contemp. Math., pages 187--217. Amer. Math. Soc., Providence, RI, 2011.
- Seeking better algorithms for approximate GCD
Recommendations
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 ...
Algorithms for polynomial GCD computation over algebraic function fields
ISSAC '04: Proceedings of the 2004 international symposium on Symbolic and algebraic computationLet L be an algebraic function field in k ≥ 0 parameters t;1;, ..., t;k;. Let f;1;, f;2; be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first, a modular GCD algorithm, is an extension of the modular GCD algorithm of ...
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 ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2017 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 May 2017
Published in SIGSAM-CCA Volume 51, Issue 1
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 63Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Dec 2024
Other Metrics
Citations
Cited By
View all- Nagasaka K(2020)Approximate square-free part and decompositionJournal of Symbolic Computation10.1016/j.jsc.2020.08.004Online publication date: Aug-2020
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in