Changes between Initial Version and Version 1 of Ticket #22090, comment 8
 Timestamp:
 01/06/17 14:30:06 (2 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #22090, comment 8
initial v1 1 Still missing is better documentation. As to performance 75% of complicated summations are spent in computation of one symbolic matrix determinant, of which 2/3 is expansions. It is astonishing that the 12x12 matrix determinant from the summation of `(((n^414*n^224*n9) * 2^n / n^2 / (n+1)^2 / (n+2)^2 / (n+3)^2))` needs 4,316 first level expansions, even with the supposedly optimized "enhanced Laplaceexpansion" determinant algorithm used. 1 Still missing is better documentation. As to performance 75% of complicated summations are spent in computation of one symbolic matrix determinant, of which 2/3 is expansions. It is astonishing that the 12x12 matrix determinant from the summation of `(((n^414*n^224*n9) * 2^n / n^2 / (n+1)^2 / (n+2)^2 / (n+3)^2))` needs 4,316 first level expansions, even with the supposedly optimized "enhanced Laplaceexpansion" determinant algorithm used. Resultants should be later computed in Pynac via Singular which apparently uses a subresultant algorithm.