Introduction - If you have any usage issues, please Google them yourself
algorithm introduced in the matrix inversion process is very common, which are mainly used for Billboard matrix. In accordance with the definition of the method of calculating multiplication, seriously affecting the performance. The need for a large number of Billboard matrix operations, matrix inversion optimization can significantly improve performance. Here we introduce the matrix inversion algorithm called full-elected PCA Gauss-Jordan and France. Gauss-Jordan and France (all elected PCA) inversion of the following steps : First, for k from 0 to n-1 for the following steps : from the first trip k, k started out the bottom right corner Subarray largest absolute selected elements, and element remember meeting the line and out, the adoption OK exchange and the exchange out of its exchange
Packet : 15883856简易的矩陣加密編编码法.rar filelist
简易的矩陣加密編编码法\Project1.vbw
简易的矩陣加密編编码法\MSSCCPRJ.SCC
简易的矩陣加密編编码法\Form1.frm
简易的矩陣加密編编码法\Project1.vbp
简易的矩陣加密編编码法