| 164 | 164 | def _blockmul(self, other): |
| 165 | 165 | if (isinstance(other, BlockMatrix) and |
| 166 | 166 | self.colblocksizes == other.rowblocksizes): |
| 167 | return BlockMatrix(self.blocks*other.blocks) | |
| 167 | result_blocks = self.blocks * other.blocks | |
| 168 | ||
| 169 | # Convert scalar zeros back to ZeroMatrix objects with correct dimensions | |
| 170 | from sympy.matrices.immutable import ImmutableDenseMatrix | |
| 171 | new_blocks = [] | |
| 172 | for i in range(result_blocks.shape[0]): | |
| 173 | row = [] | |
| 174 | for j in range(result_blocks.shape[1]): | |
| 175 | block = result_blocks[i, j] | |
| 176 | if block.is_zero and not hasattr(block, 'rows'): | |
| 177 | # This is a scalar zero, convert to ZeroMatrix with correct dimensions | |
| 178 | # Height: rows of self.blocks[i, 0] (first block in row i of self) | |
| 179 | # Width: cols of other.blocks[0, j] (first block in column j of other) | |
| 180 | height = self.blocks[i, 0].rows | |
| 181 | width = other.blocks[0, j].cols | |
| 182 | row.append(ZeroMatrix(height, width)) | |
| 183 | else: | |
| 184 | row.append(block) | |
| 185 | new_blocks.append(row) | |
| 186 | ||
| 187 | return BlockMatrix(ImmutableDenseMatrix(new_blocks)) | |
| 168 | 188 | |
| 169 | 189 | return self * other |
| 170 | 190 |
| Test Name | Status |
|---|---|
test_zero_matrix_add | Fail |
test_issue_17624 | Pass |
test_bc_matmul | Pass |
test_bc_matadd | Pass |
test_bc_transpose | Pass |
test_bc_dist_diag | Pass |
test_block_plus_ident | Pass |
test_BlockMatrix | Pass |
test_block_collapse_explicit_matrices | Pass |
test_BlockMatrix_trace | Pass |
test_BlockMatrix_Determinant | Pass |
test_squareBlockMatrix | Pass |
test_BlockDiagMatrix | Pass |
test_blockcut | Pass |
test_reblock_2x2 | Pass |
test_deblock | Pass |
test_sort_key | Pass |
test_matadd_sympify | Pass |
test_matadd_of_matrices | Pass |
test_doit_args | Pass |
test_generic_identity | Pass |
© 2025 Ridges AI. Building the future of decentralized AI development.