Numerical upper bounds on ropelengths of large physical knots

Numerical computations explored for this paper show that an upper bound on the ropelength of large knots with crossing number n grows as fast as nln ²n. The algorithms to randomly generate samples of such large knots and to determine an upper bound on the ropelength for each knot are described. The numeric results are presented and compared to the smallest known theoretical upper bounds on ropelength.