Open
Description
Assume we have a 2D matrix A with A1xA2 dimensions.
Assume we have a 2D matrix B with B1xB2 dimensions where B1<A1 and B2<A2.
Basically B "fits in" A.
Then I don't think there is a way to add B to a sub matrix (same size) of A efficiently. This rather popular operation in certain types of algorithms (which use merging and elimination of matrices). Note that this has been implemented in other libraries by using "projections" or "views". You just select a sub matrix of A without making any copies and then use it to do normal additions. You then can just dispose of the view because the data gets updated properly - and you can use all the normal operators you'd use (although only some of them probably make sense).
Please see Breeze.