Re: [eigen] Fast method for computing Gramian Matrix

[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]


On Thu, Mar 29, 2012 at 3:50 AM, Mark Borgerding <mark@xxxxxxxxxxxxxx> wrote:
> (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?

I have used the rankUpdate method for a selfadjoint view to calculate
this.  I assume that it is an efficient way to calculate the result
but I haven't done any timings.


MatrixXcd MMt(M.rows(), M.rows();
MMt.setZero().selfadjointView<Eigen::Upper>().rankUpdate(M);



Mail converted by MHonArc 2.6.19+ http://listengine.tuxfamily.org/