Roberts, Jason A.Savostyanov, Dmitry V.Tyrtyshnikov, Eugene E.2014-12-012014-12-012014-04Journal of Computational and Applied Mathematics, 2014, 260, pp. 434-4480377-042710.1016/j.cam.2013.10.025http://hdl.handle.net/10034/336402NOTICE: this is the author’s version of a work that was accepted for publication in Journal of Computational and Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Applied and Computational Mathematics, 260, 2014, doi: 10.1016/j.cam.2013.10.025This article address a linear fractional differential equation and develop effective solution methods using algorithms for the inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed by the divide and conquer and modified Bini’s algorithms, for which we present the versions with the QTT approximation. We also present an efficient formula for the shift of vectors given in QTT format, which is used in the divide and conquer algorithm. As a result, we reduce the complexity of inversion from the fast Fourier level O(nlogn) to the speed of superfast Fourier transform, i.e., O(log^2n). The results of the paper are illustrated by numerical examples.enArchived with thanks to Journal of Computational and Applied Mathematicsfractional calculustriangular Toeplitz matrixdivide and conquerTensor train formatfast convolutionsuperfast fourier transformArticle1879-1778Journal of Computational and Applied Mathematics