Fast rational function reconstruction

DOI10.1145/1145768.1145801MaRDI QIDQ2958986zbMATH OpenOpenAlexFDO

Authors Sara Khodadad, Michael Monagan

Publication date 3 February 2017

Published in Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL http://summit.sfu.ca/item/10240

zbMATH Keywords

fast Euclidean algorithmmodular algorithmsrational reconstruction

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Efficient rational number reconstruction
• Maximal quotient rational reconstruction
• New fast Euclidean algorithms
• Fast computation of GCDs

Cited in

(10)

• Efficient rational number reconstruction
• An interpolation algorithm for computing Dixon resultants
• Reconstructing rational functions with \texttt{FireFly}
• Modification of an algorithm for selected terms of the integer extended Euclidean matrix sequence
• scientific article; zbMATH DE number 1254273 (Why is no real title available?)
• Acceleration of Euclidean algorithm and extensions
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Vector rational number reconstruction
• Half-GCD and fast rational recovery
• Sparse interpolation of multivariate rational functions

Describes a project that uses

Uses Software

• ffmodstd

This page was built for publication: Fast rational function reconstruction

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