Timeline for answer to Single computation is fast, but 6 computations are extremely slow by Daniel Huber
Current License: CC BY-SA 4.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2021 at 2:36 | comment | added | Laplacian |
Oh, I also forgot to mention that I am not interested when Sign evaluates to Sign[0]. In other words, I am only interested when t != 0, t1 - t2 != 0, t2 != 0, t1 != 0, d - t1 != 0, d - t2 != 0, -t + t1 != 0, d + t - t1 != 0, d + t - t2 != 0, -t + t2 != 0. Then, the total case is 256.
|
|
| Oct 10, 2021 at 2:15 | comment | added | Laplacian |
I think your 7840 is obtained by $7840=2\times 4\times 4\times 5\times 7\times 7$. However, there is redundancy in some of the 6 terms. For example, for the 4th term, the condition t1-t2 >=0 and True is redundant.
|
|
| Oct 9, 2021 at 18:35 | comment | added | Daniel Huber | Counting and multiplying the different conditions gives 7840 cases. | |
| Oct 9, 2021 at 15:54 | comment | added | Laplacian |
Thanks for your answer. However, it is sad since what I want is to simplify the whole expression into "single" piecewise command. I think this is not too hard, because the total case is $2^8=256$ which is not too large, where 8 comes from the different expressions inside Sign.
|
|
| Oct 9, 2021 at 13:27 | history | answered | Daniel Huber | CC BY-SA 4.0 |