Pages that link to "Item:Q4657319"
From MaRDI portal
The following pages link to Approximate factorization of multivariate polynomials via differential equations (Q4657319):
Displayed 16 items.
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- The numerical factorization of polynomials (Q525605) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Computing monodromy via continuation methods on random Riemann surfaces (Q633630) (← 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)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- Symbolic-numeric sparse interpolation of multivariate polynomials (Q5902083) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)