SCS.Direct solver is faster for those problems
This commit is contained in:
parent
044cdb06e8
commit
1aba4efa21
@ -117,7 +117,7 @@ function main()
|
|||||||
AutS = WreathProduct(Nemo.FiniteField(2,1, "a")[1], PermutationGroup(N))
|
AutS = WreathProduct(Nemo.FiniteField(2,1, "a")[1], PermutationGroup(N))
|
||||||
# AutS = PermutationGroup(N)
|
# AutS = PermutationGroup(N)
|
||||||
|
|
||||||
solver = SCS.SCSSolver(eps=tol, max_iters=iterations, verbose=true, linearsolver=SCS.Indirect)
|
solver = SCS.SCSSolver(eps=tol, max_iters=iterations, verbose=true, linearsolver=SCS.Direct)
|
||||||
|
|
||||||
sett = Settings(dirname, N, G, S, AutS, radius, solver, upper_bound, tol)
|
sett = Settings(dirname, N, G, S, AutS, radius, solver, upper_bound, tol)
|
||||||
|
|
||||||
|
@ -153,7 +153,7 @@ function main()
|
|||||||
AutS = WreathProduct(Nemo.FiniteField(2,1, "a")[1], PermutationGroup(N))
|
AutS = WreathProduct(Nemo.FiniteField(2,1, "a")[1], PermutationGroup(N))
|
||||||
# AutS = PermutationGroup(N)
|
# AutS = PermutationGroup(N)
|
||||||
|
|
||||||
solver = SCS.SCSSolver(eps=tol, max_iters=iterations, verbose=true, linearsolver=SCS.Indirect)
|
solver = SCS.SCSSolver(eps=tol, max_iters=iterations, verbose=true, linearsolver=SCS.Direct)
|
||||||
|
|
||||||
sett = Settings(dirname, N, G, S, AutS, radius, solver, upper_bound, tol)
|
sett = Settings(dirname, N, G, S, AutS, radius, solver, upper_bound, tol)
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user