The object of this article is to present the computational solution of the time-fractional Schrödinger equation subject to given constraint condition based on the generalized Taylor series formula in the Caputo sense. The algorithm methodology is based on construct a multiple fractional power series solution in the form of a rabidly convergent series with minimum size of calculations using symbolic computation software. The proposed technique is fully compatible with the complexity of this problem and obtained results are highly encouraging. Efficacious computational experiments are provided to guarantee the procedure and to illustrate the theoretical statements of the present algorithm in order to show its potentiality, generality, and superiority for solving such fractional equation. Graphical results and numerical comparisons are presented and discussed quantitatively to illustrate the solution.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.