Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Mathematics
Differential Equations
Starting BDF iterations - suggestions?
Reply to thread
Message
[QUOTE="maistral, post: 6497756, member: 419533"] [B]TL;DR Summary:[/B] How do I start BDF iterations? Any suggestions? As we know, backward differentiation formulas for ODE start off with the backward Euler; which proceeds as: [IMG alt=" y_{n+1} - y_n = h f(t_{n+1}, y_{n+1}) "]https://wikimedia.org/api/rest_v1/media/math/render/svg/d5985a6744966f282d8fa1dce1f7a3e11eaa64d6[/IMG] If I wanted to switch to the second order method; [IMG alt="{\displaystyle y_{n+2}-{\tfrac {4}{3}}y_{n+1}+{\tfrac {1}{3}}y_{n}={\tfrac {2}{3}}hf(t_{n+2},y_{n+2})}"]https://wikimedia.org/api/rest_v1/media/math/render/svg/cc6672bd1e850d23b3ef387b91976fc0ef307dde[/IMG] Can anyone recommend me ideas as to how to generate the initially required y[sub]n+1[/sub]? The only thing I can think of are as follows: [LIST] [*]Use a standard Runge-Kutta to generate the second point, but in my opinion this is somehow futile as the reason why we use implicit methods is to avoid the instabilities which will generated via a standard explicit approach (like Runge-Kutta). [*]Use the backward Euler technique with some microscopic (lol) stepsizes to assure that I am accurate, then I switch to a higher BDF method? Say, I want to propagate a second-order solution with a stepsize of 0.1. Maybe I should generate a backward Euler solution of step 0.001? Or something? [/LIST] I'm very open to suggestions as I have no idea how to proceed. Any suggestions? [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
Differential Equations
Starting BDF iterations - suggestions?
Back
Top