Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement Matrix Multiplication Using Strassen Algorithm #75

Closed
Samyssmile opened this issue Nov 1, 2023 · 0 comments
Closed

Implement Matrix Multiplication Using Strassen Algorithm #75

Samyssmile opened this issue Nov 1, 2023 · 0 comments
Assignees
Labels
enhancement New feature or request
Milestone

Comments

@Samyssmile
Copy link
Owner

Description

Implement the Strassen algorithm for matrix multiplication. This algorithm is an advanced divide and conquer method that is more efficient for large matrices.

Task Details

  • Objective: Implement the Strassen algorithm to multiply two matrices.
  • Function Signature: double[][] multiplyMatricesStrassen(double[][] matrixA, double[][] matrixB)

Acceptance Criteria

  • The implementation must adhere to the Strassen algorithm's divide and conquer approach.
  • Proper handling of base cases and recursive subdivision of matrices.
  • Unit tests to ensure the algorithm's correctness and to compare its efficiency with classical multiplication.
@Samyssmile Samyssmile added the enhancement New feature or request label Nov 1, 2023
@Samyssmile Samyssmile modified the milestones: 1.0.6, 1.0.7 Nov 1, 2023
@Samyssmile Samyssmile self-assigned this Nov 3, 2023
Samyssmile pushed a commit that referenced this issue Nov 3, 2023
Samyssmile pushed a commit that referenced this issue Nov 6, 2023
Samyssmile added a commit that referenced this issue Nov 6, 2023
Implement Matrix Multiplication Using Strassen Algorithm #75
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant