Fast Fourier Transformation 2

Select your function input:

	f(x) = sqrt(x*(2*π-x)); [0,2*π]
	f(x) = 1 for x<=π and 2 for π<x<=2*π ; [0,2*π]
	Input of a function of your own, defined on [0,2*π]: Specify the function name here as text: f =  Type here the piece of code which evaluates the function following FORTRAN rules: Input variable name is "x". You may use the predefined constant π and additional program variables i,j,k (integers, e.g. for loops) bool1, bool2, bool3 (logicals), and h1,h2,h3,h4,v(100) (double precision). All these are initialized with 0 resp. false. The last line must read f= arithmetic expression or variable. c weierstrass function c this should be the sum below as an infinite one, but due to c 32 bit integers (the int(.)) we must be content here h1=0.d0 h2=x/(2.d0*pi) do k=0,30 h3=2.d0**k*h2 h4=h3-int(h3) h1=h1+min(h4,1.d0-h4)/2.d0**k enddo f=h1

Which subinterval of [0,2*π] should be considered

	the complete interval [0;2*π]
	only a part of it: left bound: right bound:

How should the y-axis be scaled?

	Scaling according to the scale of the input function f
	Scaling according to the trigonometric sum

How many points should be used for interpolation ( 3 <= n+1 <=512 and n+1=2ⁱ * 3^j * 5^k)?

n+1=

Click on "evaluate", in order to submit your input.