Timeline for System of diophantine equations with restricted set of solutions [closed]
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2016 at 23:52 | comment | added | Gerhard Paseman | If you view each component as an interval of ratios (x/B) where the interval represents the uncertainty in actual values, the target value will be a mediant sum (x/y mediant z/w is (x+y)/(z+w) and lies between the two) of values coming from the intervals, and the best you can conclude is that some components may have a higher than target ratio and some a lower than target ratio. Even knowing X_full and B_full and i does not help much when i is large. Can you get X and B for some subcircuits? Gerhard "Maybe Break Into Smaller Problems" Paseman, 2016.05.29. | |
| May 29, 2016 at 22:46 | comment | added | Gerry Myerson | As I wrote, there is much literature on the subset-sum problem. I would encourage you to have a look at it. I don't know whether your exact problem is there, but it might be, or the tools with which to tackle it might be. | |
| May 29, 2016 at 18:01 | comment | added | artsin | @GerryMyerson Thank for your reply! But how to be with inaccurate values of resistance? | |
| May 29, 2016 at 15:31 | history | closed |
Franz Lemmermeyer Stefan Kohl♦ Alexey Ustinov Wolfgang user1688 |
Not suitable for this site | |
| May 29, 2016 at 13:19 | comment | added | Gerry Myerson | "Subset-sum problem" (q.v.) asks whether a given number $X$ is the sum of a subset of the given numbers $\{\,x_1,x_2,\dots,x_n\,\}$. No algorithm significantly better than exhaustive search is known. There is much literature to be found by websearch. | |
| May 29, 2016 at 8:22 | review | Close votes | |||
| May 29, 2016 at 15:31 | |||||
| May 29, 2016 at 7:51 | review | First posts | |||
| May 29, 2016 at 8:01 | |||||
| May 29, 2016 at 7:49 | history | asked | artsin | CC BY-SA 3.0 |