Subresultants

Sebastiaan Joosten, René Thiemann, Akihisa Yamada

Research output: Contribution to journalArticleAcademic

12 Downloads (Pure)

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.
Original languageEnglish
Number of pages28
JournalArchive of Formal Proofs
Publication statusPublished - 6 Apr 2017

Fingerprint

Subresultants
Greatest common divisor of polynomials
Remainder
Efficient Algorithms
Polynomial
Computing

Cite this

Joosten, S., Thiemann, R., & Yamada, A. (2017). Subresultants. Archive of Formal Proofs.
Joosten, Sebastiaan ; Thiemann, René ; Yamada, Akihisa. / Subresultants. In: Archive of Formal Proofs. 2017.
@article{52f69b787ffa49448d0017e4ed3adf89,
title = "Subresultants",
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 Joosten and Ren{\'e} Thiemann and Akihisa Yamada",
year = "2017",
month = "4",
day = "6",
language = "English",
journal = "Archive of Formal Proofs",
issn = "2150-914x",
publisher = "SourceForge",

}

Joosten, S, Thiemann, R & Yamada, A 2017, 'Subresultants' Archive of Formal Proofs.

Subresultants. / Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa.

In: Archive of Formal Proofs, 06.04.2017.

Research output: Contribution to journalArticleAcademic

TY - JOUR

T1 - Subresultants

AU - Joosten, Sebastiaan

AU - Thiemann, René

AU - Yamada, Akihisa

PY - 2017/4/6

Y1 - 2017/4/6

N2 - 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.

AB - 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.

M3 - Article

JO - Archive of Formal Proofs

JF - Archive of Formal Proofs

SN - 2150-914x

ER -

Joosten S, Thiemann R, Yamada A. Subresultants. Archive of Formal Proofs. 2017 Apr 6.