Not checkedNot checked for notices yet.
A fast multiscale Galerkin algorithm for solving boundary value problem of the fractional Bagley–Torvik equation
Jian Chen
Boundary Value Problems · 2020
doi:10.1186/s13661-020-01391-8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract In this paper, a fast multiscale Galerkin algorithm is developed for solving the boundary value problem of the fractional Bagley–Torvik equation. For this purpose, we employ multiscale orthogonal functions having vanishing moments as the basis of the trial space, and we propose a truncation strategy for the coefficient matrix of the corresponding discrete system which leads to a fast algorithm. We show the algorithm has nearly linear computational complexity (up to a logarithmic factor). Numerical experiments are presented to illustrate the efficiency, accuracy and convergence of the proposed algorithm. Also, comparisons with some other existing methods are made to confirm the reliability of the algorithm
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.