meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 2 months |
| seen | 3 hours ago | |
| stats | profile views | 44 |
|
Apr 26 |
comment |
Why function cannot be defined inside For loop? @Misery can you really use a def inside a for loop in python? Or do you mean lambdas? |
|
Apr 26 |
comment |
Why function cannot be defined inside For loop? Why was this closed? Because it was just a programming error? I have seen other examples of this in questions that are not closed. The "too localized" doesn't feel right to me. Also the rage about using a loop seems unnecessary to me. Reminds me of when people use capital letters for symbols/function names. True, but needless comments. |
|
Mar 27 |
awarded | Nice Question |
|
Mar 15 |
awarded | Yearling |
|
Jan 9 |
comment |
What Cell Option Controls Group Indentation? Ugh ... I thought those numbers where calculated ... makes more sense now. Thanks! |
|
Jan 9 |
accepted | What Cell Option Controls Group Indentation? |
|
Jan 9 |
asked | What Cell Option Controls Group Indentation? |
|
Dec 24 |
awarded | Enthusiast |
|
Dec 17 |
comment |
While-Loop Linear Projection Be careful with Subscript[Cp,-1] since Cp has a value, lets say for example 10.1 then what you are really doing is Subscript[10.1, -1] which I doubt is what you want. Can you describe what you want mathematically, ie the recurrence relation you actually want to solve, and example initial values. Then it will be easy to help you get the correct code. |
|
Dec 17 |
comment |
FindRoot - Speed and errors To break the tie, using v9 I also have no errors. |
|
Dec 12 |
comment |
NDSolve and WhenEvent Causing Excess Work @NasserM.Abbasi weird ... guess it just keeps trying! |
|
Dec 12 |
comment |
NDSolve and WhenEvent Causing Excess Work @MarkMcClure for sure. I love WhenEvent so much ... it could make me have to do a back flip each time I use it and it would still keep me coming back! |
|
Dec 12 |
comment |
NDSolve and WhenEvent Causing Excess Work @MarkMcClure don't get me wrong ... your point is well taken! It would just be nice to have an extra option that would tell the maximum steps taken between events ... that way the user doesn't need to have to do any hand calculations on the number of time steps, and the predicted number of events to figure out how many maximum steps need to be taken. This will make the calculations much slower ... but seems like it will be a common need for these types of problems. Again I think of it the way old Fortran codes would have worked ... each call you get the maximum steps so it naturally scales |
|
Dec 12 |
comment |
NDSolve and WhenEvent Causing Excess Work @MarkMcClure true, but for cases that happen at regular intervals (ie Mod[t,1] etc) this is slightly counter intuitive until you understand your answer. In these cases the events are easy to detect ... but the way the solver is allocating effort is subtle since it is I imagine trying to ensure that possible local discontinuities are being handled correctly. |
|
Dec 12 |
accepted | NDSolve and {C, K, Slot} and other built-ins as a variable name |
|
Dec 12 |
comment |
NDSolve and WhenEvent Causing Excess Work I see ... so since I am doing a perturbation at each time step, then that is why I am having to grow MaxSteps for longer output ... as I using up my "bank" near each event. I was thinking more like this was analogous to a Fortran solver that does integration a "step" at a time ... not considering the how the adaptive step size was working. Thanks! |
|
Dec 12 |
accepted | NDSolve and WhenEvent Causing Excess Work |
|
Dec 11 |
asked | NDSolve and WhenEvent Causing Excess Work |
|
Dec 11 |
comment |
Implementing Position @jVincent good catch thanks! |
|
Dec 11 |
revised |
Implementing Position added 6 characters in body |
