Analytical closed-form solution of the Bagley-Torvik equation
Juan Luis González-Santander, Alexander Apelblat
TL;DR
This work provides a closed-form solution to the Bagley-Torvik equation with arbitrary initial data and external forcing by decomposing $y(t)$ into a forcing-driven term $y_f(t)$ and an initial-condition term $y_c(t)$. The forcing term is a convolution with a kernel formed from exponentials multiplied by $\operatorname{erfc}$, while $y_c(t)$ is a finite sum of similar terms whose coefficients depend on the four roots of the quartic polynomial $P(r)=a r^4+b r^3+c$. A key contribution is a new inverse Laplace transform for $\dfrac{s^{\lambda}}{a s^m + b s^{p/q} + c}$, enabling explicit expressions in terms of Mittag-Leffler functions evaluated at $r_k t^{1/q}$, where $r_k$ are the roots of $P$. The paper also derives closed-form solutions for potential and sinusoidal forcings, provides detailed asymptotics as $t\to 0^+$ and $t\to \infty$, and demonstrates substantial computational speedups and stability relative to prior methods, making the results valuable as both exact benchmarks and practical solvers for fractional differential equations in engineering.
Abstract
We calculate the solution of the Bagley-Torvik equation for arbitrary initial conditions and arbitrary external force as the sum of two terms. The first one is a linear combination of exponentials with error functions, and the second one is a convolution integral whose kernel is a linear combination of exponentials with error functions. The derivation of the solution is carried out by using the Laplace transform method and the calculation of a new inverse Laplace transform. The aforementioned convolution integral can be calculated for the cases of a sinusoidal- or a potential-type external force. In addition, we calculate the asymptotic behaviour of the solution for $t\rightarrow 0^{+}$ and $t\rightarrow +\infty$. The computation of this new analytical solution is much faster and stable than other analytical solutions found in the literature.
