The following pages link to (Q4717942):
Displaying 18 items.
- Polynomial GCD derived through monic polynomial subtractions (Q420250) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Continuity properties for flat families of polynomials. I: Continuous parametrizations (Q1408354) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- (Q4250163) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
