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"

there is a way to solve an integral like that in the attached image and to avoid the errors that Terminal shows?

the integral is a tentative to get Fourier transform of \( \frac{1}{1+t^{2}} \), that's \( \sqrt{\frac{\pi}{2}}e^{-|\omega|} \) ...

***

Also, there is a way to solve laplace(\( \frac{1}{1+t^{2}} \), t, s) without getting "Limit: Max order reached or unable to make series expansion Error: Bad argument" error?

(10-26-2015 05:00 AM)Archanus Wrote: [ -> ][color=#0000CD][b]Hey Salvomic

Is there a way to implement Fourier Transform to HP Prime? It has been a long time since nobody view this post :/

...

hi Arcanus,

for "classic" Fourier transform, please, see this thread:

http://www.hpmuseum.org/forum/thread-294...+transform
I made a program to calculate the Fourier coefficient, but now Prime has inside the a_n, b_n c_n coefficients by itself, I don't remember other improvements about this argument...

Sure Parisse had wrote something about, maybe...

Salvo

(10-26-2015 05:00 AM)Archanus Wrote: [ -> ][color=#0000CD][b]Hey Salvomic

Electrical Engineering students need a lot this powerful Integral Transform

Please explain what is missing if you still think something is no there that should be. You have 3 different varieties of fourier transforms at this moment.

(10-26-2015 07:27 AM)salvomic Wrote: [ -> ] (10-26-2015 05:00 AM)Archanus Wrote: [ -> ]Hey Salvomic

Is there a way to implement Fourier Transform to HP Prime? It has been a long time since nobody view this post :/

...

hi Arcanus,

for "classic" Fourier transform, please, see this thread:

http://www.hpmuseum.org/forum/thread-294...+transform

I made a program to calculate the Fourier coefficient, but now Prime has inside the a_n, b_n c_n coefficients by itself, I don't remember other improvements about this argument...

Sure Parisse had wrote something about, maybe...

Salvo

[color=#0000CD][b]Hey

!

Yes dear friend, but I'm asking for Fourier Transform with Integrals

https://upload.wikimedia.org/math/3/f/6/...8eb1c6.png
You made a nice program to find the coeff

of the Fourier Series, Trigonometric & Exponential

(10-26-2015 06:39 PM)Archanus Wrote: [ -> ]...

You made a nice program to find the coeff of the Fourier Series, Trigonometric & Exponential [/b][/color]

thank you for compliments :-)

I hope also to have that, as I wrote in the original post.

Tim says well that the Prime has all the other forms of Fourier transform (that are sure more used) but this one would complete the series...

Salvo

(10-26-2015 06:44 PM)salvomic Wrote: [ -> ] (10-26-2015 06:39 PM)Archanus Wrote: [ -> ]...

You made a nice program to find the coeff of the Fourier Series, Trigonometric & Exponential [/b][/color]

thank you for compliments :-)

I hope also to have that, as I wrote in the original post.

Tim says well that the Prime has all the other forms of Fourier transform (that are sure more used) but this one would complete the series...

Salvo

You're welcome

Hey

For the Coeff An that is:

https://upload.wikimedia.org/math/8/c/2/...7b6ceb.png
In the HP Prime: fourier_bn(t,t,2,-1,1) ; in other words that function to implement in Fourier Series but the Period is from -1 to 1, so it's 2... I use bn because it's an odd function so a0 & an == 0

In Wolfram Mathematica and the HP Prime is a lot of different, please help