矩阵(数组数组|二维数组)无循环求和。有更好的方法吗？

def matrix_sum(matrix):
    if not matrix or len(matrix) == 0 or len(matrix[0]) == 0:
        return 0
    
    def recursive_sum(matrix, start_row, end_row, start_col, end_col):
        if start_row == end_row and start_col == end_col:
            return matrix[start_row][start_col]
        
        mid_row = (start_row + end_row) // 2
        mid_col = (start_col + end_col) // 2
        
        sum_upleft = recursive_sum(matrix, start_row, mid_row, start_col, mid_col)
        sum_upright = recursive_sum(matrix, start_row, mid_row, mid_col + 1, end_col)
        sum_downleft = recursive_sum(matrix, mid_row + 1, end_row, start_col, mid_col)
        sum_downright = recursive_sum(matrix, mid_row + 1, end_row, mid_col + 1, end_col)
        
        return sum_upleft + sum_upright + sum_downleft + sum_downright
    
    return recursive_sum(matrix, 0, len(matrix) - 1, 0, len(matrix[0]) - 1)