Composing power series over a finite ring in essentially linear time
Journal of Symbolic Computation
Modern computer algebra
An algorithm computing the regular formal solutions of a system of linear differential equations
Journal of Symbolic Computation - Special issue on differential algebra and differential equations
Fast algorithms for the Sylvester equation AX − XBT = C
Theoretical Computer Science
Journal of Symbolic Computation
Relaxed mltiplication using the middle product
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
New algorithms for relaxed multiplication
Journal of 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
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Polynomial evaluation and interpolation on special sets of points
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Optimization techniques for small matrix multiplication
Theoretical Computer Science
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
IEEE Transactions on Information Theory
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
Hi-index | 0.00 |
We provide algorithms computing power series solutions of a large class of differential or q-differential equations or systems. Their number of arithmetic operations grows linearly with the precision, up to logarithmic terms.