Algorithme de Bareiss, algorithme des sous-résultants

DOI10.1051/ITA/1996300403191zbMATH Open0868.65026OpenAlexW106379765MaRDI QIDQ3124402FDOQ3124402

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

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

zbMATH Keywords

Gaussian eliminationnumerical examplesdeterminantsBareiss algorithmsubresultant algorithmcomputer testsfraction-free triangularization

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Cites Work

• Title not available (Why is that?)
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Title not available (Why is that?)
• On Euclid's Algorithm and the Theory of Subresultants
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spécialisation de la suite de Sturm et sous-résultants (I)

Cited In (7)

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

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)