Quasi-GCD computations

Arnold Schönhage

Type: Article

Publication Date: 1985-10-01

Citations: 129

DOI: https://doi.org/10.1016/0885-064x(85)90024-x

View Publication

Locations

Journal of Complexity - View

Similar Works

Action	Title	Year	Authors
+	Optimizing the half-gcd algorithm	2022	Joris van der Hoeven
+	GPGCD: An iterative method for calculating approximate GCD of univariate polynomials	2012	Akira Terui
+	Enhancing the Power of Cardinal's Algorithm	2016	Victor Y. Pan
+	Faster Integer Points Counting in Parametric Polyhedra	2023	D. Gribanov D. S. Malyshev Pãnos M. Pardalos
+ PDF Chat	On a new algorithm for computing GCD of integer numbers	2020	Ishmukhametov ST Mubarakov BG Rubtsova RG Arkan Mohammed Al Khalidi
+	Approximate polynomial <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="normal"><mml:mi>gcd</mml:mi></mml:mstyle></mml:math>: Small degree and small height perturbations	2010	Joachim von zur Gathen Maurice Mignotte Igor E. Shparlinski
+	New Acceleration of Nearly Optimal Univariate Polynomial Root-findERS	2018	Victor Y. Pan
+	Fast Evaluation of Real and Complex Polynomials	2022	Ramona Anton Nicolae Mihalache François Vigneron
+	Fast evaluation and root finding for polynomials with floating-point coefficients	2023	Rémi Imbach Guillaume Moroz
+	In-place fast polynomial modular remainder	2024	Jean‐Guillaume Dumas Bruno Grenet
+	Propiedades algebraicas de los ideales asociados a hipergrafos	2012	Alix Enríquez V. Guillén Guerrero
+ PDF Chat	GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials	2010	Akira Terui
+	Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms	1974	Alfonso Miola David Y. Y. Yun
+	The Euclidean algorithm	2011	Paola Boito
+ PDF Chat	New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems	2022	Guillaume Moroz
+	A note on the paper by Murat Cenk and Ferruh Ozbudak “Multiplication of polynomials modulo <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>”, Theoret. Comput. Sci. 412 (2011) 3451–3462	2011	Victor Y. Pan
+	Semi-numerical absolute factorization of polynomials with integer coefficients	2004	David Rupprecht
+	Generalized companion matrix for approximate GCD	2011	Paola Boito Olivier Ruatta
+	Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)	2014	Victor Y. Pan Elias Tsigaridas
+	Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)	2014	Victor Y. Pan Elias Tsigaridas

Works That Cite This (55)

Action	Title	Year	Authors
+ PDF Chat	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation	2015	Éric Schost Pierre-Jean Spaenlehauer
+	Overdetermined Weierstrass iteration and the nearest consistent system	2014	Olivier Ruatta Mark Sciabica Ágnes Szántó
+	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation	2013	Éric Schost Pierre-Jean Spaenlehauer
+ PDF Chat	Computing Approximate Greatest Common Right Divisors of Differential Polynomials	2019	Mark Giesbrecht Joseph Haraldson Erich Kaltofen
+	Structured Low Rank Approximation of a Sylvester Matrix	2007	Erich Kaltofen Zhengfeng Yang Lihong Zhi
+	Symbolic-Numeric Computation	2007	Dongming Wang Lihong Zhi
+	Survey on the theory and applications of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml26" display="inline" overflow="scroll" altimg="si8.gif"><mml:mi>μ</mml:mi></mml:math>-bases for rational curves and surfaces	2017	Xiaohong Jia Xiaoran Shi Falai Chen
+	Structured Low Rank Approximation of a	2007	Dongxia Sun Lihong Zhi
+ PDF Chat	Structured Low Rank Approximation of a Bezout Matrix	2007	Dongxia Sun Lihong Zhi
+	Fast Low Rank Approximation of a Sylvester Matrix by Structured Total Least Norm	2005	Bingyu Li Zhengfeng Yang Lihong Zhi

Works Cited by This (4)

Action	Title	Year	Authors
+	Schnelle Berechnung von Kettenbruchentwicklungen	1971	Arnold Schönhage
+	Fast solution of toeplitz systems of equations and computation of Padé approximants	1980	Richard P. Brent Fred G. Gustavson David Y. Y. Yun
+	Euclid's Algorithm for Large Numbers	1938	D. H. Lehmer
+	Euclid's Algorithm for Large Numbers	1938	D. H. Lehmer