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