Toward the best algorithm for approximate GCD of univariate polynomials
From MaRDI portal
Publication:1994881
Recommendations
Cites work
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
- Approximate GCD and its application to ill-conditioned algebraic equations
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Approximate polynomial GCD over integers
- Approximate polynomial GCD: small degree and small height perturbations
- Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
- Certified approximate univariate GCDs
- Computing the nearest rank-deficient matrix polynomial
- Extended QRGCD algorithm
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- scientific article; zbMATH DE number 5168246 (Why is no real title available?)
- scientific article; zbMATH DE number 1183040 (Why is no real title available?)
- scientific article; zbMATH DE number 62668 (Why is no real title available?)
- scientific article; zbMATH DE number 953021 (Why is no real title available?)
- scientific article; zbMATH DE number 3309634 (Why is no real title available?)
- New fast Euclidean algorithms
- QR-factorization of displacement structured matrices using a rank structured matrix approach
- Quasi-gcd computations
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Structured matrix based methods for approximate polynomial GCD
- Structured matrix-based methods for polynomial -gcd: analysis and comparisons
- The ERES method for computing the approximate GCD of several polynomials
- The numerical greatest common divisor of univariate polynomials
- Variable projection methods for approximate (greatest) common divisor computations
Cited in
(18)- Approximate GCD and its application to ill-conditioned algebraic equations
- An algorithm for computing certified approximate GCD of n univariate polynomials
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Approximate GCD of several univariate polynomials with small degree perturbations
- On the complexity of computing the greatest common divisor of several univariate polynomials
- Approximate GCD by relaxed NewtonSLRA algorithm
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- Extended QRGCD algorithm
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Approximate polynomial GCD over integers
- Polarimetric Fourier phase retrieval
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
- Approximate affine equivalences of polynomial and trigonometric curves
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
- Relaxed NewtonSLRA for approximate GCD
This page was built for publication: Toward the best algorithm for approximate GCD of univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994881)
