Rational solutions of linear differential and difference equations with polynomial coefficients
USSR Computational Mathematics and Mathematical Physics
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Hypergeometric solutions of linear recurrences with polynomial coefficients
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
An FFT extension of the elliptic curve method of factorization
An FFT extension of the elliptic curve method of factorization
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
SIAM Journal on Matrix Analysis and Applications
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Greatest factorial factorization and symbolic summation
Journal of Symbolic Computation
Computing Popov and Hermite forms of polynomial matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Modern computer algebra
Challenges of symbolic computation: my favorite open problems
Journal of Symbolic Computation
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The Middle Product Algorithm I
Applicable Algebra in Engineering, Communication and Computing
Multivariate power series multiplication
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Computing the rank and a small nullspace basis of a polynomial matrix
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Fast Lagrange--Newton transformations
Journal of Complexity
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Faster inversion and other black box matrix computations using efficient block projections
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Fast algorithms for multivariate interpolation and evaluation at special points
Journal of Complexity
Hi-index | 0.00 |
We give complexity estimates for the problems of evaluation and interpolation on various polynomial bases. We focus on the particular cases when the sample points form an arithmetic or a geometric sequence, and we discuss applications, respectively, to computations with linear differential operators and to polynomial matrix multiplication.