DOCSLIB.ORG

Numerical Methods for Laplace Transform Inversion

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Numerical Methods for Laplace Transform Inversion NUMERICAL METHODS FOR LAPLACE TRANSFORM INVERSION Numerical Methods and Algorithms VOLUME 5 Series Editor: Claude Brezinski Université des Sciences et Technologies de Lille, France NUMERICAL METHODS FOR LAPLACE TRANSFORM INVERSION By ALAN M. COHEN Cardiff University Library of Congress Control Number: 2006940349 ISBN-13: 978-0-387-28261-9 e-ISBN-13: 978-0-387-68855-8 Printed on acid-free paper. AMS Subject Classifications: 44A10, 44-04, 65D30, 65D32, 65Bxx 2007 Springer Science+Business Media, LLC All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed in the United States of America. 9 8 7 6 5 4 3 2 1 springer.com Contents Preface . viii Acknowledgements . xii Notation . xiii 1 Basic Results 1 1.1 Introduction . 1 1.2 Transforms of Elementary Functions . 2 1.2.1 Elementary Properties of Transforms . 3 1.3 Transforms of Derivatives and Integrals . 5 1.4 Inverse Transforms . 8 1.5 Convolution . 9 1.6 The Laplace Transforms of some Special Functions . 11 1.7 Di®erence Equations and Delay Di®erential Equations . 14 1.7.1 z-Transforms . 16 1.8 Multidimensional Laplace Transforms . 18 2 Inversion Formulae and Practical Results 23 2.1 The Uniqueness Property . 23 2.2 The Bromwich Inversion Theorem . 26 2.3 The Post-Widder Inversion Formula . 37 2.4 Initial and Final Value Theorems . 39 2.5 Series and Asymptotic Expansions . 42 2.6 Parseval's Formulae . 43 3 The Method of Series Expansion 45 3.1 Expansion as a Power Series . 45 3.1.1 An alternative treatment of series expansions . 49 3.2 Expansion in terms of Orthogonal Polynomials . 49 3.2.1 Legendre Polynomials . 50 3.2.2 Chebyshev Polynomials . 52 3.2.3 Laguerre Polynomials . 55 3.2.4 The method of Weeks . 58 3.3 Multi-dimensional Laplace transform inversion . 66 vi CONTENTS 4 Quadrature Methods 71 4.1 Interpolation and Gaussian type Formulae . 71 4.2 Evaluation of Trigonometric Integrals . 75 4.3 Extrapolation Methods . 77 4.3.1 The P -transformation of Levin . 77 4.3.2 The Sidi mW-Transformation for the Bromwich integral . 78 4.4 Methods using the Fast Fourier Transform (FFT) . 81 4.5 Hartley Transforms . 91 4.6 Dahlquist's \Multigrid" extension of FFT . 95 4.7 Inversion of two-dimensional transforms . 100 5 Rational Approximation Methods 103 5.1 The Laplace Transform is Rational . 103 5.2 The least squares approach to rational Approximation . 106 5.2.1 Sidi's Window Function . 108 5.2.2 The Cohen-Levin Window Function . 109 5.3 Pad¶e,Pad¶e-type and Continued Fraction Approximations . 111 5.3.1 Prony's method and z-transforms . 116 5.3.2 The Method of Grundy . 118 5.4 Multidimensional Laplace Transforms . 119 6 The Method of Talbot 121 6.1 Early Formulation . 121 6.2 A more general formulation . 123 6.3 Choice of Parameters . 125 6.4 Additional Practicalities . 129 6.5 Subsequent development of Talbot's method . 130 6.5.1 Piessens' method . 130 6.5.2 The Modi¯cation of Murli and Rizzardi . 132 6.5.3 Modi¯cations of Evans et al . 133 6.5.4 The Parallel Talbot Algorithm . 137 6.6 Multi-precision Computation . 138 7 Methods based on the Post-Widder Inversion Formula 141 7.1 Introduction . 141 7.2 Methods akin to Post-Widder . 143 7.3 Inversion of Two-dimensional Transforms . 146 8 The Method of Regularization 147 8.1 Introduction . 147 8.2 Fredholm equations of the ¯rst kind | theoretical considerations . 148 8.3 The method of Regularization . 150 8.4 Application to Laplace Transforms . 151 CONTENTS vii 9 Survey Results 157 9.1 Cost's Survey . 157 9.2 The Survey by Davies and Martin . 158 9.3 Later Surveys . 160 9.3.1 Narayanan and Beskos . 160 9.3.2 Du®y . 161 9.3.3 D'Amore, Laccetti and Murli . 161 9.3.4 Cohen . 162 9.4 Test Transforms . 168 10 Applications 169 10.1 Application 1. Transient solution for the Batch Service Queue M=M N =1 . 169 10.2 Application 2. Heat Conduction in a Rod. 178 10.3 Application 3. Laser Anemometry . 181 10.4 Application 4. Miscellaneous Quadratures. 188 10.5 Application 5. Asian Options . 192 11 Appendix 197 11.1 Table of Laplace Transforms . 198 11.1.1 Table of z-Transforms . 203 11.2 The Fast Fourier Transform (FFT) . 204 11.2.1 Fast Hartley Transforms (FHT) . 206 11.3 Quadrature Rules . 206 11.4 Extrapolation Techniques . 212 11.5 Pad¶eApproximation . 220 11.5.1 Continued Fractions. Thiele's method . 223 11.6 The method of Steepest Descent . 226 11.7 Gerschgorin's theorems and the Companion Matrix . 227 Bibliography . 231 Index . 249 Preface The Laplace transform, as its name implies, can be traced back to the work of the Marquis Pierre-Simon de Laplace (1749-1827). Strange as it may seem no reference is made to Laplace transforms in Rouse Ball's \A Short Account of the History of Mathematics". Rouse Ball does refer to Laplace's contribution to Probability Theory and his use of the generating function. Nowadays it is well-known that if Á(t) is the probability density in the distribution function of the variate t, where 0 · t < 1, then the expected value of est is the Moment Generating Function which is de¯ned by Z 1 M(s) = estÁ(t)dt: (1) 0 The term on the right hand side of (1) is, if we replace s by ¡s, the quantity that we now call the Laplace transform of the function Á(t). One of the earliest workers in the ¯eld of Laplace transforms was J.M. Petzval (1807-1891) although he is best remembered for his work on optical lenses and aberration which paved the way for the construction of modern cameras. Petzval [167] wrote a two volume treatise on the Laplace transform and its application to ordinary linear di®erential equations. Because of this substantial contribu- tion the Laplace transform might well have been called the Petzval transform had not one of his students fallen out with him and accused him of plagiarising Laplace's work. Although the allegations were untrue it influenced Boole and Poincar`eto call the transformation the Laplace transform. The full potential of the Laplace transform was not realised until Oliver Heavi- side (1850-1925) used his operational calculus to solve problems in electromag- netic theory. Heaviside's transform was a multiple of the Laplace transform and, given a transform, he devised various rules for ¯nding the original function but without much concern for rigour. If we consider the simple di®erential equation d2y + y = 1; t > 0 dt2 with initial conditions y(0) = y0(0) = 0 then Heaviside would write py for dy=dt, p2y for d2y=dt2 and so on. Thus the given equation is equivalent to (p2 + 1)y = 1; and the `operational solution' is 1 y ´ : p2 + 1 Expanding the right hand side in powers of 1=p we obtain 1 1 1 y ´ ¡ + ¡ ¢ ¢ ¢ : p2 p4 p6 PREFACE ix R R t 2 t 2 Heaviside regarded 1=p as equivalent to 0 1dt, i.e. t, 1=p as 0 tdt = t =2!, etc., so that the solution of the given di®erential equation is t2 t4 t6 y = ¡ + ¡ ¢ ¢ ¢ ; 2! 4! 6! which is readily identi¯ed with 1 ¡ cos t, the correct solution. For a di®erential equation of the form (again using the notation py = dy=dt; etc.) n n¡1 (a0p + a1p + ¢ ¢ ¢ + an¡1p + an)y = 1; satisfying ¯ r ¯ d y ¯ r ¯ = 0; r = 0; 1; ¢ ¢ ¢ ; n ¡ 1 dt t=0 Heaviside has the operational solution 1 y = ; Á(p) where we denote the nth degree polynomial by Á(p): If all the roots pr; r = 1; ¢ ¢ ¢ ; n of the nth degree algebraic equation Á(p) = 0 are distinct Heaviside gave the formula (known as the `Expansion Theorem') n 1 X epr t y = + : (2) Á(0) p Á0(p ) r=0 r r Compare this to (1.23). Carslaw and Jaeger [31] give examples of Heaviside's approach to solving partial di®erential equations where his approach is very haphazard. Curiously, in his obituaries, there is no reference to his pioneering work in the Operational Calculus. Bateman (1882-1944) seems to have been the ¯rst to apply the Laplace trans- form to solve integral equations in the early part of the 20th century. Based on notes left by Bateman, Erd¶elyi[78] compiled a table of integral transforms which contains many Laplace transforms. Bromwich (1875-1929), by resorting to the theory of functions of a complex variable helped to justify Heaviside's methods to some extent and lay a ¯rm foundation for operational methods. For the example given above he recognized that the solution of the second order equation could be expressed as Z γ+i1 1 pt dp y = e 2 ; 2¼i γ¡i1 p(p + 1) where γ > 0.
Load more

Recommended publications
  • Adaptive Learning Methods and Their Use in Flaw Classification Sriram Chavali Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1996 Adaptive learning methods and their use in flaw classification Sriram Chavali Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Structures and Materials Commons Recommended Citation Chavali, Sriram, "Adaptive learning methods and their use in flaw classification" (1996). Retrospective Theses and Dissertations. 111. https://lib.dr.iastate.edu/rtd/111 This Thesis is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. r r Adaptive learning methods and their use in flaw classification r by r Sriram Chavali r A thesis submitted to the graduate faculty in partial fulfillment of the requirements for the degree of r MASTER OF SCIENCE r Department: Aerospace Engineering and Engineering Mechanics Major: Aerospace Engineering r1 r Major Professor: Dr. Lester W. Schmerr r r r r r r Iowa State University Ames, Iowa r 1996 r Copyright© Sriram Chavali, 1996. All rights reserved. r( r 11 r Graduate College r Iowa State University rI I This is to certify that the Master's thesis of Sriram Chavali has met the thesis requirements of Iowa State University r r r r r r rt r r r rm I l rl r r ll1 r {l1m'l r 1 TABLE OF CONTENTS {1m 1, I )11m ACKNOWLEDGMENTS Vlll I i ABSTRACT ....
    [Show full text]
  • The Wavelet Tutorial Second Edition Part I by Robi Polikar
    THE WAVELET TUTORIAL SECOND EDITION PART I BY ROBI POLIKAR FUNDAMENTAL CONCEPTS & AN OVERVIEW OF THE WAVELET THEORY Welcome to this introductory tutorial on wavelet transforms. The wavelet transform is a relatively new concept (about 10 years old), but yet there are quite a few articles and books written on them. However, most of these books and articles are written by math people, for the other math people; still most of the math people don't know what the other math people are 1 talking about (a math professor of mine made this confession). In other words, majority of the literature available on wavelet transforms are of little help, if any, to those who are new to this subject (this is my personal opinion). When I first started working on wavelet transforms I have struggled for many hours and days to figure out what was going on in this mysterious world of wavelet transforms, due to the lack of introductory level text(s) in this subject. Therefore, I have decided to write this tutorial for the ones who are new to the topic. I consider myself quite new to the subject too, and I have to confess that I have not figured out all the theoretical details yet. However, as far as the engineering applications are concerned, I think all the theoretical details are not necessarily necessary (!). In this tutorial I will try to give basic principles underlying the wavelet theory. The proofs of the theorems and related equations will not be given in this tutorial due to the simple assumption that the intended readers of this tutorial do not need them at this time.
    [Show full text]
  • Learning, Selection and Coding of New Block Transforms in and for the Optimization Loop of Video Coders Saurabh Puri
    Learning, selection and coding of new block transforms in and for the optimization loop of video coders Saurabh Puri To cite this version: Saurabh Puri. Learning, selection and coding of new block transforms in and for the optimization loop of video coders. Computer Science [cs]. Université Bretagne Loire; Université de Nantes; LS2N, Université de Nantes, 2017. English. tel-01779566 HAL Id: tel-01779566 https://tel.archives-ouvertes.fr/tel-01779566 Submitted on 26 Apr 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Thèse de Doctorat Saurabh PURI Mémoire présenté en vue de l’obtention du grade de Docteur de l’Université de Nantes sous le sceau de l’Université Bretagne Loire École doctorale : Sciences et technologies de l’information, et mathématiques Discipline : Traitement du signal et des images, section CNU 27 Unité de recherche : LABORATOIRE DES SCIENCES DU NUMÉRIQUE DE NANTES (LS2N) Soutenance prévue le 09 November 2017 Learning, selection and coding of new block transforms in and for the optimization loop of video coders JURY Présidente : Mme Christine GUILLEMOT, Directrice de Recherche, INRIA Rennes Rapporteurs : M. Olivier DEFORGES, Professeur, INSA Rennes M. Marco CAGNAZZO, Associate Professeur, TELECOM-ParisTech Examinateur : M.
    [Show full text]
  • Read Book Integral Transform Techniques for Greens Function
    INTEGRAL TRANSFORM TECHNIQUES FOR GREENS FUNCTION 2ND EDITION PDF, EPUB, EBOOK Kazumi Watanabe | 9783319345871 | | | | | Integral Transform Techniques for Greens Function 2nd edition PDF Book An integral transform "maps" an equation from its original "domain" into another domain. Cold Books. Finite Laplace Transforms. Vikram Jain Books. Millions of books are added to our site everyday and when we find one that matches your search, we'll send you an e-mail. Sanctum Books. Applications of Laplace Transforms. This physics kernel is the kernel of integral transform. Jacobi and Gegenbauer Transforms. For other uses, see Transformation mathematics. A7 Mittag Leffler Function. Tables of Integral Transforms. Chapter 1 Fundamentals. Fractional Malliavin Stochastic Variations. Added to Your Shopping Cart. Legendre Transforms. Mean value theorem Rolle's theorem. The equation cast in terms of complex frequency is readily solved in the complex frequency domain roots of the polynomial equations in the complex frequency domain correspond to eigenvalues in the time domain , leading to a "solution" formulated in the frequency domain. Are you a frequent reader or book collector? Hilbert and Stieltjes Transforms. E-Book Rental Days. From Wikipedia, the free encyclopedia. Keeping the style, content, and focus that made the first edition a bestseller, Integral Transforms and their Applications, Second Edition stresses the development of analytical skills rather than the importance of more abstract formulation. However, for each quantum system, there is a different kernel. There are many classes of problems that are difficult to solve—or at least quite unwieldy algebraically—in their original representations. The general theory of such integral equations is known as Fredholm theory.
    [Show full text]
  • Small-Size FDCT/IDCT Algorithms with Reduced Multiplicative
    ISSN 0735-2727, Radioelectronics and Communications Systems, 2019, Vol. 62, No. 11, pp. 559–576. © Allerton Press, Inc., 2019. Russian Text © The Author(s), 2019, published in Izvestiya Vysshikh Uchebnykh Zavedenii, Radioelektronika, 2019, Vol. 62, No. 11, pp. 662–677. Small-Size FDCT/IDCT Algorithms with Reduced Multiplicative Complexity Aleksandr Cariow1*, Marta Makowska1**, and Pawe³ Strzelec1*** 1West Pomeranian University of Technology, Szczecin, Poland *ORCID: 0000-0002-4513-4593, e-mail: [email protected] **e-mail: [email protected] ***e-mail: [email protected] Received June 26, 2019 Revised November 6, 2019 Accepted November 8, 2019 Abstract—Discrete orthogonal transforms including the discrete Fourier transform, the discrete Walsh transform, the discrete Hartley transform, the discrete Slant transform, etc. are extensively used in radio-electronic and telecommunication systems for data processing and transmission. The popularity of using these transform is explained by the presence of fast algorithms that minimize the computational and hardware complexity of their implementation. A special place in the list of transforms is occupied by the forward and inverse discrete cosine transforms (FDCT and IDCT respectively). This article proposes a set of parallel algorithms for the fast implementation of FDCT/IDCT. The effectiveness of the proposed solutions is justified by the possibility of the factorization of the FDCT/IDCT matrices, which leads to a decrease in computational and implementation complexity. Some fully parallel FDCT/IDCT algorithms for small lengths N = 2, 3, 4, 5, 6, 7 are presented. DOI: 10.3103/S0735272719110025 1. INTRODUCTION Traditional types of discrete orthogonal transforms such as discrete Fourier transform, discrete Hartley transform, discrete Walsh and Haar transform, Slant transform, discrete cosine transform (DCT) are important data processing tools [1].
    [Show full text]