Subresultants
Authors:
- Joosten, Sebastiaan J. C.
- Thiemann, René
- Yamada, Akihisa
Published in: Archive of Formal Proofs
https://www.isa-afp.org/entries/Subresultants.html
Abstract:
We formalize the theory of subresultants and the subresultant polynomial remainder sequence as described by Brown and Traub. As a result, we obtain efficient certified algorithms for computing the resultant and the greatest common divisor of polynomials.
BibTeX entry:
@article{Joosten17,
abstract = {We formalize the theory of subresultants and the subresultant polynomial remainder sequence as described by Brown and Traub. As a result, we obtain efficient certified algorithms for computing the resultant and the greatest common divisor of polynomials.},
author = {Sebastiaan Jozef Christiaan Joosten and Ren{\'e} Thiemann and Akihisa Yamada},
bdsk-url-1 = {https://www.isa-afp.org/entries/Subresultants.html},
day = {6},
issn = {2150-914x},
journal = {Archive of Formal Proofs},
language = {English},
month = {4},
publisher = {SourceForge},
title = {Subresultants},
url = {https://www.isa-afp.org/entries/Subresultants.html},
year = {2017}
}