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
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
Journal of Symbolic Computation
Relaxed mltiplication using the middle product
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
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Newton's method and FFT trading
Journal of Symbolic Computation
Relaxed p-adic Hensel lifting for algebraic systems
Proceedings of the 37th International Symposium on Symbolic and Algebraic 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. Here ''almost as quickly'' means that we need to pay a logarithmic overhead. In this paper, we will show how to reduce this logarithmic factor in the case when the constant ring has sufficiently many 2^pth roots of unity.