The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe...The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe two basic design techniques: copy and mutation, respectively. Then the relations between the four ordered slant transform matrices and the Walsh transform matrices, and on this basis, various fast algorithms for slant transform can be obtained. Here two fast algorithms for slant transform with bit-reversed Walsh order are given.展开更多
The convergence of maximum entropy methods is obtained on Kuhn-Tucker/Fritz John points. Then according to the nature of maximum entropy methods, we study the structure and convergent properties of feasible directions...The convergence of maximum entropy methods is obtained on Kuhn-Tucker/Fritz John points. Then according to the nature of maximum entropy methods, we study the structure and convergent properties of feasible directions methods with nonmonotone curvilinear search rules from the unified point. On this basis, we discuss the numerically computing technique which combines nonmonotone curvilinear search methods and maximum entropy methods, and the numerically computing results for some optimization problems are obtained. The results show that our algorithm is efficient.展开更多
文摘The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe two basic design techniques: copy and mutation, respectively. Then the relations between the four ordered slant transform matrices and the Walsh transform matrices, and on this basis, various fast algorithms for slant transform can be obtained. Here two fast algorithms for slant transform with bit-reversed Walsh order are given.
文摘The convergence of maximum entropy methods is obtained on Kuhn-Tucker/Fritz John points. Then according to the nature of maximum entropy methods, we study the structure and convergent properties of feasible directions methods with nonmonotone curvilinear search rules from the unified point. On this basis, we discuss the numerically computing technique which combines nonmonotone curvilinear search methods and maximum entropy methods, and the numerically computing results for some optimization problems are obtained. The results show that our algorithm is efficient.
