Numericaly Inverse Fourier Transform

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite
1












Dear community of Mathematics,



Suppose that I have a PDE to solve:



I transform the equation from time (t) domain into the frequency domain (omega) via Fourier transform and then I solve it.



In order to return back into the time domain I have three options :



a) analytical inverse fourier,
b) numerical integration and c) evaluate the function on a grid (regular in each dimension) and apply inverse FFT.



I want to ask about the third option (c):
I want to make a grid by evaluating the function at different values of omega (which is in the frequency domain) how can I do this. At what omegas I will evaluate the function, complex or real ones?. At what range?



I have not experience on this at all. I would appreciate if anyone can guide me on this by giving me some insights on the steps i need to follow.



Thank you in advance.










share|cite|improve this question





















  • Are you asking about trigonometric interpolation?
    – Mattos
    Sep 10 at 2:55










  • I am not sure that it is trigonometric interpolation
    – Edmond Muho
    Sep 15 at 12:06














up vote
1
down vote

favorite
1












Dear community of Mathematics,



Suppose that I have a PDE to solve:



I transform the equation from time (t) domain into the frequency domain (omega) via Fourier transform and then I solve it.



In order to return back into the time domain I have three options :



a) analytical inverse fourier,
b) numerical integration and c) evaluate the function on a grid (regular in each dimension) and apply inverse FFT.



I want to ask about the third option (c):
I want to make a grid by evaluating the function at different values of omega (which is in the frequency domain) how can I do this. At what omegas I will evaluate the function, complex or real ones?. At what range?



I have not experience on this at all. I would appreciate if anyone can guide me on this by giving me some insights on the steps i need to follow.



Thank you in advance.










share|cite|improve this question





















  • Are you asking about trigonometric interpolation?
    – Mattos
    Sep 10 at 2:55










  • I am not sure that it is trigonometric interpolation
    – Edmond Muho
    Sep 15 at 12:06












up vote
1
down vote

favorite
1









up vote
1
down vote

favorite
1






1





Dear community of Mathematics,



Suppose that I have a PDE to solve:



I transform the equation from time (t) domain into the frequency domain (omega) via Fourier transform and then I solve it.



In order to return back into the time domain I have three options :



a) analytical inverse fourier,
b) numerical integration and c) evaluate the function on a grid (regular in each dimension) and apply inverse FFT.



I want to ask about the third option (c):
I want to make a grid by evaluating the function at different values of omega (which is in the frequency domain) how can I do this. At what omegas I will evaluate the function, complex or real ones?. At what range?



I have not experience on this at all. I would appreciate if anyone can guide me on this by giving me some insights on the steps i need to follow.



Thank you in advance.










share|cite|improve this question













Dear community of Mathematics,



Suppose that I have a PDE to solve:



I transform the equation from time (t) domain into the frequency domain (omega) via Fourier transform and then I solve it.



In order to return back into the time domain I have three options :



a) analytical inverse fourier,
b) numerical integration and c) evaluate the function on a grid (regular in each dimension) and apply inverse FFT.



I want to ask about the third option (c):
I want to make a grid by evaluating the function at different values of omega (which is in the frequency domain) how can I do this. At what omegas I will evaluate the function, complex or real ones?. At what range?



I have not experience on this at all. I would appreciate if anyone can guide me on this by giving me some insights on the steps i need to follow.



Thank you in advance.







pde fourier-analysis fourier-transform






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Sep 9 at 13:50









Edmond Muho

62




62











  • Are you asking about trigonometric interpolation?
    – Mattos
    Sep 10 at 2:55










  • I am not sure that it is trigonometric interpolation
    – Edmond Muho
    Sep 15 at 12:06
















  • Are you asking about trigonometric interpolation?
    – Mattos
    Sep 10 at 2:55










  • I am not sure that it is trigonometric interpolation
    – Edmond Muho
    Sep 15 at 12:06















Are you asking about trigonometric interpolation?
– Mattos
Sep 10 at 2:55




Are you asking about trigonometric interpolation?
– Mattos
Sep 10 at 2:55












I am not sure that it is trigonometric interpolation
– Edmond Muho
Sep 15 at 12:06




I am not sure that it is trigonometric interpolation
– Edmond Muho
Sep 15 at 12:06















active

oldest

votes











Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2910801%2fnumericaly-inverse-fourier-transform%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2910801%2fnumericaly-inverse-fourier-transform%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

Why am i infinitely getting the same tweet with the Twitter Search API?

Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

Strongly p-embedded subgroups and p-Sylow subgroups.