Re: Fast solution to very small eigenvalue problem
From: Mark Mackey (markm_at_chiark.greenend.org.uk)
Date: 06/25/04
- Next message: goose: "Re: OOP and memory management"
- Previous message: Mark Mackey: "Re: Fast solution to very small eigenvalue problem"
- In reply to: Ron Shepard: "Re: Fast solution to very small eigenvalue problem"
- Next in thread: Julian V. Noble: "Re: Fast solution to very small eigenvalue problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 25 Jun 2004 11:11:28 +0100 (BST)
In article <ron-shepard-198F65.00212425062004@comcast.dca.giganews.com>,
Ron Shepard <ron-shepard@NOSPAM.comcast.net> wrote:
>
>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.
Ooh, nice idea. Unfortunately this is a serial process :(.
-- Mark Mackey "The determined Real Programmer can write Fortran programs in any language." - "Real Programmers don't use Pascal"
- Next message: goose: "Re: OOP and memory management"
- Previous message: Mark Mackey: "Re: Fast solution to very small eigenvalue problem"
- In reply to: Ron Shepard: "Re: Fast solution to very small eigenvalue problem"
- Next in thread: Julian V. Noble: "Re: Fast solution to very small eigenvalue problem"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]