research-article

Sparse Multiplication of Multivariate Linear Differential Operators

Authors:

Mark Giesbrecht,

Qiao-Long Huang,

Éric SchostAuthors Info & Claims

ISSAC '21: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation

Pages 155 - 162

https://doi.org/10.1145/3452143.3465527

Published: 18 July 2021 Publication History

Abstract

We propose a randomized algorithm for multiplication in the ring of non-commutative polynomials Κ [x₁,…,x_n]{#948;₁,…,δ_n}, where δ _i=x_i∂over∂ x_i, dedicated to sparse inputs. The complexity of our algorithm is polynomial in the input size and on an a priori sparsity bound for the output.

References

[1]

Andrew Arnold and Daniel S. Roche. 2015. Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication. In Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06-09, 2015. ACM, 29--36.

Digital Library

[2]

Martin E. Avendano, Teresa Krick, and Ariel Pacetti. 2006. Newton-Hensel Interpolation Lifting. Foundations of Computational Mathematics, Vol. 6, 1 (2006), 82--120.

Digital Library

[3]

Michael Ben-Or and Prasoon Tiwari. 1988. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM, 301--309.

Digital Library

[4]

Alexandre Benoit, Alin Bostan, and Joris van der Hoeven. 2012. Quasi-optimal multiplication of linear differential operators. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20--23, 2012. IEEE, 524--530.

[5]

Alin Bostan, Frédéric Chyzak, and Nicolas Le Roux. 2008. Products of ordinary differential operators by evaluation and interpolation. In Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings. ACM, 23--30.

[6]

David G. Cantor and Erich Kaltofen. 1991. On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Informatica, Vol. 28, 7 (1991), 693--701.

Digital Library

[7]

Xavier Caruso and Jérémy Le Borgne. 2017. Fast multiplication for skew polynomials. In Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. ACM, 77--84.

Digital Library

[8]

Don Coppersmith and Shmuel Winograd. 1990. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, Vol. 9, 3 (1990), 251--280.

Digital Library

[9]

Marie Riche de Prony. 1795. Essai expérimental et analytique sur les lois de la Dilatabilité des fluides élastiques et sur celles de la Force expansive de la vapeur de l'eau et de la vapeur de l'alkool, à différentes températures. Journal de l'École polytechnique ( 1795), 24--75.

[10]

Franccois Le Gall. 2014. Powers of tensors and fast matrix multiplication. In International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014. ACM Press, 296--303.

Digital Library

[11]

Mark Giesbrecht, Qiao-Long Huang, and Éric Schost. 2020. Sparse multiplication for skew polynomials. In ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020. ACM, 194--201.

Digital Library

[12]

Qiao-Long Huang. 2019. Sparse Polynomial Interpolation over Fields with Large or Zero Characteristic. In Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, ISSAC 2019, Beijing, China, July 15-18, 2019. ACM, 219--226.

Digital Library

[13]

Qiao-Long Huang. 2020. Sparse Polynomial Interpolation Based on Derivative. https://arxiv.org/abs/2002.03708

[14]

Erich Kaltofen and Wen-shin Lee. 2003. Early termination in sparse interpolation algorithms. J. Symb. Comput., Vol. 36, 3-4 (2003), 365--400.

Digital Library

[15]

Erich Kaltofen and Lakshman Yagati. 1988. Improved sparse multivariate polynomial interpolation algorithms. In Symbolic and Algebraic Computation, International Symposium ISSAC'88, Rome, Italy, July 4-8, 1988, Proceedings. Springer, 467--474.

[16]

Thorsten Kleinjung and Benjamin Wesolowski. 2019. Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. (2019). arxiv: 1906.10668 http://arxiv.org/abs/1906.10668

[17]

Daniel S. Roche. 2018. What Can (and Can't) we Do with Sparse Polynomials?. In Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018. ACM.

Digital Library

[18]

Victor Shoup. 1988. New Algorithms for Finding Irreducible Polynomials over Finite Fields. In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988. IEEE Computer Society, 283--290.

Digital Library

[19]

Victor Shoup. 1994. Fast construction of irreducible polynomials over finite fields. Journal of Symbolic Computation, Vol. 17, 5 (1994), 371--391.

Digital Library

[20]

Joris van der Hoeven. 2002. FFT-like multiplication of linear differential operators. Journal of Symbolic Computation, Vol. 33, 1 (2002), 123--127.

Digital Library

[21]

Joris van der Hoeven and Grégoire Lecerf. 2012. On the Complexity of Multivariate Blockwise Polynomial Multiplication. In International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012 (ISSAC'12). Association for Computing Machinery, 211--218.

[22]

Joris van der Hoeven and Gré goire Lecerf. 2014. Sparse Polynomial Interpolation in Practice. ACM Commun. Comput. Algebra, Vol. 48, 3/4 (2014), 187--191.

Digital Library

[23]

Joris van der Hoeven and Michael B. Monagan. 2020. Implementing the Tangent Graeffe Root Finding Method. In Mathematical Software - ICMS 2020 - 7th International Conference, Braunschweig, Germany, July 13-16, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12097). Springer, 482--492.

[24]

Richard Zippel. 1990. Interpolating polynomials from their values. Journal of Symbolic Computation, Vol. 9, 3 (1990), 375--403.

Digital Library

Cited By

Ding XWang DXiao FZheng X(2024)An Algorithm for Computing Greatest Common Right Divisors of Parametric Ore PolynomialsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669694(226-233)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669694
van der Hoeven JMaza MZhi L(2022)On the Complexity of Symbolic ComputationProceedings of the 2022 International Symposium on Symbolic and Algebraic Computation10.1145/3476446.3535493(3-12)Online publication date: 4-Jul-2022
https://dl.acm.org/doi/10.1145/3476446.3535493

Index Terms

Sparse Multiplication of Multivariate Linear Differential Operators
1. Computing methodologies
  1. Symbolic and algebraic manipulation

Recommendations

Revisit Sparse Polynomial Interpolation Based on Randomized Kronecker Substitution
Computer Algebra in Scientific Computing
Abstract
In this paper, a new reduction based interpolation algorithm for general black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce the black-box ...
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation
SNC '07: Proceedings of the 2007 international workshop on Symbolic-numeric computation

The numerical quotient-difference algorithm,or the qd-algorithm, can be used for determining the poles of a meromorphic function directly from its Taylor coeffcients. We show that the poles computed in the qd-algorithm, regardless of their ...
Error-Correcting Sparse Interpolation in the Chebyshev Basis
ISSAC '15: Proceedings of the 2015 ACM International Symposium on Symbolic and Algebraic Computation

We present an error-correcting interpolation algorithm for a univariate black-box polynomial that has a sparse representation using Chebyshev polynomials as a term basis. Our algorithm assumes that an upper bound on the number of erroneous evaluations is ...

Comments

Information & Contributors

Information

Published In

ISSAC '21: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation

July 2021

379 pages

ISBN:9781450383820

DOI:10.1145/3452143

General Chair:
Frédéric Chyzak
Inria, France
,
Program Chair:
George Labahn
University of Waterloo, Canada

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Natural Science Foundation of China

Conference

ISSAC '21

Sponsor:

SIGSAM

ISSAC '21: International Symposium on Symbolic and Algebraic Computation

July 18 - 23, 2021

Virtual Event, Russian Federation

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
55
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ding XWang DXiao FZheng X(2024)An Algorithm for Computing Greatest Common Right Divisors of Parametric Ore PolynomialsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669694(226-233)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669694
van der Hoeven JMaza MZhi L(2022)On the Complexity of Symbolic ComputationProceedings of the 2022 International Symposium on Symbolic and Algebraic Computation10.1145/3476446.3535493(3-12)Online publication date: 4-Jul-2022
https://dl.acm.org/doi/10.1145/3476446.3535493

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten