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,fded8d14c74b14e5 X-Google-Attributes: gid103376,public From: Gautier Subject: Re: Looking for Ada Technique Name and References Date: 2000/02/22 Message-ID: <38B1D1A8.D30E6C55@maths.unine.ch>#1/1 X-Deja-AN: 588141526 Content-Transfer-Encoding: 7bit References: <88kegp$iso$1@coward.ks.cc.utah.edu> <88kh6q$j4j$1@coward.ks.cc.utah.edu> To: John Halleck X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Trace: 21 Feb 2000 23:59:21 +0100, mac13-32.unine.ch Organization: Maths - Uni =?iso-8859-1?Q?Neuch=E2tel?= MIME-Version: 1.0 Newsgroups: comp.lang.ada Date: 2000-02-22T00:00:00+00:00 List-Id: Hi. The point with what you are trying to do is that the "*" cannot know if its argument is transposed by nature... unless you create a sort of matrices that are taken as transposed! But it doesn't solve your pb. The thing to do is "function Mult_transposed_by(..." as suggested. No ambiguity... NB: For small matrices (3x3) it's not so dramatic explicitely to transpose - since you chose the functional writing that's is already a bit more expensive. The real cost is with the multiplications. Transposing is not too awful - no fp arithmetic and well cached. E.g. I fill sparse matrices with tiny 4x4 up to 27x27 matrices involved in expressions like Transpose(Me4) + Transpose(Me3) + Re + Transpose(Me) and the filling is very fast (DEC Ada on OpenVMS). -- Gautier _____\\________________\_______\ http://members.xoom.com/gdemont/