🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.math.num-analysis
Article #56

Re: Is there anything equivalent to FFT for Laplace Transform?

#56
From: Herman Rubin
Date: Mon, 02 Nov 1992 15:50
42 lines
2438 bytes
In article <1d3fv0INNfo3@usenet.INS.CWRU.Edu> at913@cleveland.Freenet.Edu (Mirko Vukovic) writes:

>In a previous article, fang@phy.duke.edu (Fang Zhong) says:


>>	We are studying a decaying time series.  We would like
>>to have a Laplace Transform of our experimental data, so we can
>>analyze all the exponential decaying modes.  Is there anything
>>in numerical analysis that does the forward LT, just like FFT
>>to help analyzing data in frequency demain?


>OK, here is an extremely hazy suggestion  (I don't have any signal processing
>books for firm definitions etc.)

>LT is a generalization of FT to the whole complex plane, where FT is the LT on
>the unit circle.

>If you multiply your time series by alpha^t (I think), the LT of the new
>series expands or contracts by the factor alpha (lookup Oppenheim's book
>on descretem time signal analysis):

			....................

This does not do the job, and in fact it is not clear how it can be done.

The idea of the FFT is that one can use the n/k FTs for the points spaced
k apart, and manipulate properties of the FT for k equally spaced points, to
get the FFT for n equally spaced points.  One also increases the number of
points at which it is calculated, which is the same as the number of points
in the argument.  Nothing like this is possible for the Laplace transform
UNLESS additonal sample points are interpolated.  

Another indication of the problem is that inverting a Fourier series is 
easy, but inverting a Laplace transform, while it can be done, in principle,
without using complex arguments, is likely to be very difficult to do in
practice that way.  The two transforms are not that similar
-- 
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@pop.stat.purdue.edu (Internet, bitnet)  
{purdue,pur-ee}!pop.stat!hrubin(UUCP)
Technical Details
Message-ID: <Bx3Io8.MGC@mentor.cc.purdue.edu>
Path: arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubin
References: <6576@news.duke.edu> <1d3fv0INNfo3@usenet.INS.CWRU.Edu>

Show Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis
Path: arc1-ca.pugleaf.net!sparky!uunet!haven.umd.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubin
From: hrubin@pop.stat.purdue.edu (Herman Rubin)
Subject: Re: Is there anything equivalent to FFT for Laplace Transform?
Message-ID: <Bx3Io8.MGC@mentor.cc.purdue.edu>
Sender: news@mentor.cc.purdue.edu (USENET News)
Organization: Purdue University Statistics Department
References: <6576@news.duke.edu> <1d3fv0INNfo3@usenet.INS.CWRU.Edu>
Distribution: inet
Date: Mon, 2 Nov 1992 15:50:30 GMT
Lines: 42