Quasi-gcd computations
From MaRDI portal
Publication:1071503
DOI10.1016/0885-064X(85)90024-XzbMATH Open0586.68031MaRDI QIDQ1071503FDOQ1071503
Authors: Arnold Schönhage 
Publication date: 1985
Published in: Journal of Complexity (Search for Journal in Brave)
Recommendations
algebraic complexityunivariate polynomialsapproximate divisornumerically stable version of Euclid's algorithmworst case upper bound
Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational power of pushdown automata
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- The Computational Complexity of Continued Fractions
- A characterization of parenthesis languages
- Euclid's Algorithm for Large Numbers
- Fast computation of continued fraction expansions.
- Fast computation of GCDs
- Title not available (Why is that?)
Cited In (48)
- A deterministic algorithm for isolating real roots of a real polynomial
- Shifted varieties and discrete neighborhoods around varieties
- A subdivision method for computing nearest gcd with certification
- A general approach to isolating roots of a bitstream polynomial
- Extended QRGCD algorithm
- Relaxed NewtonSLRA for approximate GCD
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Approximate GCD and its application to ill-conditioned algebraic equations
- A quadratically convergent algorithm for structured low-rank approximation
- Approximate polynomial GCD over integers
- Approximate polynomial GCD: small degree and small height perturbations
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Regularization and matrix computation in numerical polynomial algebra
- GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
- Quantified constraints under perturbation
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Computing the polynomial remainder sequence via Bézout matrices
- Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- Certified approximate univariate GCDs
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Toward the best algorithm for approximate GCD of univariate polynomials
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- A companion matrix resultant for Bernstein polynomials
- Computation of approximate polynomial GCDs and an extension
- Ten methods to bound multiple roots of polynomials
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Feasible real random access machines
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Overdetermined Weierstrass iteration and the nearest consistent system
- Fast computation of GCDs
- On efficiently solvable cases of quantum \(k\)-SAT
- On efficiently solvable cases of quantum \(k\)-SAT
- On the complexity of the Descartes method when using approximate arithmetic
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Computing approximate greatest common right divisors of differential polynomials
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Robust HGCD with no backup steps
- The general quasi-order algorithm in number theory
Uses Software
This page was built for publication: Quasi-gcd computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071503)
