From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,bf6542399c65f391 X-Google-Attributes: gid103376,public X-Google-Thread: 107079,bf6542399c65f391 X-Google-Attributes: gid107079,public From: Ken Thomas Subject: Re: Ada implementation of QR decomposition Date: 1997/08/05 Message-ID: <33E6E22F.41C67EA6@ecs.soton.ac.uk>#1/1 X-Deja-AN: 262684559 Distribution: inet References: <33D7607A.52BFA1D7@digicomp.com> <1997Aug4.110651.6150@news> Organization: CCG Newsgroups: comp.lang.ada,sci.math.num-analysis Date: 1997-08-05T00:00:00+00:00 List-Id: 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