The following warnings occurred:
Warning [2] count(): Parameter must be an array or an object that implements Countable - Line: 795 - File: showthread.php PHP 7.4.33 (FreeBSD)
File Line Function
/showthread.php 795 errorHandler->error





Post Reply 
Fourier transform
04-13-2015, 10:08 PM (This post was last modified: 04-14-2015 05:12 PM by salvomic.)
Post: #1
Fourier transform
hi all,
a part of Fourier series coefficients (see here), there is a function in the Prime (or XCas) to get the Fourier Transform (not FFT) and its inverse?
See in Wolfram Alpha, for example...
If not, I need help to make a program.

We could calculate it via laplace() (Laplace transform), but we need the "bilateral laplace transform" and I don't know how to get it with the Prime...
F[f(t)] == bilateral-L[f(t)] where \( s=i\omega \)

Thank you
Salvo

EDIT:
the general equation should be
\[ \int_{-\infty }^{\infty }f(x) e^{-i\omega t}dt \]
but with Prime I get often "undef" and if I set "complex" in CAS I get "Limit: Max order reached or unable to make series expansion Error: Bad argument"

∫aL√0mic (IT9CLU) :: HP Prime 50g 41CX 71b 42s 39s 35s 12C 15C - DM42, DM41X - WP34s Prime Soft. Lib
Visit this user's website Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
Fourier transform - salvomic - 04-13-2015 10:08 PM
RE: Fourier transform - salvomic - 04-14-2015, 08:44 PM
RE: Fourier transform - Archanus - 10-26-2015, 05:00 AM
RE: Fourier transform - salvomic - 10-26-2015, 07:27 AM
RE: Fourier transform - Archanus - 10-26-2015, 06:39 PM
RE: Fourier transform - salvomic - 10-26-2015, 06:44 PM
RE: Fourier transform - Archanus - 10-26-2015, 07:01 PM
RE: Fourier transform - Tim Wessman - 10-26-2015, 02:17 PM
RE: Fourier transform - Archanus - 10-26-2015, 06:47 PM



User(s) browsing this thread: 2 Guest(s)