|
1
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 |
/*
* Copyright (c) 2009, Michael Lehn * * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1) Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2) Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * 3) Neither the name of the FLENS development group nor the names of * its contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef CXXBLAS_LEVEL2_HER2_TCC #define CXXBLAS_LEVEL2_HER2_TCC 1 #include <complex> #include <cxxblas/cxxblas.h> namespace cxxblas { template <typename IndexType, typename ALPHA, typename VX, typename VY, typename MA> void her2_generic(StorageOrder order, StorageUpLo upLo, Transpose conjugateA, IndexType n, const ALPHA &alpha, const VX *x, IndexType incX, const VY *y, IndexType incY, MA *A, IndexType ldA) { if (alpha==ALPHA(0)) { return; } if (order==ColMajor) { upLo = (upLo==Upper) ? Lower : Upper; conjugateA = Transpose(conjugateA^Conj); her2_generic(RowMajor, upLo, conjugateA, n, alpha, x, incX, y, incY, A, ldA); return; } #ifdef CXXBLAS_USE_XERBLA // insert error check here #endif if (upLo==Upper) { if (conjugateA==Conj) { for (IndexType i=0, iX=0, iY=0; i<n; ++i, iX+=incX, iY+=incY) { axpy_generic(n-i, conjugate(alpha*x[iX]), y+iY, incY, A+i*(ldA+1), IndexType(1)); axpy_generic(n-i, alpha*conjugate(y[iY]), x+iX, incX, A+i*(ldA+1), IndexType(1)); } } else { for (IndexType i=0, iX=0, iY=0; i<n; ++i, iX+=incX, iY+=incY) { acxpy_generic(n-i, alpha*x[iX], y+iY, incY, A+i*(ldA+1), IndexType(1)); acxpy_generic(n-i, conjugate(alpha)*y[iY], x+iX, incX, A+i*(ldA+1), IndexType(1)); } } } else { if (conjugateA==Conj) { for (IndexType i=0, iX=0, iY=0; i<n; ++i, iX+=incX, iY+=incY) { axpy_generic(i+1, conjugate(alpha*x[iX]), y, incY, A+i*ldA, IndexType(1)); axpy_generic(i+1, alpha*conjugate(y[iY]), x, incX, A+i*ldA, IndexType(1)); } } else { for (IndexType i=0, iX=0, iY=0; i<n; ++i, iX+=incX, iY+=incY) { acxpy_generic(i+1, alpha*x[iX], y, incY, A+i*ldA, IndexType(1)); acxpy_generic(i+1, conjugate(alpha)*y[iY], x, incX, A+i*ldA, IndexType(1)); } } } for (IndexType i=0; i<n; ++i) { A[i*ldA+i] = cxxblas::real(A[i*ldA+i]); } } template <typename IndexType, typename ALPHA, typename VX, typename VY, typename MA> void her2(StorageOrder order, StorageUpLo upLo, IndexType n, const ALPHA &alpha, const VX *x, IndexType incX, const VY *y, IndexType incY, MA *A, IndexType ldA) { CXXBLAS_DEBUG_OUT("her2_generic"); if (incX<0) { x -= incX*(n-1); } if (incY<0) { y -= incY*(n-1); } her2_generic(order, upLo, NoTrans, n, alpha, x, incX, y, incY, A, ldA); } #ifdef HAVE_CBLAS // cgerc template <typename IndexType> typename If<IndexType>::isBlasCompatibleInteger her2(StorageOrder order, StorageUpLo upLo, IndexType n, float alpha, const ComplexFloat *x, IndexType incX, const ComplexFloat *y, IndexType incY, ComplexFloat *A, IndexType ldA) { CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_cher2"); cblas_che2r(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo), n, reinterpret_cast<const float *>(&alpha), reinterpret_cast<const float *>(x), incX, reinterpret_cast<const float *>(y), incY, reinterpret_cast<float *>(A), ldA); } // zgerc template <typename IndexType> typename If<IndexType>::isBlasCompatibleInteger her2(StorageOrder order, StorageUpLo upLo, IndexType n, double alpha, const ComplexDouble *x, IndexType incX, const ComplexDouble *y, IndexType incY, ComplexDouble *A, IndexType ldA) { CXXBLAS_DEBUG_OUT("[" BLAS_IMPL "] cblas_zher2"); cblas_zher2(CBLAS::getCblasType(order), CBLAS::getCblasType(upLo), n, reinterpret_cast<const double *>(&alpha), reinterpret_cast<const double *>(x), incX, reinterpret_cast<const double *>(y), incY, reinterpret_cast<double *>(A), ldA); } #endif // HAVE_CBLAS } // namespace cxxblas #endif // CXXBLAS_LEVEL2_HER2_TCC |