Problem 60753. 2x2 binning of a large sparse matrix

Created by Matt J

Solve Later

Consider the 20000 x 20000 sparse matrix,
  A=round(sprand(2e4,2e4,1/1e4*100)*1000);
The task is to divide this matrix into 2x2 tiles and to form the reduced 10000 x 10000 matrix B such that B(i,j) is the sum over the elements of (i,j)-th tile of A. For example, 
  B(1,1) = A(1,1)+A(2,1)+A(1,2)+A(2,2)
  
  B(2,1) = A(3,1)+A(4,1)+A(3,2)+A(4,2)
  
  etc...
Your solution must execute in less than 0.3 sec.

Solve

Solution Stats

8 Solutions
5 Solvers

Last Solution submitted on Jan 01, 2026

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Dyuman Joshi 17 hours and 24 minutes ago

I find it interesting that I didn't immediately think of the rather obvious method.

I also find it interesting the method I (and ofcourse Matt) used was probably what Matt had in mind while coming up with this problem.

Solution Comments

Show comments

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 60753. 2x2 binning of a large sparse matrix

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author4

Problem Tags

Community Treasure Hunt

Problem 60753. 2x2 binning of a large sparse matrix

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author4

Problem Tags

Community Treasure Hunt

Players