increase tolerance for iterative methods

Author: fredrikekre

test/inversemap.jl

@@ -10,7 +10,7 @@ using Test, LinearMaps, LinearAlgebra, SparseArrays, IterativeSolvers
     # Cholesky
     @test A \ b ≈ InverseMap(cholesky(A)) * b
     # Specify solver
-    @test A \ b ≈ InverseMap(A; solver=IterativeSolvers.cg!) * b
+    @test A \ b ≈ InverseMap(A; solver=IterativeSolvers.cg!) * b atol=1e-8
     # Composition with other maps
     @test A \ B * b ≈ InverseMap(lu(A)) * B * b
     # Composition: make sure solvers called with vector B * b and not matrix B
@@ -29,7 +29,7 @@ using Test, LinearMaps, LinearAlgebra, SparseArrays, IterativeSolvers
     my_ldiv! = (y, A, x) -> copy!(y, A \ x)
     @test A \ b ≈ InverseMap(cholesky(A); solver=my_ldiv!) * b
     # Specify solver
-    @test A \ b ≈ InverseMap(A; solver=IterativeSolvers.cg!) * b
+    @test A \ b ≈ InverseMap(A; solver=IterativeSolvers.cg!) * b atol=1e-8
     # Composition with other maps
     @test A \ (B * b) ≈ InverseMap(lu(A)) * B * b
     # Composition: make sure solver is called with vector B * b and not matrix B
@@ -59,5 +59,5 @@ using Test, LinearMaps, LinearAlgebra, SparseArrays, IterativeSolvers
     U = IterativeSolvers.cg(M, F - B * P)
 
     # Solve using standard method and compare
-    @test [M B; B' 0I] \ [F; G] ≈ [U; P]
+    @test [M B; B' 0I] \ [F; G] ≈ [U; P] atol=1e-8
 end