Timeline for Automated decomposition of a large symbolic matrix for faster determinant calculation
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2022 at 17:30 | history | edited | user293787 | CC BY-SA 4.0 |
added 306 characters in body
|
| Oct 25, 2022 at 17:26 | comment | added | user293787 |
I first looked at ListPlot[Most[Map[First,ArrayRules[M]]]]. I then used the code G=Most[Map[First,ArrayRules[M]]]; next1[{x1_,x2_,y1_,y2_}]:=With[{X=Cases[G,{x1|x2,Except[y1|y2]}]}, Join[DeleteDuplicates[X[[;;,1]]],DeleteDuplicates[X[[;;,2]]]]]; next2[{x1_,x2_,y1_,y2_}]:=With[{X=Cases[G,{Except[x1|x2],y1|y2}]}, Join[DeleteDuplicates[X[[;;,1]]],DeleteDuplicates[X[[;;,2]]]]]; next[{x1_,x2_,y1_,y2_}]:=next2[next1[{x1,x2,y1,y2}]]; GX=NestList[next,{33,36,3,4},21]; {Flatten[GX[[;;,{1,2}]]],Flatten[GX[[;;,{3,4}]]]}. I am not going to explain how it works.
|
|
| Oct 25, 2022 at 16:55 | comment | added | charmin | Thanks. How did you obtain $p_1$ and $p_2$? | |
| Oct 25, 2022 at 16:43 | history | answered | user293787 | CC BY-SA 4.0 |