On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Lazy multiplication of formal power series
ISSAC '97 Proceedings of the 1997 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
Journal of Symbolic Computation
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
New algorithms for relaxed multiplication
Journal of Symbolic Computation
Power series solutions of singular (q)-differential equations
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Relaxing order basis computation
ACM Communications in Computer Algebra
Hi-index | 0.00 |
In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. In this paper, we present a new relaxed multiplication algorithm for the resolution of linear equations. The algorithm has the same asymptotic time complexity as our previous algorithms, but we improve the space overhead in the divide and conquer model and the constant factor in the F.F.T. model.