Answered You can hire a professional tutor to get the answer.

# Compose a 1250 words assignment on matrix project. Needs to be plagiarism free!

Compose a 1250 words assignment on matrix project. Needs to be plagiarism free! The algorithm run in time often takes the flowing 7th recursive divide and conquer technique (Storer 2001: 169-170), in which the matrices X and Y are divided into four different quarters and their seven factors computed. then, they are combined in four parts to result in matrix Z. In this application, the algorithms are described below:

Thus, in case the matrices X and Y are not square matrices, there will be a need to fill the missing columns and rows with zeros. Matrices X, Y, and Z are thus partitioned into equally sized block matrices

Even with this design, the number of multiplications has not reduced, 8 multiplications are still required to calculate the matrices. this is just the same as the number of multiplications required when the standard matrix multiplication method is used (Scheinerman 2006: 278). An important part, thus, is to define new matrices as below.

These are then used to express the product matrix in terms of. Due to how the product matrix has been defined, it is easy to eliminate one matrix multiplication and thus decrease the number of multiplications required to just 7, one for every, and express as

Then, the process of division is then iterated n times until the sub-matrices result in elements of the ring W. It is important to note that the Strassen’s algorithm can be efficiently implemented when carrying out multiplication of small sub-matrices using standard matric multiplication techniques.

Standard matrix multiplication often takes roughly (in which ) additions and multiplications. The number of multiplications and additions that are needed in the Strassen Algorithm can be calculated by considering the function (n) to be the number of required operations for any random matrix (Stoller & Bennett 2014: 77). Then, by applying the Strassen Algorithm recursively, it can be seen that f(n) = 7f(n− d) + l4n for a given constant d which depends on the number of additions carried out at every point of application.