|
Packit |
67cb25 |
/* blas/source_tbmv_r.h
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
67cb25 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
67cb25 |
* the Free Software Foundation; either version 3 of the License, or (at
|
|
Packit |
67cb25 |
* your option) any later version.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is distributed in the hope that it will be useful, but
|
|
Packit |
67cb25 |
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
67cb25 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Packit |
67cb25 |
* General Public License for more details.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
67cb25 |
* along with this program; if not, write to the Free Software
|
|
Packit |
67cb25 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
Packit |
67cb25 |
*/
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
INDEX i, j;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
const int nonunit = (Diag == CblasNonUnit);
|
|
Packit |
67cb25 |
const int Trans = (TransA != CblasConjTrans) ? TransA : CblasTrans;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
CHECK_ARGS10 (TBMV,order,Uplo,TransA,Diag,N,K,A,lda,X,incX);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (N == 0)
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if ((order == CblasRowMajor && Trans == CblasNoTrans && Uplo == CblasUpper)
|
|
Packit |
67cb25 |
|| (order == CblasColMajor && Trans == CblasTrans && Uplo == CblasLower)) {
|
|
Packit |
67cb25 |
/* form x := A*x */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
INDEX ix = OFFSET(N, incX);
|
|
Packit |
67cb25 |
for (i = 0; i < N; i++) {
|
|
Packit |
67cb25 |
BASE temp = (nonunit ? A[lda * i + 0] : 1.0) * X[ix];
|
|
Packit |
67cb25 |
const INDEX j_min = i + 1;
|
|
Packit |
67cb25 |
const INDEX j_max = GSL_MIN(N, i + K + 1);
|
|
Packit |
67cb25 |
INDEX jx = OFFSET(N, incX) + j_min * incX;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (j = j_min; j < j_max; j++) {
|
|
Packit |
67cb25 |
temp += X[jx] * A[lda * i + (j - i)];
|
|
Packit |
67cb25 |
jx += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
X[ix] = temp;
|
|
Packit |
67cb25 |
ix += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
} else if ((order == CblasRowMajor && Trans == CblasNoTrans && Uplo == CblasLower)
|
|
Packit |
67cb25 |
|| (order == CblasColMajor && Trans == CblasTrans && Uplo == CblasUpper)) {
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
INDEX ix = OFFSET(N, incX) + (N - 1) * incX;
|
|
Packit |
67cb25 |
for (i = N; i > 0 && i--;) {
|
|
Packit |
67cb25 |
BASE temp = (nonunit ? A[lda * i + K] : 1.0) * X[ix];
|
|
Packit |
67cb25 |
const INDEX j_min = (i > K ? i - K : 0);
|
|
Packit |
67cb25 |
const INDEX j_max = i;
|
|
Packit |
67cb25 |
INDEX jx = OFFSET(N, incX) + j_min * incX;
|
|
Packit |
67cb25 |
for (j = j_min; j < j_max; j++) {
|
|
Packit |
67cb25 |
temp += X[jx] * A[lda * i + (K - i + j)];
|
|
Packit |
67cb25 |
jx += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
X[ix] = temp;
|
|
Packit |
67cb25 |
ix -= incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
} else if ((order == CblasRowMajor && Trans == CblasTrans && Uplo == CblasUpper)
|
|
Packit |
67cb25 |
|| (order == CblasColMajor && Trans == CblasNoTrans && Uplo == CblasLower)) {
|
|
Packit |
67cb25 |
/* form x := A'*x */
|
|
Packit |
67cb25 |
INDEX ix = OFFSET(N, incX) + (N - 1) * incX;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = N; i > 0 && i--;) {
|
|
Packit |
67cb25 |
BASE temp = 0.0;
|
|
Packit |
67cb25 |
const INDEX j_min = (K > i ? 0 : i - K);
|
|
Packit |
67cb25 |
const INDEX j_max = i;
|
|
Packit |
67cb25 |
INDEX jx = OFFSET(N, incX) + j_min * incX;
|
|
Packit |
67cb25 |
for (j = j_min; j < j_max; j++) {
|
|
Packit |
67cb25 |
temp += X[jx] * A[lda * j + (i - j)];
|
|
Packit |
67cb25 |
jx += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
if (nonunit) {
|
|
Packit |
67cb25 |
X[ix] = temp + X[ix] * A[lda * i + 0];
|
|
Packit |
67cb25 |
} else {
|
|
Packit |
67cb25 |
X[ix] += temp;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
ix -= incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
} else if ((order == CblasRowMajor && Trans == CblasTrans && Uplo == CblasLower)
|
|
Packit |
67cb25 |
|| (order == CblasColMajor && Trans == CblasNoTrans && Uplo == CblasUpper)) {
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
INDEX ix = OFFSET(N, incX);
|
|
Packit |
67cb25 |
for (i = 0; i < N; i++) {
|
|
Packit |
67cb25 |
BASE temp = 0.0;
|
|
Packit |
67cb25 |
const INDEX j_min = i + 1;
|
|
Packit |
67cb25 |
const INDEX j_max = GSL_MIN(N, i + K + 1);
|
|
Packit |
67cb25 |
INDEX jx = OFFSET(N, incX) + j_min * incX;
|
|
Packit |
67cb25 |
for (j = j_min; j < j_max; j++) {
|
|
Packit |
67cb25 |
temp += X[jx] * A[lda * j + (K - j + i)];
|
|
Packit |
67cb25 |
jx += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
if (nonunit) {
|
|
Packit |
67cb25 |
X[ix] = temp + X[ix] * A[lda * i + K];
|
|
Packit |
67cb25 |
} else {
|
|
Packit |
67cb25 |
X[ix] += temp;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
ix += incX;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|