Recommendations
Cites work
- scientific article; zbMATH DE number 3147675 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 524110 (Why is no real title available?)
- scientific article; zbMATH DE number 1157660 (Why is no real title available?)
- scientific article; zbMATH DE number 953021 (Why is no real title available?)
- A matrix pencil based numerical method for the computation of the GCD of polynomials
- An Inequality About Factors of Polynomials
- Approximate GCD and its application to ill-conditioned algebraic equations
- Best linear common divisors for approximate degree reduction
- Detection and validation of clusters of polynomial zeros
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- On the numerical condition of polynomials in Bernstein form
- Parallel robots.
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
- Products of polynomials in many variables
- Quasi-gcd computations
- Résolution des systèmes d'équations algébriques
- Subresultants and Reduced Polynomial Remainder Sequences
- Zur inhomogenen Eliminationstheorie
Cited in
(65)- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Recursive polynomial remainder sequence and its subresultants
- Extended QRGCD algorithm
- A computational study of ruled surfaces
- Approximate greatest common divisor of several polynomials from Hankel matrices
- Relaxed NewtonSLRA for approximate GCD
- Numerical and symbolical methods for the GCD of several polynomials
- Computing multiple roots of inexact polynomials
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Bernstein-Bézoutian matrices
- Method for finding multiple roots of polynomials
- Polynomial computations for blind image deconvolution
- GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
- Approximate parametrization of plane algebraic curves by linear systems of curves
- A quadratically convergent algorithm for structured low-rank approximation
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- A structured rank-revealing method for Sylvester matrix
- A subdivision method for computing nearest gcd with certification
- The numerical greatest common divisor of univariate polynomials
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Approximate GCD a la dedieu
- Approximate GCD of several univariate polynomials with small degree perturbations
- Computing approximate GCD of multivariate polynomials
- 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
- The ERES method for computing the approximate GCD of several polynomials
- Deterministic unimodularity certification
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis
- Computing GCRDs of approximate differential polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Computing approximate greatest common right divisors of differential polynomials
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- An iterative method for calculating approximate GCD of univariate polynomials
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Multivariate subresultants in roots
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Parametrization of approximate algebraic curves by lines
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Computation of approximate polynomial GCDs and an extension
- Regularization and matrix computation in numerical polynomial algebra
- Parametrization of approximate algebraic surfaces by lines
- The approximate GCD of inexact polynomials
- Approximate least common multiple of several polynomials using the ERES division algorithm
- Distance bounds of \(\varepsilon\)-points on hypersurfaces
- Computing nearest gcd with certification
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- Continuity properties for flat families of polynomials. I: Continuous parametrizations
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- Toward the best algorithm for approximate GCD of univariate polynomials
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces
- Approximate factorization of multivariate polynomials using singular value decomposition
- Overdetermined Weierstrass iteration and the nearest consistent system
- Computing multivariate approximate GCD based on Barnett's theorem
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Approximate polynomial GCD over integers
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Approximate polynomial GCD.
- Validated Root Enclosures for Interval Polynomials with Multiplicities
- Extended companion matrix for approximate GCD
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
- Approximate common divisor problem and continued fractions
This page was built for publication: Certified approximate univariate GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358910)
