Algorithme de Bareiss, algorithme des sous-résultants

DOI10.1051/ita/1996300403191zbMath0868.65026OpenAlexW106379765MaRDI QIDQ3124402

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

numerical examplesdeterminantsGaussian eliminationBareiss algorithmsubresultant algorithmcomputer testsfraction-free triangularization

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Related Items

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

Cites Work

• Spécialisation de la suite de Sturm et sous-résultants (I)
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• On Euclid's Algorithm and the Theory of Subresultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item