Mathematica How can I optimize Mathematica computation time for functional definitions?

AI Thread Summary
The discussion centers around optimizing function definitions in Mathematica to improve computation speed. The user experiences significant delays when using a delayed definition (f[x_] := ...) for a function that involves complex calculations, as this causes Mathematica to evaluate the entire sequence from scratch each time the function is called. In contrast, using an immediate definition (f[x_] = ...) allows for pre-evaluation, which significantly reduces overhead and speeds up subsequent calculations. The user notes that while immediate definitions are faster, they still encounter slow evaluation times for integrals. To enhance efficiency further, the user seeks a method to automate the process of redefining the function after obtaining a numerical result, as manual redefinition is cumbersome for multiple iterations. The discussion highlights the importance of choosing the right type of function definition in Mathematica for performance optimization.
member 428835
Hi PF!

I am using the following code in Mathematica
Code:
mat = {{1, Cos[2], Cos[4], Sin[2], 
    Sin[4}, {1, 1, 1, 0, 0}};
Li[x_] := 
  Transpose[
   NullSpace[
     mat].{{1}, {Cos[x}, {Cos[
       2 x]}, {Sin[x]}, {Sin[2 x]}}];
Li1[x_] := Li[x].{{1}, {0}, {0}};
f[x_] := 
  Li1[x]/Sqrt[Integrate[Li1[s]^2, {s, -1, 1}]];
Then when I want to compute something simple, say
Code:
Integrate[f[x]^2, {x, -1, 1}]
It takes Mathematica a very long time to compute. However, if I first do
Code:
f[x]//N
and then redefine ##f## in terms of the result mathematica prints and ask for the integral, Mathematica computes the integration in much less time. Does anyone know how to define ##f## to begin with in this "numeric" fashion to decrease run time?
 
Physics news on Phys.org
The main reason for the slow speed is because
Code:
f[x_]:= (some stuff here)
is a functional definition, so that whenever ##f(\alpha)## is called for a particular argument ##\alpha##, the sequence of instructions given in (some stuff here) will be evaluated from scratch. So, if (some stuff here) contains something relatively complicated such as an integral, you can see why the complexity builds up tremendously fast (especially when you're trying to integrate ##f(x)## itself!). That is to say, the right hand side will only be evaluated when the function is called.

Conversely if you instead adopt the definition
Code:
f[x_]= (some stuff here)
where the colon has been omitted, then the right-hand-side is immediately evaluated. This greatly reduces the subsequent overhead.

I personally almost always use the "=" (immediate definition) instead of ":=" (delayed definition) unless I need to keep the right hand side in unevaluated form for some reason.
 
  • Like
Likes jim mcnamara
Fightfish said:
The main reason for the slow speed is because
Code:
f[x_]:= (some stuff here)
is a functional definition, so that whenever ##f(\alpha)## is called for a particular argument ##\alpha##, the sequence of instructions given in (some stuff here) will be evaluated from scratch. So, if (some stuff here) contains something relatively complicated such as an integral, you can see why the complexity builds up tremendously fast (especially when you're trying to integrate ##f(x)## itself!). That is to say, the right hand side will only be evaluated when the function is called.
Good to know, thanks!

Fightfish said:
Conversely if you instead adopt the definition
Code:
f[x_]= (some stuff here)
where the colon has been omitted, then the right-hand-side is immediately evaluated. This greatly reduces the subsequent overhead.

I personally almost always use the "=" (immediate definition) instead of ":=" (delayed definition) unless I need to keep the right hand side in unevaluated form for some reason.
This way is quicker but is still taking a significant amount of time to evaluate integrals. For example, if after running
Code:
f[x]//N
I redefine ##f## as
Code:
f[x_]=
0.9073859955296714 (0.534409621782702 - 
   0.534409621782702 Cos[x] + Sin[2 x])
subsequent operations on ##f## are computed almost instantly. But I have to manually redefine ##f## in this fashion. Since I will be performing many iterations it would be nice to automate this process. Do you have any ideas how to do this?

Thanks for your interest!
 

Similar threads

Replies
1
Views
2K
Replies
13
Views
2K
Replies
1
Views
2K
Replies
12
Views
5K
Replies
2
Views
2K
Replies
3
Views
2K
Replies
4
Views
3K
Replies
1
Views
2K
Back
Top