Like we use fermat's little theorem for modular exponentiation , I was just wondering that is there any such method for fast matrix exponentiation ? Can we use fermat's theorem for matrix exponentiation ? If no then is there any faster method than divide and conquer method of exponentiation ?
可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效,请关闭广告屏蔽插件后再试):
问题:
回答1:
I would look for Octave's implementation of that. There it gives you some references. Here some links:
- http://epubs.siam.org/doi/abs/10.1137/1020098
- http://www.cs.cornell.edu/cv/researchpdf/19ways+.pdf