Tag Info

New answers tagged

2

Assuming standard BOM structures from MRP Systems. boms = {{"Head", "Component", "Qty"}, {1., 2., 10.}, {1., 3., 20.}, {1., 4., 30.}, {2., 5., 10.}, {2., 6., 20.}, {2., 7., 30.}, {7., 8., 40.}, {8., 9., 50.}, {9., 10., 60.}, {9., 11., 70.}}; partNames = {"Gun", "Body", "Barrel", "Silencer", "Stock", "Lock", "Trigger Kit", "Gizmo A", ...


2

I think this is what you want: g = Graph[chainParts]; test = VertexOutComponent[g, #] & /@ Complement[Keys @ chainParts, Values @ chainParts]; Sort[chains] === Sort[test] True See: How to find all vertices reachable from a start vertex following directed edges?


2

From Introduction to Local Minimization: With Method -> Automatic, the Wolfram Language uses the quasi-Newton method unless the problem is structurally a sum of squares, in which case the Levenberg-Marquardt variant of the Gauss-Newton method is used. To confirm, I use the first example in FindFit >> Options >> Method and compare the output for ...


1

Making some suggestions for you code... Do[matrixtransformer[2^(i - 1) - m] = N[1/2^i,20], {i, Floor[Log[2, size]]}]; Note that I've used N[] for the values. Since we are not interested in the exact values using N[] reduces time. And for the second part, you can use MatrixPower[] instead of iterating the multiplication. Its quiet fast. But the big ...


0

Ok, I'm not sure if I'm breaking any protocol by answering my own question but it wouldn't fit in the comments. I tried to work on the answers you guys gave in the comments. So I came up with the argument that DumpsterDoofus gave, creating a list that gives me the number of times that some specific combination of the coefficients shows up. list = ...



Top 50 recent answers are included