You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello,
Great package, I am very excited to work with it. I have been having some trouble using higher sweep counts (> ~2000). I have distilled the problem to a minimal example. I get a segmentation fault when I try to execute the following code:
from pysa.sa import Solver
import numpy as np
float_type = 'float32'
n_vars = 2
problem = 2 * np.random.random((n_vars, n_vars)) - 1
problem = (problem + problem.T) / 2
solver = Solver(problem=problem, problem_type='ising', float_type=float_type)
solver.metropolis_update(num_sweeps = 2048)
I have done some initial testing and I can run up to 2033 sweeps without segmentation fault, though I don't know if this number is machine specific.
Is there something that I am doing wrong, or is there some limit on the number of sweeps?
Thank you in advance!
The text was updated successfully, but these errors were encountered:
Hello,
Great package, I am very excited to work with it. I have been having some trouble using higher sweep counts (> ~2000). I have distilled the problem to a minimal example. I get a segmentation fault when I try to execute the following code:
I have done some initial testing and I can run up to 2033 sweeps without segmentation fault, though I don't know if this number is machine specific.
Is there something that I am doing wrong, or is there some limit on the number of sweeps?
Thank you in advance!
The text was updated successfully, but these errors were encountered: