The following pages link to (Q4227296):
Displayed 31 items.
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Bernstein-Bézoutian matrices (Q598205) (← links)
- Parametrization of approximate algebraic curves by lines (Q598227) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- On real factors of real interval polynomials (Q1025398) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- A robust solution of the generalized polynomial Bézout identity (Q1827508) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Structured low rank approximation (Q1874666) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
- Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Pseudozeros of multivariate polynomials (Q4794655) (← links)
- Symbolic-numeric sparse interpolation of multivariate polynomials (Q5902083) (← links)