A new interpolation algorithm for computing dixon resultants-Reference-Cited by-同舟云学术

A new interpolation algorithm for computing dixon resultants

Published:2022-06 Issue:2 Volume:56 Page:88-91
ISSN:1932-2240
Container-title:ACM Communications in Computer Algebra
language:en
Short-container-title:ACM Commun. Comput. Algebra

Author:

Jinadu Ayoola¹,Monagan Michael¹

Affiliation:

1. Simon Fraser University, Burnaby, Canada

Abstract

Given a system of polynomial equations with parameters, we present a new interpolation algorithm for computing its Dixon resultant R. Our algorithm interpolates the monic square-free factors of R one at a time from monic univariate polynomial images of R using sparse rational function interpolation. We have implemented our new Dixon resultant algorithm in Maple with some subroutines coded in C for efficiency. Experimental results show that our algorithm significantly outperforms Zippel's sparse interpolation algorithm.

Publisher

Association for Computing Machinery (ACM)

Subject

Microbiology (medical),Immunology,Immunology and Allergy

Link

https://dl.acm.org/doi/pdf/10.1145/3572867.3572883

Reference9 articles.

1. A deterministic algorithm for sparse multivariate polynomial interpolation

2. Sparse interpolation of multivariate rational functions

3. On a Form of the Eliminant of Two Quantics

4. Gerhard , J. , and Von zur Gathen , J. : Modern Computer Algebra . Cambridge University Press , 2013 . Gerhard, J., and Von zur Gathen, J.: Modern Computer Algebra. Cambridge University Press, 2013.

5. Jinadu , A. , and Monagan , M . : An Interpolation Algorithm for computing Dixon Resultants. Submitted to CASC '2022 . Jinadu, A., and Monagan, M. : An Interpolation Algorithm for computing Dixon Resultants. Submitted to CASC '2022.