Algorithme de Bareiss, algorithme des sous-résultants

DOI10.1051/ITA/1996300403191MaRDI QIDQ3124402zbMATH OpenOpenAlexFDO

Authors Lionel Ducos

Publication date 6 May 1997

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92540

zbMATH Keywords

Gaussian eliminationnumerical examplesdeterminantsBareiss algorithmsubresultant algorithmcomputer testsfraction-free triangularization

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Recommendations

• Subresultants with the Bézout matrix
• Division-free computation of subresultants using Bezout matrices
• Optimizations of the subresultant algorithm
• Subresultant chains using Bézout matrices
• scientific article; zbMATH DE number 1263402

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3922806 (Why is no real title available?)
• scientific article; zbMATH DE number 42630 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• On Euclid's Algorithm and the Theory of Subresultants
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination

Cited in

(7)

• On the complexity of the Lickteig-Roy subresultant algorithm
• Computational schemes for subresultant chains
• Parallelization of triangular decompositions: techniques and implementation
• Multivariate subresultants in roots
• Cauchy index computation
• Determinant polynomial sequences
• Sylvester-Habicht sequences and fast Cauchy index computation

This page was built for publication: Algorithme de Bareiss, algorithme des sous-résultants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3124402)