|
230 | 230 | @test (V1ᴴ * V1ᴴ' ≈ LinearAlgebra.I)
|
231 | 231 |
|
232 | 232 | atol = minimum(LinearAlgebra.diag(S1)) + 10 * eps(real(T))
|
233 |
| - trunc = trunctol(atol) |
| 233 | + trunc = trunctol(; atol) |
234 | 234 |
|
235 | 235 | U1, S1, V1ᴴ = svd_trunc(a; trunc)
|
236 | 236 | U2, S2, V2ᴴ = svd_trunc(Matrix(a); trunc)
|
|
246 | 246 | rng = StableRNG(123)
|
247 | 247 | perm = Random.randperm(rng, length(m))
|
248 | 248 | b = a[Block.(perm), Block.(1:length(n))]
|
249 |
| - for trunc in (truncrank(r), trunctol(atol)) |
| 249 | + for trunc in (truncrank(r), trunctol(; atol)) |
250 | 250 | U1, S1, V1ᴴ = svd_trunc(b; trunc)
|
251 | 251 | U2, S2, V2ᴴ = svd_trunc(Matrix(b); trunc)
|
252 | 252 | @test size(U1) == size(U2)
|
|
262 | 262 | I_removed = rand(eachblockstoredindex(b))
|
263 | 263 | c = copy(b)
|
264 | 264 | delete!(blocks(c).storage, CartesianIndex(Int.(Tuple(I_removed))))
|
265 |
| - for trunc in (truncrank(r), trunctol(atol)) |
| 265 | + for trunc in (truncrank(r), trunctol(; atol)) |
266 | 266 | U1, S1, V1ᴴ = svd_trunc(c; trunc)
|
267 | 267 | U2, S2, V2ᴴ = svd_trunc(Matrix(c); trunc)
|
268 | 268 | @test size(U1) == size(U2)
|
|
0 commit comments