skip to main content
column

Revisiting QRGCD and comparison with ExQRGCD

Published: 28 January 2014 Publication History

Abstract

No abstract available.

References

[1]
D. A. Bini and P. Boito. A fast algorithm for approximate polynomial GCD based on structured matrix computations. In Numerical methods for structured matrices and applications, volume 199 of Oper. Theory Adv. Appl., pages 155--173. Birkhäuser Verlag, Basel, 2010.
[2]
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.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra
ACM Communications in Computer Algebra  Volume 47, Issue 3/4
September/December 2013
116 pages
ISSN:1932-2232
EISSN:1932-2240
DOI:10.1145/2576802
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2014
Published in SIGSAM-CCA Volume 47, Issue 3/4

Check for updates

Qualifiers

  • Column

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 41
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media