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"
58
void Mjoin( PATL, tpsvLH )
60
const enum ATLAS_DIAG DIAG,
61
const int N, /* N > 0 assumed */
71
* Mjoin( PATL, tpsvLH ) solves the following triangular system of equations
73
* conjg( A' ) * x = b,
75
* where b and x are n-element vectors and A is an n by n unit or non-
76
* unit, lower triangular matrix supplied in packed form.
78
* No test for singularity or near-singularity is included in this
79
* routine. Such tests must be performed before calling this routine.
81
* This is a blocked version of the algorithm. For a more detailed des-
82
* cription of the arguments of this function, see the reference imple-
83
* mentation in the ATLAS/src/blas/reference directory.
85
* ---------------------------------------------------------------------
88
* .. Local Variables ..
90
void (*tpsv0)( const int, const TYPE *, const int, TYPE * );
92
#define none ATL_rnone
95
TYPE none[2] = { ATL_rnone, ATL_rzero },
96
one [2] = { ATL_rone, ATL_rzero };
99
int incX, lda = LDA, mb, mb1, n, nb;
101
* .. Executable Statements ..
104
ATL_GetPartMVT( A, N, &mb, &nb );
106
if( DIAG == AtlasNonUnit ) tpsv0 = Mjoin( PATL, tpsvLHN );
107
else tpsv0 = Mjoin( PATL, tpsvLHU );
109
mb1 = N - ( ( N - 1 ) / mb ) * mb; incX = (mb SHIFT); x0 = X;
110
A0 = (TYPE *)(A); MLpnext( N-mb, A, lda );
112
for( n = N - mb, X += ((N-mb) SHIFT); n > 0; n -= mb, X -= incX )
114
tpsv0( mb, A, lda, X ); MLpprev( mb, A, lda );
115
Mjoin( PATL, gpmv )( AtlasLower, AtlasConjTrans, n, mb, none,
116
A0 + (n SHIFT), LDA, X, 1, one, x0, 1 );
118
tpsv0( mb1, A0, LDA, x0 );
120
* End of Mjoin( PATL, tpsvLH )
added
removed
src/blas/level2/kernel/ATL_tpsvLH.c
