Beating binary powering for polynomial matrices
From MaRDI portal
Publication:6060351
DOI10.1145/3597066.3597118arXiv2302.04299OpenAlexW4320538347MaRDI QIDQ6060351
Sergey Yurkevich, Vincent Neiger, Alin Bostan
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.04299
computational complexitylinear differential equationsFFTalgebraic algorithmsrational power seriescreative telescopingbinary poweringC-finite sequencepolynomial matrices.
Cites Work
- A fast approach to creative telescoping
- The method of differentiating under the integral sign
- The diagonal of a D-finite power series is D-finite
- Differentiably finite power series
- On fast multiplication of polynomials over arbitrary algebras
- Construction of the Jordan decomposition by means of Newton's method
- Construction of a fundamental matrix solution at a singular point of the first kind by means of the SN decomposition of matrices
- An extension of Zeilberger's fast algorithm to general holonomic functions
- On computing the coefficients of bivariate holonomic formal series
- Integer multiplication in time \(O(n\log n)\)
- Constructing reductions for creative telescoping. The general differentially finite case
- Complexity of creative telescoping for bivariate rational functions
- Hermite reduction and creative telescoping for hyperexponential functions
- Creative telescoping for rational functions using the griffiths
- On the Computation of An
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
- Bounds for Substituting Algebraic Functions into D-finite Functions
- Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants
- An Efficient Formula for Linear Recurrences
- Fast computation of common left multiples of linear ordinary differential operators
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- An Algorithm for Evaluation of Remote Terms in A Linear Recurrence Sequence
- Multivariate ore polynomials in SageMath
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
