The mechanism of the classical particle swarm optimization and the comparison criterion of different natural computing methods is investigated by introducing the discrepancy and good lattice points in number theory and proposes a novel optimization method, called good lattice points-based particle swarm optimization algorithm, which intends to produce faster and more accurate convergence because it has a solid theoretical basis and better global search ability, meanwhile the global convergence of the presented algorithm with asymptotic probability one is proved by the property of the optimal lattice. Finally experiment results are very promising to illustrate the outstanding feature of the presented algorithm.