Explicit Chebyshev Petrov–Galerkin scheme for time-fractional fourth-order uniform Euler–Bernoulli pinned–pinned beam equation

In this research, a compact combination of Chebyshev polynomials is created and used as a spatial basis for the time fractional fourth-order Euler–Bernoulli pinned–pinned beam. The method is based on applying the Petrov–Galerkin procedure to discretize the differential problem into a system of linear algebraic equations with unknown expansion coefficients. Using the efficient Gaussian elimination procedure, we solve the obtained system of equations with matrices of a particular pattern. The <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>L</m:mi> </m:mrow> <m:mrow> <m:mi>∞</m:mi> </m:mrow> </m:msub> </m:math> {L}∞ and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>L</m:mi> </m:mrow> <m:mrow> <m:mn>2</m:mn> </m:mrow> </m:msub> </m:math> {L}₂ norms estimate the error bound. Three numerical examples were exhibited to verify the theoretical analysis and efficiency of the newly developed algorithm.