@@ -247,7 +247,7 @@ LowRankFun(f::LowRankFun) = LowRankFun(f,ChebyshevInterval(),ChebyshevInterval()
247247
248248# # Utilities
249249
250- function findapproxmax! (f:: Function ,X:: AbstractMatrix ,ptsx:: AbstractVector ,ptsy:: Vector ,gridx,gridy)
250+ function findapproxmax! (f:: Function ,X:: AbstractMatrix ,ptsx:: AbstractVector ,ptsy:: AbstractVector ,gridx,gridy)
251251 for j= 1 : gridy
252252 ptsyj = ptsy[j]
253253 @simd for k= 1 : gridx
@@ -259,23 +259,23 @@ function findapproxmax!(f::Function,X::AbstractMatrix,ptsx::AbstractVector,ptsy:
259259 maxabsf,[ptsx[imptple[1 ]],ptsy[imptple[2 ]]]
260260end
261261
262- function findapproxmax! (A:: Fun ,B:: Fun ,X:: AbstractMatrix ,ptsx:: Vector ,ptsy:: Vector ,gridx,gridy)
262+ function findapproxmax! (A:: Fun ,B:: Fun ,X:: AbstractMatrix ,ptsx:: AbstractVector ,ptsy:: AbstractVector ,gridx,gridy)
263263 Ax,By = A .(ptsx),B .(ptsy)
264264 subtractrankone! (Ax,By,X,gridx,gridy)
265265 maxabsf,impt = findmaxabs (X)
266266 imptple = CartesianIndices ((gridx,gridy))[impt]
267267 [ptsx[imptple[1 ]],ptsy[imptple[2 ]]]
268268end
269269
270- function findcholeskyapproxmax! (f:: Function ,X:: AbstractVector ,pts:: Vector ,grid)
270+ function findcholeskyapproxmax! (f:: Function ,X:: AbstractVector ,pts:: AbstractVector ,grid)
271271 @simd for k= 1 : grid
272272 @inbounds X[k]+= f (pts[k],pts[k])
273273 end
274274 maxabsf,impt = findmaxabs (X)
275275 maxabsf,pts[impt]
276276end
277277
278- function findcholeskyapproxmax! (A:: Fun ,B:: Fun ,X:: Vector ,pts:: Vector ,grid)
278+ function findcholeskyapproxmax! (A:: Fun ,B:: Fun ,X:: AbstractVector ,pts:: AbstractVector ,grid)
279279 Ax,By = A .(pts),B .(pts)
280280 subtractrankone! (Ax,By,X,grid)
281281 maxabsf,impt = findmaxabs (X)
0 commit comments