Timeline for Optimising coefficient finding functions
Current License: CC BY-SA 3.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 9:23 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Feb 25, 2015 at 19:24 | vote | accept | martin | ||
| Feb 22, 2015 at 17:32 | history | tweeted | twitter.com/#!/StackMma/status/569550343345975296 | ||
| Feb 22, 2015 at 11:08 | answer | added | martin | timeline score: 3 | |
| Feb 19, 2015 at 9:46 | history | edited | martin | CC BY-SA 3.0 |
edited body
|
| Feb 18, 2015 at 23:15 | history | edited | martin | CC BY-SA 3.0 |
deleted 22 characters in body
|
| Feb 18, 2015 at 22:59 | history | edited | martin | CC BY-SA 3.0 |
added 702 characters in body
|
| Feb 17, 2015 at 10:06 | comment | added | ciao | See the non-answer answer for now, need to hit the hay, will ponder the core problem and the rest of your code this week. | |
| Feb 17, 2015 at 10:05 | answer | added | ciao | timeline score: 5 | |
| Feb 17, 2015 at 9:35 | comment | added | martin |
@rasher that sounds great - 30-100X sounds good to me :) re MSE, I have asked previously, but will try to word better. Meanwhile I will look up groupfunctions on MMA. I don't know re variables - I have just gone with that safe (and time consuming) option where var=ipow+pow using your definitions from the last question.
|
|
| Feb 17, 2015 at 7:43 | comment | added | ciao | Also, might be worthwhile to query on Math.StackExchange - see if someone there is expert in the area and might have a short-cut method for this kind of coefficient gathering. I've also got a sneaking suspicion the group theoretical functions in Mathematica might have a use here. | |
| Feb 17, 2015 at 7:40 | comment | added | ciao | OK, a quick stab at this netted 30-100X faster than CoefficientRules on 5 variables, "internal" powers between 2 and 5, "external" powers between 2 and 5. I'm verifying correctness (using a different method, I don't think the mathematical trickery used earlier applies here). Rather than decode the code and the paper involved (interesting article, BTW), can you specify some useful to you upper bounds on number of vars, maximum "internal" and "external" powers, and if the powers are disjoint, or disjoint for internal/external, or.... this will help with deciding on which routes to pursue. | |
| Feb 17, 2015 at 0:07 | history | edited | martin | CC BY-SA 3.0 |
added 917 characters in body
|
| Feb 16, 2015 at 23:07 | history | edited | martin | CC BY-SA 3.0 |
deleted 125 characters in body
|
| Feb 16, 2015 at 22:57 | history | edited | martin | CC BY-SA 3.0 |
added 34 characters in body
|
| Feb 16, 2015 at 22:37 | history | edited | martin | CC BY-SA 3.0 |
deleted 79 characters in body
|
| Feb 16, 2015 at 22:32 | history | edited | martin | CC BY-SA 3.0 |
added 248 characters in body
|
| Feb 16, 2015 at 22:24 | comment | added | ciao | Nice question, +1. I recall this work deals with some partition experimentation, perhaps add info. on what these structures are (e.g., "I'm looking at counting how many ways foo in sets of bar can be partitioned into baz sets...") might lead to more compact solutions. | |
| Feb 16, 2015 at 21:48 | history | edited | martin | CC BY-SA 3.0 |
added 26 characters in body
|
| Feb 16, 2015 at 21:25 | history | asked | martin | CC BY-SA 3.0 |