Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with implicit-methods
Search options answers only
not deleted
user 4912
Implicit methods are timestepping methods that use an inversion at every timestep. This allows for much better stability properties than explicit methods, though it comes with a serious speed penalty in some cases. Examples of implicit methods include Backward Euler and Crank-Nicholson.
8
votes
Accepted
Initializing implicit linear multistep methods
The standard approach is to use a self-starting time-marching algorithm with sufficiently small timestep (such that the order of accuracy is not spoiled) and compute the 5 non-initial value previous s …
- 3,162