Quasi-gcd computations
From MaRDI portal
Publication:1071503
Recommendations
Cites work
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 3936514 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- A characterization of parenthesis languages
- Euclid's Algorithm for Large Numbers
- Fast computation of GCDs
- Fast computation of continued fraction expansions.
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- On the computational power of pushdown automata
- The Computational Complexity of Continued Fractions
Cited in
(47)- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Approximate GCD and its application to ill-conditioned algebraic equations
- A deterministic algorithm for isolating real roots of a real polynomial
- Extended QRGCD algorithm
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Fast computation of GCDs
- The general quasi-order algorithm in number theory
- 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
- A quadratically convergent algorithm for structured low-rank approximation
- Shifted varieties and discrete neighborhoods around varieties
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- A subdivision method for computing nearest gcd with certification
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
- Approximate polynomial GCD: small degree and small height perturbations
- Feasible real random access machines
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- A general approach to isolating roots of a bitstream polynomial
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Computing approximate greatest common right divisors of differential polynomials
- Certified approximate univariate GCDs
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- A companion matrix resultant for Bernstein polynomials
- Computation of approximate polynomial GCDs and an extension
- On the complexity of the Descartes method when using approximate arithmetic
- Regularization and matrix computation in numerical polynomial algebra
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- Quantified constraints under perturbation
- Ten methods to bound multiple roots of polynomials
- Computing the polynomial remainder sequence via Bézout matrices
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Robust HGCD with no backup steps
- Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
- Toward the best algorithm for approximate GCD of univariate polynomials
- On efficiently solvable cases of quantum \(k\)-SAT
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces
- Overdetermined Weierstrass iteration and the nearest consistent system
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials
- Approximate polynomial GCD over integers
- On efficiently solvable cases of quantum \(k\)-SAT
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)
