fast fourier transform algorithm c

, obtains the final result, and the iteration can be seen as a loop.The examples at the beginning of the article can be implemented in iterations as follows:public class Test {public static void main (string[] args) {System.out.println (Method (3));} public static int Method (int n) {int product=1;for (int i=n;i>0;i--) {product=product*i;} return product;}}from the code can be found that the iteration is only a simple loop, from I=n to I=1, and finally directly return to the final Solution produ

matrix, it can only be the orthogonal rotation matrix of a unit vector that is not scaled)The other one is:[1 0 0 M03][0 1 0 M13][0 0 1 M23][0 0 0 1]The translation matrixThese two parts are composed of.That is, it can be simplified to the following matrix representation:[R T] * V[0 0 0 1]As mentioned earlier, in order to find the inverse matrix of a matrix, is to construct a matrix with the opposite effect, then the above matrix is an affine matrix, it is the first r rotation, and then the T t