Pages that link to "Item:Q1822238"
From MaRDI portal
The following pages link to A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238):
Displaying 12 items.
- A simple proof of the validity of the reduced prs algorithm (Q1099223) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Fast inversion of Hankel and Toeplitz matrices (Q1186587) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Matrix computation of subresultant polynomial remainder sequences in integral domains (Q1904349) (← links)
- An alternative algorithm for computing the pseudo-remainder of multivariate polynomials (Q2489188) (← links)
- (Q4226976) (← links)
- (Q4508389) (← links)
- (Q4639978) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- Numerical Analysis and Its Applications (Q5710620) (← links)
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter (Q5930921) (← links)
