Pages that link to "Item:Q969304"
From MaRDI portal
The following pages link to The ERES method for computing the approximate GCD of several polynomials (Q969304):
Displaying 14 items.
- Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163) (← links)
- On the zeros of blocked time-invariant systems (Q386249) (← links)
- Approximate zero polynomials of polynomial matrices and linear systems (Q389575) (← links)
- A subspace method for the computation of the GCD of polynomials (Q1361353) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- A hybrid method for computing the intersection and tangency points of plane curves (Q2250221) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
- Further numerical aspects of the ERES algorithm for the computation of the greatest common divisor of polynomials and comparison with other existing methodologies (Q2785714) (← links)
- A subresultant based subspace method for the computation of polynomial GCDs (Q2819622) (← 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)
