Pages that link to "Item:Q385007"
From MaRDI portal
The following pages link to GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007):
Displaying 17 items.
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- An improvement in the lattice construction process of approximate polynomial GCD over integers (Q2819617) (← links)
- A subresultant based subspace method for the computation of polynomial GCDs (Q2819622) (← links)
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures (Q2819639) (← links)
- Computing GCRDs of approximate differential polynomials (Q2819716) (← links)
- An iterative method for calculating approximate GCD of univariate polynomials (Q2883839) (← links)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (Q5120202) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- Structured low-rank approximation for nonlinear matrices (Q6109889) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
