Skip to content

Latest commit

 

History

19 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Michigan_state_problem

The problem is given a nxd x nxd structured matrix where every non overlapping dxd element is a diagonal matrix.

The purpose of this repo is to solve this problem using matrix data structure.

In this data structure each element is a diagonal matrix and hence we define elementary operations of a diagonal matrix and use them such that they are efficient.

Basic Steps:

Screenshot 2024-07-09 at 12 08 53 AM

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages