From: Ken Thomas <kst@ecs.soton.ac.uk>
Subject: Re: Ada implementation of QR decomposition
Date: 1997/08/05
Date: 1997-08-05T00:00:00+00:00 [thread overview]
Message-ID: <33E6E22F.41C67EA6@ecs.soton.ac.uk> (raw)
In-Reply-To: 1997Aug4.110651.6150@news
Gautier wrote:
>
> > I'm lookin' for a time-saver here: Does anyone have an Ada
> > implementation (preferably generic, but I doubt I'm going to get
> > that latitude of choice) for the QR decomposition of a real
> > matrix?
>
> According to the system you're using, you can interface with the
> optimised xGEQRF Lapack routine in Fortran.
>
> --
> Gautier
>
> --------
> Homepage: http://www.unine.ch/math/Personnel/Assistants/Gautier/Montmollin.html
> Software: http://www.unine.ch/math/Personnel/Assistants/Gautier/Gaut_FTP.htm
I have an implementation of the QR algorithm in Ada. It is (my own)
child package of generic_real_arrays from Drexel
http://dflwww.ece.drexel.edu/research/ada
I can supply the source.
--
Dr K.S. Thomas
Department of Electronics and Computer Science
University of Southampton
Highfield
Southampton SO17 1BJ
United Kingdom
Telephone : (+44) 01703 593029
Fax : (+44) 01703 593903
email: kst@ecs.soton.ac.uk
prev parent reply other threads:[~1997-08-05 0:00 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
1997-07-24 0:00 Ada implementation of QR decomposition Jan Galkowski
1997-07-25 0:00 ` Mats Weber
1997-08-04 0:00 ` Gautier
1997-08-05 0:00 ` Ken Thomas [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox