Subresultant chains using Bézout matrices
From MaRDI portal
Publication:2109975
DOI10.1007/978-3-031-14788-3_3OpenAlexW4300536553MaRDI QIDQ2109975FDOQ2109975
Mohammadali Asadi, D. J. Jeffrey, Marc Moreno Maza, Alexander Brandt
Publication date: 21 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_3
Recommendations
- Computational schemes for subresultant chains
- Subresultants with the Bézout matrix
- scientific article; zbMATH DE number 1273644
- The basic polynomial algebra subprograms
- Basic polynomial algebra subprograms
- The basic polynomial algebra subprograms
- A new approach for constructing subresultants
- Division-free computation of subresultants using Bezout matrices
- Subresultants revisited.
- On computing the resultant of generic bivariate polynomials
Cites Work
- The RegularChains library in Maple 10
- Title not available (Why is that?)
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Modern computer algebra
- Title not available (Why is that?)
- LU factoring of non-invertible matrices
- Various new expressions for subresultants and their applications
- Optimizations of the subresultant algorithm
- Algorithms for computing triangular decomposition of polynomial systems
- Bezout matrices, subresultant polynomials and parameters
- Division-free computation of subresultants using Bezout matrices
- Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
- A new approach for constructing subresultants
- Subresultants with the Bézout matrix
- On the parallelization of triangular decompositions
- Computational schemes for subresultant chains
- Title not available (Why is that?)
Cited In (5)
Uses Software
This page was built for publication: Subresultant chains using Bézout matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109975)
