scispace - formally typeset
Search or ask a question
Book

Asymptotic Expansions of Integrals

About: The article was published on 1975-06-01 and is currently open access. It has received 1373 citations till now. The article focuses on the topics: Asymptotic analysis & Singular perturbation.
Citations
More filters
Posted Content
TL;DR: In this article, the authors introduce the linear operators of fractional integration and fractional differentiation in the framework of the Riemann-Liouville fractional calculus, and derive the analytical solutions of the most simple linear integral and differential equations in fractional order.
Abstract: We introduce the linear operators of fractional integration and fractional differentiation in the framework of the Riemann-Liouville fractional calculus. Particular attention is devoted to the technique of Laplace transforms for treating these operators in a way accessible to applied scientists, avoiding unproductive generalities and excessive mathematical rigor. By applying this technique we shall derive the analytical solutions of the most simple linear integral and differential equations of fractional order. We show the fundamental role of the Mittag-Leffler function, whose properties are reported in an ad hoc Appendix. The topics discussed here will be: (a) essentials of Riemann-Liouville fractional calculus with basic formulas of Laplace transforms, (b) Abel type integral equations of first and second kind, (c) relaxation and oscillation type differential equations of fractional order.

1,281 citations

Book ChapterDOI
01 Jan 2014
TL;DR: In this paper, Dzherbashian [Dzh60] defined a function with positive α 1 > 0, α 2 > 0 and real α 1, β 2, β 3, β 4, β 5, β 6, β 7, β 8, β 9, β 10, β 11, β 12, β 13, β 14, β 15, β 16, β 17, β 18, β 20, β 21, β 22, β 24
Abstract: Consider the function defined for \(\alpha _{1},\ \alpha _{2} \in \mathbb{R}\) (α 1 2 +α 2 2 ≠ 0) and \(\beta _{1},\beta _{2} \in \mathbb{C}\) by the series $$\displaystyle{ E_{\alpha _{1},\beta _{1};\alpha _{2},\beta _{2}}(z) \equiv \sum _{k=0}^{\infty } \frac{z^{k}} {\varGamma (\alpha _{1}k +\beta _{1})\varGamma (\alpha _{2}k +\beta _{2})}\ \ (z \in \mathbb{C}). }$$ (6.1.1) Such a function with positive α 1 > 0, α 2 > 0 and real \(\beta _{1},\beta _{2} \in \mathbb{R}\) was introduced by Dzherbashian [Dzh60].

919 citations

Journal ArticleDOI
TL;DR: It is shown that quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph, even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph.
Abstract: In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph. The main idea is to implement quantum gates by scattering processes.

909 citations

Journal ArticleDOI
TL;DR: This paper has reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.
Abstract: Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete-time quantum walks.

883 citations

Journal ArticleDOI
TL;DR: In this paper, the problem of deriving approximations for multinormal integrals is examined using results of asymptotic analysis, where the boundary of the integration domain given by g(x¯) is simplified by replacing by its Taylor expansion at the points on the boundary with minimal distance to the origin.
Abstract: The problem of deriving approximations for multinormal integrals is examined using results of asymptotic analysis. The boundary of the integration domain given by g(x¯)=0 is simplified by replacing g(x¯) by its Taylor expansion at the points on the boundary with minimal distance to the origin. Two approximations which are obtained by using a linear or quadratic Taylor expansion are compared. It is shown that, applying a quadratic Taylor expansion, an asymptotic approximation for multinormal integrals can be obtained, whereas using linear approximations large relative errors may occur.

829 citations