Solving Parametric Linear Systems Using Sparse Rational Function Interpolation

DOI10.1007/978-3-031-41724-5_13MaRDI QIDQ6496607zbMATH OpenFDO

Authors Ayoola Jinadu, Michael Monagan

Publication date 3 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-41724-5_13

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A fast parallel sparse polynomial GCD algorithm
• A new interpolation algorithm for computing dixon resultants
• An interpolation algorithm for computing Dixon resultants
• Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• scientific article; zbMATH DE number 3147675 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• Lazy and Forgetful Polynomial Arithmetic and Applications
• Maximal quotient rational reconstruction
• Sparse interpolation of multivariate rational functions
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Systems of distinct representatives and linear algebra
• The Berlekamp-Massey algorithm revisited
• The Evaluation of Determinants by Expansion by Minors and the General Problem of Substitution

This page was built for publication: Solving Parametric Linear Systems Using Sparse Rational Function Interpolation

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