Search - k matrix

Search - k matrix - List

[MPI] matrix_mpi DL : 0: Multiplication of matrices of size and MxK HxM. ALL shipment must be made without blocking! Managing the process: 1. Asks for the dimensions of matrices M, K, N. 2. Produces dynamic formation and filling of matrix operands. 3. Prepares and distributes tasks (calculation of value of 1 cell of the resulting matrix) among the child processes. 4. Accepts the results and record the resulting matrix. 5. Prints the matrix operands and the resultant matrix to the screen. 6. Inform the child processes to complete work. Child processes: 1. Is the job to calculate 2. Calculates the elements of the resulting matrix 3. Transmit the result of controlled processes. 4. Managing the process takes responses from all. 5. Managing the process sends a message of completion of 6. all processes are finalizing
Date : 2025-12-29 Size : 2.06mb User : anyman
[MPI] www DL : 0: 一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-Abstract: A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix. Experimental results show that such method indeed reaches its goal for complex datasets, and this method outperforms the comparative methods when there are a large number of pairwise constraints.
Date : 2025-12-29 Size : 367kb User : fanhaixiong
[MPI] jacobi DL : 0: A: aij, 1<= i,j<=n b: 1<=i<=n x0: intial guess, 1<=i<=n tol: tolerance N maximum number of iterations k: number count of iteration Xm(:,k): X in each k iteration-Jacobi s method: In numerical linear algebra, the Jacobi method is an algorithm for determining the solutions of a system of linear equations with largest absolute values in each row and column dominated by the diagonal element. Each diagonal element is solved for, and an approximate value plugged in. The process is then iterated until it converges. This algorithm is a stripped-down version of the Jacobi transformation method of matrix diagonalization. The method is named after German mathematician Carl Gustav Jakob Jacobi. http://en.wikipedia.org/wiki/Jacobi_method
Date : 2025-12-29 Size : 1kb User : Eric Chou
[MPI] K-matrix DL : 0: pso算法求解多维矩阵的matlab程序-pso algorithm matlab program for multi-dimensional matrix
Date : 2025-12-29 Size : 3kb User : andy