Mathematica Counting Possible Solutions for Linear Equations

AI Thread Summary
The discussion focuses on using the NSolve function to find multiple solutions for a set of linear equations involving variables x1, x2, x3, and x4. The user seeks assistance in determining how often specific combinations of these variables would occur if the equations were executed in a loop 1000 times. There is a suggestion that the Sow and Reap functions could be useful for this purpose, although the user has not yet utilized them. The conversation emphasizes the need for a method to count the frequency of particular solutions from the multiple combinations generated by NSolve.
jemma
Messages
35
Reaction score
0
Hi, I wondered if anyone can help. I have some linear equations in which I've found various possible solutions to the variables using NSolve function. For example, for x1, x2, x3 and x4, it has given me ~14 different possible combinations for each x. Is it possible to do a count so if the equations were run in a loop 1000 times, how often would a particular combination be reached?
 
Physics news on Phys.org
I think that is the purpose of Sow and Reap, but I have never actually used them myself.
 

Similar threads

Replies
2
Views
2K
Replies
1
Views
3K
Replies
5
Views
3K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
6
Views
8K
Replies
1
Views
3K
Back
Top