8
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Operator Ordering and Solution of Pseudo-Evolutionary Equations

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The solution of pseudo initial value differential equations, either ordinary or partial (including those of fractional nature), requires the development of adequate analytical methods, complementing those well established in the ordinary differential equation setting. A combination of techniques, involving procedures of umbral and of operational nature, has been demonstrated to be a very promising tool in order to approach within a unifying context non-canonical evolution problems. This article covers the extension of this approach to the solution of pseudo-evolutionary equations. We will comment on the explicit formulation of the necessary techniques, which are based on certain time- and operator ordering tools. We will in particular demonstrate how Volterra-Neumann expansions, Feynman-Dyson series and other popular tools can be profitably extended to obtain solutions of fractional differential equations. We apply the method to a number of examples, in which fractional calculus and a certain umbral image calculus play a role of central importance.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Book: not found

          The Analysis of Fractional Differential Equations

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Exponential Operators and Parameter Differentiation in Quantum Physics

            R. Wilcox (1967)
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Efficient computation of the Zassenhaus formula

              A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and thus containing the minimum number of terms. The recursion can be easily implemented in a symbolic algebra package and requires much less computational effort, both in time and memory resources, than previous algorithms. In addition, by bounding appropriately each term in the recursion, it is possible to get a larger convergence domain of the Zassenhaus formula when it is formulated in a Banach algebra.
                Bookmark

                Author and article information

                Journal
                02 February 2019
                Article
                1902.00736
                ac37b9cc-9604-406f-8884-2b507f636e15

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                34A08, 26A33 (Primary) 05A40 (Secondary)
                16 pages, 2 figures
                math-ph math.MP

                Mathematical physics,Mathematical & Computational physics
                Mathematical physics, Mathematical & Computational physics

                Comments

                Comment on this article