This is the mail archive of the
gsl-discuss@sources.redhat.com
mailing list for the GSL project.
Re: Here is some GSL code for a rank-revealing QRPT
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: <rlee at fpcc dot net>
- Cc: <gsl-discuss at sources dot redhat dot com>
- Date: Wed, 12 Nov 2003 13:28:19 +0000
- Subject: Re: Here is some GSL code for a rank-revealing QRPT
- References: <35906.64.24.109.89.1068572699.squirrel@webmail.fpcc.net>
rlee@fpcc.net writes:
> I posted "Help developing a "better" QRPT routine". I guess sometimes we
> help those who help themselves ;-)
>
> Here GSL code for rank-revealing QRPT. It is just a minor tweak of
> gsl_linalg_QRPT_decomp -- the key feature is a different pivoting
> strategy.
>
> I would appreciate any suggestions on making this more "GSL like".
> I've only tested it with some M>N matrices -- some rank deficient.
>
> So, does anyone think this could be a valuable addition to GSL?
Hi,
If there is an improved algorithm I would be in favor of using it.
Is there a paper or other reference (maybe a Lapack Working Note)
which describes this algorithm? The first step is to find out what
has been written about it.
--
Brian Gough