Shouldn't be hard, but we'd better have a systematic approach to deal with all variants, such as A' * B * C, A * B * C', etc.
I guess we don't want to make a large family of functions like At_mul_B_mul_C, etc ... We might do this after #6837 <https://github.com/JuliaLang/julia/pull/6837> lands. Dahua On Tuesday, June 3, 2014 8:12:03 AM UTC-5, Stefan Karpinski wrote: > > The reason why A*B*C is parsed as *(A,B,C) is so this can be done but no > one has implemented it yet. Shouldn't be hard though. > > On Jun 3, 2014, at 9:05 AM, Adam Burry <[email protected] <javascript:>> > wrote: > > On Tuesday, June 3, 2014 7:57:28 AM UTC-2:30, Tony Kelman wrote: >> >> Not sure what you mean by optimizing matrix chain multiplication, I think >> when it comes to operator precedence and making associative transformations >> these are not currently performed automatically. Dominique Orban has a >> deferred-calculation linear operator package you may want to look at >> https://github.com/dpo/linop.jl >> > > Thank you for your reply. Associative transformation is what I meant. That > is, given A x B x C, it may be more efficient to calculate A x (B x C). > > Adam > >
