Figure 11

The base case of the Outside VMT algorithm. (a) An illustration of the matrix A upon computing A_{i, j}. (b) An illustration of the pre-computed matrix β. All required values of the form α_{i', j'}for computing α_{i, j}have already been computed in the sub-matrix A_{[0,i], [j,n]}, excluding the entry A_{i, j}itself. μ_{i, j}is obtained either by the multiplication (β_[0,i),i)^T ⊗ A_{[0,i), j}(the multiplication of the transposed striped dark gray vector in β with the striped dark gray vector in A), or by the multiplication A_{i,(j, n]}⊗ (β_{j,(j, n]})^T (the multiplication of the non-striped dark gray vector in A with the transposed non-striped dark gray vector in β).