Fast matrix computation of subresultant polynomial remainder sequences
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4049035
- Matrix computation of subresultant polynomial remainder sequences in integral domains
- scientific article; zbMATH DE number 6868511
- scientific article; zbMATH DE number 3922806
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
Cited in
(18)- Theory of multiple polynomial remainder sequence
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- On fast computation of a polynomial in the Frobenius matrix
- On the complexity of the Lickteig-Roy subresultant algorithm
- A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
- Matrix computation of subresultant polynomial remainder sequences in integral domains
- Improved polynomial remainder sequences for Ore polynomials
- Computing the polynomial remainder sequence via Bézout matrices
- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
- Lazy and Forgetful Polynomial Arithmetic and Applications
- scientific article; zbMATH DE number 4049035 (Why is no real title available?)
- scientific article; zbMATH DE number 4096685 (Why is no real title available?)
- A fast recursive orthogonalization scheme for the Macaulay matrix
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- scientific article; zbMATH DE number 6868511 (Why is no real title available?)
- Sylvester-Habicht sequences and fast Cauchy index computation
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
This page was built for publication: Fast matrix computation of subresultant polynomial remainder sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701991)