Timeline for How to discretize a nonlinear PDE fast?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 3, 2012 at 12:38 | comment | added | xzczd♦ | Sorry, I have to cast my first downvote…This solution is wrong. It just gives me the warning message $RecursionLimit::reclim.I set some effort in correcting the mistake but sadly I failed, the only thing I know is that the definition of u[i,n] is incorrect.(See here for more details.) And, even with the solution in the link I give, the code won't work, I guess the reason is the recursion in this case is quite complex and it doesn't work as our expect. | |
| Sep 12, 2012 at 7:49 | history | edited | PlatoManiac | CC BY-SA 3.0 | added 48 characters in body |
| Sep 12, 2012 at 7:25 | comment | added | Faz | You solved Subscript[u, t] + u Subscript[u, xx] = c Subscript[u, xx]. Please consider solving the following NPDE instead: Subscript[u, t] + u Subscript[u, x] = c Subscript[u, xx]. | |
| Sep 12, 2012 at 2:54 | comment | added | J. M.'s missing motivation | Whee, poles... :D | |
| Sep 12, 2012 at 2:39 | history | answered | PlatoManiac | CC BY-SA 3.0 |