Re: Fast solution to very small eigenvalue problem
From: Mark Mackey (markm_at_chiark.greenend.org.uk)
Date: 07/02/04
- Next message: Paul Hsieh: "Re: OOP and memory management"
- Previous message: William: "Re: assembly"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 02 Jul 2004 18:12:10 +0100 (BST)
In article <cbh1r8$sjj$1@fb04373.mathematik.tu-darmstadt.de>,
Peter Spellucci <nospamspellucci@fb04373.mathematik.tu-darmstadt.de> wrote:
>even simpler and seemingly more efficient would be to derive the charactristic
>polynomial of T formally (this gives a simple recursion) and plugging this into
>a direct solver fro fourth degree polynomials (see http://www,netlib.org/toms)
>but I discourage this because of possible severe problems with roundoff, whereas
>the above one would be perfectly numerically stable
Thanks muchly for the above.
-- Mark Mackey http://www.swallowtail.org/ code code code code code code code code code code code code code bug code co de code code code bug code code code code code code code code code code code code code code code code code code code code code code code code code code c
- Next message: Paul Hsieh: "Re: OOP and memory management"
- Previous message: William: "Re: assembly"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|