Re: Fast solution to very small eigenvalue problem

From: Ron Shepard (ron-shepard_at_NOSPAM.comcast.net)
Date: 06/25/04 

Date: Fri, 25 Jun 2004 00:21:24 -0500

In article <PCn*9dSnq@news.chiark.greenend.org.uk>,
 Mark Mackey <markm@chiark.greenend.org.uk> wrote:

> Does anyone have any suggestions as to the most efficient way to solve
> this problem? Extreme accuracy is not required. 4x4 is probably small
> enough that there's an analytic solution :).

Do you have all of the (hundreds of thousands) of 4x4 matrices
available at the same time, or are you repeating the diagonalization
on this many matrices one after the other? If it is the former
situation, then you might try to optimize a special-purpose
diagonalization routine so that it vectorizes over all the matrices
at once.

$.02 -Ron Shepard

Relevant Pages

  • Re: Fast solution to very small eigenvalue problem
    ... Mark Mackey wrote: ... Extreme accuracy is not required. ... > enough that there's an analytic solution:). ... diagonalization routine so that it vectorizes over all the matrices ...
    (comp.programming)
  • Re: Fast solution to very small eigenvalue problem
    ... Mark Mackey wrote: ... > I need to find the eigenvector corresponding to the largest eigenvalue ... Extreme accuracy is not required. ... > enough that there's an analytic solution:). ...
    (comp.programming)
  • Re: Fast solution to very small eigenvalue problem
    ... Mark Mackey wrote: ... > I need to find the eigenvector corresponding to the largest eigenvalue ... Extreme accuracy is not required. ... > enough that there's an analytic solution:). ...
    (sci.math.num-analysis)
Loading