scientific article; zbMATH DE number 480305

MaRDI QIDQ4274079zbMATH OpenFDO

Authors Alkivadis G. Akritas

Publication date 20 December 1993

zbMATH Keywords

Dodgson's methodgreatest common divisorresultant

Mathematics Subject Classification ID

History of mathematics in the 19th century (01A55) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1512700
• A note on resultants
• On the remainders obtained in finding the greatest common divisor of two polynomials
• Numerical Analysis and Its Applications
• A new view on the numerical computation of the greatest common divisor of two polynomials.

Cited in

(12)

• The polynomial method for random matrices
• A note on resultants
• On the complexity of the Lickteig-Roy subresultant algorithm
• Matrix computation of subresultant polynomial remainder sequences in integral domains
• An improvement of Euclid's algorithm.
• scientific article; zbMATH DE number 67107 (Why is no real title available?)
• On the remainders obtained in finding the greatest common divisor of two polynomials
• Some results on counting roots of polynomials and the Sylvester resultant
• The resultant, the discriminant, and the derivative of generalized Fibonacci polynomials
• On a new class of BDF and IMEX schemes for parabolic type equations
• A theoretical study of the objective-functional for joint eigen-decomposition of matrices
• A new class of accelerated generalized BDF schemes for parabolic type equations

This page was built for publication:

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