1
/* ---------------------------------------------------------------------
3
* -- Automatically Tuned Linear Algebra Software (ATLAS)
4
* (C) Copyright 2000 All Rights Reserved
6
* -- ATLAS routine -- Version 3.2 -- December 25, 2000
8
* Author : Antoine P. Petitet
9
* Contributor(s) : R. Clint Whaley
10
* Originally developed at the University of Tennessee,
11
* Innovative Computing Laboratory, Knoxville TN, 37996-1301, USA.
13
* ---------------------------------------------------------------------
15
* -- Copyright notice and Licensing terms:
17
* Redistribution and use in source and binary forms, with or without
18
* modification, are permitted provided that the following conditions
21
* 1. Redistributions of source code must retain the above copyright
22
* notice, this list of conditions and the following disclaimer.
23
* 2. Redistributions in binary form must reproduce the above copyright
24
* notice, this list of conditions, and the following disclaimer in
25
* the documentation and/or other materials provided with the distri-
27
* 3. The name of the University, the ATLAS group, or the names of its
28
* contributors may not be used to endorse or promote products deri-
29
* ved from this software without specific written permission.
33
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
34
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
35
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
36
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
37
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
38
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
39
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
40
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO-
41
* RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN-
42
* CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
43
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
45
* ---------------------------------------------------------------------
50
#include "atlas_misc.h"
53
#include "atlas_level1.h"
54
#include "atlas_kernel2.h"
55
#include "atlas_reflvl2.h"
56
#include "atlas_lvl2.h"
59
#define MinN_tbmvLHN 16
61
#define MinN_tbmvLHN 8
64
void Mjoin( PATL, tbmvLHN )
77
* Mjoin( PATL, tbmvLHN ) performs the following matrix-vector operation
79
* x := conjg( A' ) * x,
81
* where x is an n-element vector and A is an n by n non-unit, lower
82
* triangular band matrix, with ( k + 1 ) diagonals.
84
* This is a recursive version of the algorithm. For a more detailed
85
* description of the arguments of this function, see the reference im-
86
* plementation in the ATLAS/src/blas/reference directory.
88
* ---------------------------------------------------------------------
91
* .. Local Variables ..
97
const TYPE one[2] = { ATL_rone, ATL_rzero };
98
const int lda2 = ( LDA << 1 );
100
int ja, kl, ku, ma, na, n1, n1s, n2;
102
* .. Executable Statements ..
105
if( N <= MinN_tbmvLHN )
106
{ Mjoin( PATL, reftbmvLHN )( N, K, A, LDA, X, 1 ); }
109
n2 = N - ( n1 = ( N >> 1 ) ); n1s = (n1 SHIFT);
110
Mjoin( PATL, tbmvLHN )( n1, K, A, LDA, X );
111
ja = n1 - K; ja = Mmax( ja, 0 ); ma = Mmin( n2, K );
112
ku = na = n1 - ja; kl = K - ku; kl = Mmax( kl, 0 );
113
Mjoin( PATL, gbmvC_a1_x1_b1_y1 )( na, ma, kl, ku, one, A+ja*lda2, LDA,
114
X+n1s, 1, one, X+(ja SHIFT), 1 );
115
Mjoin( PATL, tbmvLHN )( n2, K, A+n1*lda2, LDA, X+n1s );
118
* End of Mjoin( PATL, tbmvLHN )