Abstract
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.
| Original language | English |
|---|---|
| Pages | 143-147 |
| Number of pages | 5 |
| Publication status | Published - 1 Dec 2003 |
| Externally published | Yes |
| Event | Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, (ISSAC 2003) - Philadelphia, PA., United States Duration: 3 Aug 2003 → 6 Aug 2003 |
Conference
| Conference | Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, (ISSAC 2003) |
|---|---|
| Country/Territory | United States |
| City | Philadelphia, PA. |
| Period | 3/08/03 → 6/08/03 |
Keywords
- Middle product
- Power series
- Relaxed multiplication