# report.pdf - Implement Strassen’s Matrix Algorithm DAA...

• 3

This preview shows page 1 - 2 out of 3 pages.

Implement Strassen’s Matrix AlgorithmDAA ASSIGNMENT-4 , GROUP 6Shreyansh PatidarIIT2019018Biswajeet DasIIT2019019Hritik SharmaIIT2019020Abstract:In this paper we have devised an algorithmwhich is an implementation of Strassen’s matrix algorithmusing divide and conquer.This report further contains-(I) Algorithm Design(II) Algorithm Analysis(III) Result(IV) ConclusionI. INTRODUCTIONIn this report, we are going to discuss strassen matrixmultiplication,formula of matrix multiplication and algorithmsfor strassen matrix multiplication. Let us consider two matricesX and Y. We want to calculate the resultant matrix Z bymultiplyingXandY.Matrixmultiplicationisabinaryoperation that produces a matrix from two matrices. Formatrix multiplication, the number of columns in the firstmatrix must be equal to the number of rows in the secondmatrix. The resulting matrix, known as the matrix product,has the number of rows of the first and the number of columnsof the second matrix. Thus the product XY is defined if andonly if the number of columns in X equals the number ofrows in Y.The utility of Strassen’s formula is shown by itsasymptotic superiority when order n of matrix reaches infinity.Z=xi1y1j+xi2y2j+. . . . . . .+xinynjZ= ΣxikykiII. ALGORITHM DESIGN(A) Recursive method :(1) Divide matrices A and B in 4 sub-matrices ofsize n/2 X n/2.

Upload your study docs or become a

Course Hero member to access this document

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 3 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Fall
Professor
posma
Tags
Computational complexity theory, Divide and conquer algorithm
• • • 