We discuss the fact that there is a crucial contradiction within Von Neumann’s theory. We derive a proposition concerning a quantum expected value under an assumption of the existence of the orientation of reference ...We discuss the fact that there is a crucial contradiction within Von Neumann’s theory. We derive a proposition concerning a quantum expected value under an assumption of the existence of the orientation of reference frames in N spin-1/2 systems (1 ≤ N to a new constant . It may be said that a new type of the quantum theory early approaches Newton’s theory in the macroscopic scale than the old quantum theory does. We discuss how our solution is used in an implementation of Deutsch’s algorithm.展开更多
Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicit...Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicity and quick progress in the early iterations. In this work, to accelerate the convergence of the interior point method, few iterations of this generalized algorithm are applied to the Mehrotra’s heuristic, which determines the starting point for the interior point method in the PCx software. Computational experiments in a set of linear programming problems have shown that this approach reduces the total number of iterations and the running time for many of them, including large-scale ones.展开更多
文摘We discuss the fact that there is a crucial contradiction within Von Neumann’s theory. We derive a proposition concerning a quantum expected value under an assumption of the existence of the orientation of reference frames in N spin-1/2 systems (1 ≤ N to a new constant . It may be said that a new type of the quantum theory early approaches Newton’s theory in the macroscopic scale than the old quantum theory does. We discuss how our solution is used in an implementation of Deutsch’s algorithm.
文摘Optimal adjustment algorithm for p coordinates is a generalization of the optimal pair adjustment algorithm for linear programming, which in turn is based on von Neumann’s algorithm. Its main advantages are simplicity and quick progress in the early iterations. In this work, to accelerate the convergence of the interior point method, few iterations of this generalized algorithm are applied to the Mehrotra’s heuristic, which determines the starting point for the interior point method in the PCx software. Computational experiments in a set of linear programming problems have shown that this approach reduces the total number of iterations and the running time for many of them, including large-scale ones.
