Numerical Method for Inverse Laplace Transform with Haar Wavelet Operational Matrix (original) (raw)

An Operational Haar Wavelet Method for

2011

A Haar wavelet operational matrix is applied to fractional integration, which has not been undertaken before. The Haar wavelet approximating method is used to reduce the fractional Volterra and Abel integral equations to a system of algebraic equations. A global error bound is estimated and some numerical examples with smooth, nonsmooth, and singular solutions are considered to demonstrate the validity and applicability of the developed method.

Numerical Solution of Fractional Order Differential Equations Using Haar Wavelet Operational Matrix

2017

A fractional differential equation has a wide range of applications in engineering and science. Haar wavelet operational matrix has been widely applied in system analysis, system identification, Optimal control and numerical solution of integral and differential equations. In this paper, a numerical scheme, based on the Haar wavelet operational matrix of the fractional order integration for the solution of fractional differential equation is presented. The operational matrix is used to reduce the fractional differential equation in to a system of algebraic equations. Numerical examples are provided to demonstrate the accuracy, efficiency and simplicity of the proposed method.

Novel Fractional Wavelet Transform with Closed-Form Expression

International Journal of Advanced Computer Science and Applications, 2014

A new wavelet transform (WT) is introduced based on the fractional properties of the traditional Fourier transform. The new wavelet follows from the fractional Fourier order which uniquely identifies the representation of an input function in a fractional domain. It exploits the combined advantages of WT and fractional Fourier transform (FrFT). The transform permits the identification of a transformed function based on the fractional rotation in time-frequency plane. The fractional rotation is then used to identify individual fractional daughter wavelets. This study is, for convenience, limited to one-dimension. Approach for discussing two or more dimensions is shown.

INTRODUCTION OF GENERALIZED LAPLACE-FRACTIONAL MELLIN TRANSFORM

In present era, Fractional Integral Transform plays an important role in various fields of mathematics and Technology. Mellin transform has an many application in navigations, correlaters, in area of statistics, probability and also solving in differential equation. Fractional Mellin transform is integral part of mathematical modeling method because of its scale invariance property. The aim of this paper is to generalization of Laplace-Fractional Mellin Transform. Analyticity theorem for the Generalized Laplace-Fractional Mellin Transform is proved.

Wavelets and Linear Algebra 3(2) (2016) 55-68 Quartic and pantic B-spline operational matrix of fractional integration

2016

In this work, we proposed an effective method based on quar-tic and pantic B-spline scaling functions to solve partial differential equations of fractional order. Our method is based on dual functions of B-spline scaling functions. We derived the operational matrix of fractional integration of quartic and pan-tic B-spline scaling functions and used them to transform the mentioned equations to a system of algebraic equations. Some examples are presented to show the applicability and effectivity of the technique. c ⃝ (2016) Wavelets and Linear Algebra

Application of numerical inverse Laplace transform algorithms in fractional calculus

Journal of the Franklin Institute, 2011

The paper presents a computationally e±cient method for modeling and simulating distributed systems with lossy transmission line (TL) including multiconductor ones, by a less conventional method. The method is devised based on 1D and 2D Laplace transforms, which facilitates the possibility of incorporating fractional-order elements and frequency-dependent parameters. This process is made possible due to the development of e®ective numerical inverse Laplace transforms (NILTs) of one and two variables, 1D NILT and 2D NILT. In the paper, it is shown that in high frequency operating systems, the frequency dependencies of the system ought to be included in the model. Additionally, it is shown that incorporating fractional-order elements in the modeling of the distributed parameter systems compensates for losses along the wires, provides higher degrees of°exibility for optimization and produces more accurate and authentic modelling of such systems. The simulations are performed in the Matlab environment and are e®ectively algorithmized.

Parameter N Analysis on the Rational-Talbot Algorithm for Numerical Inversion of Laplace Transform

VETOR - Revista de Ciências Exatas e Engenharias, 2021

This article investigates the numerical inversion of the Laplace Transform by the Rational-Talbot method and analyzes the influence on the variation of the free parameter N established by the technique when applied to certain functions. The set of elementary functions, for which the method is tested, has exponential and oscillatory characteristics. Based on the results obtained, it was concluded that the Rational-Talbot method is e cient for the inversion of decreasing exponential functions. At the same time, to perform the inversion process effectively for trigonometric forms, the algorithm requires a greater amount of terms in the sum. For higher values of N, the technique works well. In fact, this is observed in inverting the functions transform, that combine trigonometric and polynomial factors. The method numerical results have a good precision for the treatment of decreasing exponential functions when multiplied by trigonometric functions.

Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials

Mathematics in Engineering, Science and Aerospace, 2014

In real situations, sometimes it is difficult or rather impossible to find Laplace transform inversion in classical way. Such situations are tackled by numerical evaluation of inverse Laplace transform. The numerical techniques for finding inverse of Laplace transforms were introduced in the sixties by Bellman et al. Since then enormous progress has taken place. This paper mainly discusses series methods for numerically inverting Laplace transforms such as by (1) Euler, Post-Widder and Crump, (2) Fast Fourier transform and (3) Laguerre Legendre and Chebyshev polynomials. Historical development and instances of certain engineering applications have been taken into consideration.

Numerical inversion of Laplace transform based on Bernstein operational matrix

Mathematical Methods in the Applied Sciences, Wiley & Sons, 2018

This paper provides a technique to investigate the inverse Laplace transform by using orthonormal Bernstein operational matrix of integration. The proposed method is based on replacing the unknown function through a truncated series of Bernstein basis polynomials and the coefficients of the expansion are obtained using the operational matrix of integration. This is an alternative procedure to find the inversion of Laplace transform with few terms of Bernstein polynomials. Numerical tests on various functions have been performed to check the applicability and efficiency of the technique. The root mean square error between exact and numerical results is computed, which shows that the method produces the satisfactory results. A rough upper bound for errors is also estimated.

Inversion of the Laplace transform from the real axis using an adaptive iterative method

Arxiv preprint arXiv:0910.3385, 2009

A new method for inverting the Laplace transform from the real axis is formulated. This method is based on a quadrature formula. We assume that the unknown function f t is continuous with known compact support. An adaptive iterative method and an adaptive stopping rule, which yield the convergence of the approximate solution to f t , are proposed in this paper. and |F 2 p | ≤ e −bp δ, where ∞ b |f t |dt ≤ δ. Therefore, the contribution of the "tail" f b t of f,