Sentence examples for matrix multiplication of from inspiring English sources
Factor scores were computed for each sample by a matrix multiplication of the factor score coefficient with the standardised data.
The value of the linear predictor is again obtained by matrix multiplication of the design matrix (Xmat) and the parameter vector (beta.vec).
In 2012, Kujawski proved that matrix multiplication of ordinal TRL and IRL data elements produces inaccurate computations of system readiness [17].
In this paper, it is shown that the parity check matrix can be constructed using patterned sub-matrix structure such that the matrix inverse operation is replaced by matrix multiplication of sparse matrices.
We first design three efficient basic operations which include the matrix multiplication of two N×N matrices, finding the minimum spanning tree of a graph with N vertices, and identifying the connected component containing a specified vertex.
Finally, left matrix multiplication of both sides by the polynomial basis matrix given in Equation (30) results in the time domain reconstructed signal y ̂, i.e. y ̂ = P · G = P · W † · D · y.
It is not difficult to see that solving (15) requires at most n matrix inversions and n 2+2n matrix multiplications of (S_{r}^{(j)}(Z))'s.
We showed that the linear system derived from the dual relation G P D T H D =[=[0] can be easily solved by doing at most n matrix inversions and at most n 2+2n matrix multiplications of the K×K coefficient matrices (S_{r}^{(j)}(Z))'s having a nice structural property, so that the computational complexity of the proposed algorithm is only O(K 4) compared to that of the existing algorithm O(K 6).
The main delivery of this paper is a model-driven approach to adaptation of the double-precision matrix multiplication to architectures of blade systems based on two types of Cell processors.
The explicit polynomial that we consider is the iterated matrix multiplication polynomial of n generic matrices of size n×n.
Using the matrix multiplication algorithm of Chan [ 12], this algorithm runs in O | Σ | n 3 log 3 log n log 2 n time (Section "A matrix multiplication based algorithm for EDDC").
