|[eigen] Fast method for computing Gramian Matrix|
[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]
(sorry for hitting send too soon) http://en.wikipedia.org/wiki/Gramian_matrix What is the fastest way to compute MM' when M is wide?The diagonal elements are the norm-squared of the rows of M. The result is Hermitian.
Is there an optimized method in Eigen or otherwise?
|Mail converted by MHonArc 2.6.19+||http://listengine.tuxfamily.org/|