Given two matrices A and B, whose entries are specified in log. i.e. the ith row and jth column has log(aij). If you take the exponent of these values the numbers may just disappear (exp(-200) is approximately 0) or explode (exp(200) is approximately infinity).

So multiplying them by first taking the exponent of their entries is out of question. How to efficiently perform matrix multiplication in such cases. There are two pieces to the jigsaw puzzle.

log(a*b) = log(a)+ log(b)

log(a+b) ~ max(log(a),log(b)) + k* exp(-abs(log(a)-log(b)))

k = 0.77

the second formula is called the "Chad's approximation formula"

How to use these? Crank at your computer a little

So multiplying them by first taking the exponent of their entries is out of question. How to efficiently perform matrix multiplication in such cases. There are two pieces to the jigsaw puzzle.

log(a*b) = log(a)+ log(b)

log(a+b) ~ max(log(a),log(b)) + k* exp(-abs(log(a)-log(b)))

k = 0.77

the second formula is called the "Chad's approximation formula"

How to use these? Crank at your computer a little