@@ -211,21 +211,22 @@ println("Testing (I)Padua Transforms and their inverse function property")
211
211
n= 200
212
212
N= div ((n+ 1 )* (n+ 2 ),2 )
213
213
v= rand (N) # Length of v is the no. of Padua points
214
-
215
- @test_approx_eq paduatransform (ipaduatransform (v)) v
216
- @test_approx_eq ipaduatransform (paduatransform (v)) v
214
+ Pl= plan_paduatransform (v)
215
+ IPl= plan_ipaduatransform (v)
216
+ @test_approx_eq paduatransform (Pl,ipaduatransform (IPl,v)) v
217
+ @test_approx_eq ipaduatransform (IPl,paduatransform (Pl,v)) v
217
218
218
219
println (" Testing runtimes for (I)Padua Transforms" )
219
- @time paduatransform (v)
220
- @time ipaduatransform (v)
221
-
222
- println (" Runtimes for Pre-planned (I)Padua Transforms" )
223
- n= 300
224
- v= rand (N)
225
- Plan= plan_paduatransform (v)
226
- IPlan= plan_ipaduatransform (v)
227
- @time paduatransform (Plan,v)
228
- @time ipaduatransform (IPlan,v)
220
+ @time paduatransform (Pl, v)
221
+ @time ipaduatransform (IPl, v)
222
+
223
+ # println("Runtimes for Pre-planned (I)Padua Transforms")
224
+ # n=300
225
+ # v=rand(N)
226
+ # Plan=plan_paduatransform(v)
227
+ # IPlan=plan_ipaduatransform(v)
228
+ # @time paduatransform(Plan,v)
229
+ # @time ipaduatransform(IPlan,v)
229
230
230
231
println (" Accuracy of 2d function interpolation at a point" )
231
232
function trianglecfsmat {T} (cfs:: AbstractVector{T} )
0 commit comments