Could you make a bibtex style file with this feature that also works with natbib.

]]>Thanks – corrected.

]]>The fact that $A^0 = I$ is mentioned in Cayley’s original 1858 paper on matrix algebra. It must hold, as a consequence of the definition of inverse and index laws: $I = A^{-1} A = A^{-1 +1} = A^0$.

]]>The same would be true for sets of 3 matrices except for the combinatorial constraints on matrices of order 0, which is a “gotcha” on sloppily oversimplified statements of the result. I don’t know the original statement but perhaps it is the original statement which is oversimplified and doesn’t anticipate such degenerate constructions.

]]>I would like to add a classical source of the Kronecker product of two matrices, briefly commented in the paper by Van Loan: bivariate polynomial interpolation. In fact, in a natural way a “generalized Kronecker product” arises.

See, for instance, a recent recall of these facts in our paper “Accurate polynomial interpolation by using the Bernstein basis” (Numerical Algorithms, 2017):

https://link.springer.com/article/10.1007/s11075-016-0215-7

Thank you very much for your work.

]]>You’re right. I was more careful in my wording in https://nhigham.com/2020/06/02/what-is-bfloat16-arithmetic/

]]>Thanks for your answer.

]]>