I wanna know what's the advantage of multi step ODE methods such as Adams-Bashforth over ordinary single step methods such Runge–Kutta, accuracy/time wise.
2026-03-25 02:58:49.1774407529
Advantage of multi steps ODE methods over single step methods
1.7k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ORDINARY-DIFFERENTIAL-EQUATIONS
- The Runge-Kutta method for a system of equations
- Analytical solution of a nonlinear ordinary differential equation
- Stability of system of ordinary nonlinear differential equations
- Maximal interval of existence of the IVP
- Power series solution of $y''+e^xy' - y=0$
- Change of variables in a differential equation
- Dimension of solution space of homogeneous differential equation, proof
- Solve the initial value problem $x^2y'+y(x-y)=0$
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Derive an equation with Faraday's law
Related Questions in NUMERICAL-METHODS
- The Runge-Kutta method for a system of equations
- How to solve the exponential equation $e^{a+bx}+e^{c+dx}=1$?
- Is the calculated solution, if it exists, unique?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Minimum of the 2-norm
- Is method of exhaustion the same as numerical integration?
- Prove that Newton's Method is invariant under invertible linear transformations
- Initial Value Problem into Euler and Runge-Kutta scheme
- What are the possible ways to write an equation in $x=\phi(x)$ form for Iteration method?
- Numerical solution for a two dimensional third order nonlinear differential equation
Related Questions in RUNGE-KUTTA-METHODS
- Sensitivity (gradient) of function solved using RK4
- Solve fourth order ODE using fourth order Runge-Kutta method
- Prove that Runge Kutta Method (RK4) is of Order 4
- Applying second-order differential operator vs applying first-order differential operator twice?
- Adaptive step size Runge Kutta: getting a specific value
- PYTHON RK2 (Midpoint Method)
- Runge-Kutta Order Question
- fourth-order Runge-Kutta method producing values for $f(x)=\int_0^x e^{-t^2}$ (confusing answer key)
- Adaptive Step Size in RK45 for Second-Order ODE
- Runge kutta method for order 4 for ODE x'=f(t)
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The main advantage of explicit multistep methods compared to explicit Runge-Kutta lies in the fact that adding additional steps/function evaluations results (for reasonable multi-step) always in increase of the order of accuracy.
The classic examples thereof include the (explicit) Adams-Bashforth family, for which the the order of consistency $p$ is equal to the number of steps $k$ and the (explicit) Nyström methods with $p=k, k > 2$. [1]
This is in stark contrast to explicit Runge-Kutta methods, for which the well-known Butcher-Barrier [2], [3] kicks in at order 5, which states for orders $p \geq 5$ one needs at least $s \geq p + 1$ stages. This is innocent looking, but until now, there is no 7'th order accurate method with 8 stages known - the best known method uses 9 stages. This seems to become more severe for higher orders, as the best currently 8'th order explicit RK method requires 11 stages [4].
Regarding implicit methods, the Butcher Barrier does not exist - in fact, there exist implicit methods with order $2s$ for all $s$ [5], [6], [1]. Implicit multistep methods are much less attractive given that they are, in contrast to many implicit Runge-Kutta methods, not A-stable for orders above 2 (Second Dahlquist barrier [7]) and the order of consistency scales for most methods (e.g. Adams-Moulton, Backwards-Differentiation-Formulas(BDF)) only with $k+1$ instead of $2k$ as for some RK methods [1]. These facts make them much less attractive compared to e.g. Gauss-Legendre methods.
It should be mentioned that there are of course many more considerations that one could make, e.g. the domains of absolute stability of explicit multistep and Runge-Kutta methods, storage efficiency, ease of varying timesteps, internal stability properties, combination of explicit and implicit methods, and so on.
But all of this would go far beyond a MSE post. If you want to dive deep, consider the books by Hairer & Wanner [1], [9], the book by Butcher [4] or the one by Iserles [10].