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.6 required=5.0 tests=BAYES_05,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC 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: Gautier.DeMontmollin@maths.unine.ch (Gautier) Subject: Re: Ada implementation of QR decomposition Date: 1997/08/04 Message-ID: <1997Aug4.110651.6150@news>#1/1 X-Deja-AN: 262197418 References: <33D7607A.52BFA1D7@digicomp.com> Reply-To: Remove_this.Gautier.deMontmollin@Maths.UniNe.CH Distribution: inet Organization: University of Neuchatel, Switzerland Newsgroups: comp.lang.ada,sci.math.num-analysis Date: 1997-08-04T00:00:00+00:00 List-Id: > 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