Timeline for Solving a constrained vector system with NDSolve
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2014 at 17:02 | history | edited | John | CC BY-SA 3.0 |
added 1818 characters in body
|
| Feb 8, 2014 at 15:41 | comment | added | John | Yes, this is a known problem that happens when you add known constant constant vectors (which NDSolve treats as lists). I will edit my post with a workaround, however I think the solution I presented is the simplest one, after all in this case vectors are used just to simplify the notation. | |
| Feb 8, 2014 at 15:18 | comment | added | asterix314 | I mean the solution will be for x1 and x2 as scalars, not for X as a vector. The question is how to solve for X in and of itself as a vector. | |
| Feb 8, 2014 at 10:20 | comment | added | John |
@asterix314 {x1,x2} is a vector, but I got your point, I think it has something to do with the vector {0, 9.81}: X[t]-{0,9.81} is evaluated to {X[t], X[t]-9.81} before the equation is solved, that is, before mma sees that X[t] is a vector.
|
|
| Feb 8, 2014 at 7:52 | comment | added | asterix314 |
But your answer does not use the vector capabilities of NDSolve -- X will be reduced to {x1, x2} before NDSolve sees them.
|
|
| Feb 7, 2014 at 17:24 | history | edited | John | CC BY-SA 3.0 |
added 171 characters in body
|
| Feb 7, 2014 at 17:18 | history | answered | John | CC BY-SA 3.0 |