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
     180
     181
     182
     183
     184
     185
     186
     187
     188
     189
     190
     191
     192
     193
     194
     195
     196
     197
     198
     199
     200
     201
     202
     203
     204
     205
     206
     207
     208
     209
     210
/*
 *   Copyright (c) 2011, 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.
 */

/* Based on
 *
       SUBROUTINE DLAUU2( UPLO, N, A, LDA, INFO )
 *
 *  -- LAPACK auxiliary routine (version 3.3.1) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *  -- April 2011
 */

#ifndef FLENS_LAPACK_LA_LAUU2_TCC
#define FLENS_LAPACK_LA_LAUU2_TCC 1

#include <algorithm>
#include <flens/blas/blas.h>
#include <flens/lapack/lapack.h>

namespace flens { namespace lapack {

//== generic lapack implementation =============================================

namespace generic {

template <typename MA>
void
lauu2_impl(TrMatrix<MA> &A)
{
    typedef typename TrMatrix<MA>::ElementType   ElementType;
    typedef typename TrMatrix<MA>::IndexType     IndexType;

    const ElementType            One(1);
    const IndexType              n = A.dim();
    const Underscore<IndexType>  _;
//
//  Quick return if possible
//
    if (n==0) {
        return;
    }

    if (A.upLo()==Upper) {
//
//      Compute the product U * U**T.
//
        for (IndexType i=1; i<=n; ++i) {
            const ElementType a22 = A(i,i);
            if (i<n) {
                A(i,i) = A(i,_(i,n)) * A(i,_(i,n));

                const auto range1 = _(1,i-1);
                const auto range2 = i;
                const auto range3 = _(i+1,n);

                auto a12       = A(range1,range2);
                const auto A13 = A(range1,range3);
                const auto a23 = A(range2,range3);
                blas::mv(NoTrans, One, A13, a23, a22, a12);
            } else {
                A(_,n) *= a22;
            }
        }
    } else {
//
//      Compute the product L**T * L.
//
        for (IndexType i=1; i<=n; ++i) {
            const ElementType a22 = A(i,i);
            if (i<n) {
                A(i,i) = A(_(i,n),i) * A(_(i,n),i);

                const auto range1 = _(1,i-1);
                const auto range2 = i;
                const auto range3 = _(i+1,n);

                auto a21       = A(range2,range1);
                const auto A31 = A(range3,range1);
                const auto a32 = A(range3,range2);

                blas::mv(Trans, One, A31, a32, a22, a21);
            } else {
                A(n,_) *= a22;
            }
        }
    }
}

// namespace generic

//== interface for native lapack ===============================================

#ifdef USE_CXXLAPACK

namespace external {

template <typename MA>
void
lauu2_impl(TrMatrix<MA> &A)
{
    typedef typename TrMatrix<MA>::IndexType  IndexType;

    IndexType info = cxxlapack::lauu2<IndexType>(getF77Char(A.upLo()),
                                                 A.dim(),
                                                 A.data(),
                                                 A.leadingDimension());
    ASSERT(info==0);
}

// namespace external

#endif // USE_CXXLAPACK

//== public interface ==========================================================

template <typename MA>
void
lauu2(TrMatrix<MA> &A)
{
    typedef typename TrMatrix<MA>::IndexType    IndexType;

//
//  Test the input parameters
//
    ASSERT(A.firstRow()==1);
    ASSERT(A.firstCol()==1);

#   ifdef CHECK_CXXLAPACK
//
//  Make copies of output arguments
//
    typename TrMatrix<MA>::NoView       A_org      = A;
#   endif

//
//  Call implementation
//
    LAPACK_SELECT::lauu2_impl(A);

#   ifdef CHECK_CXXLAPACK
//
//  Make copies of generic results
//
    typename TrMatrix<MA>::NoView       A_generic      = A;
//
//  Restore output arguments
//
    A = A_org;

//
//  Compare results
//
    external::lauu2_impl(A);

    bool failed = false;
    if (! isIdentical(A_generic, A, "A_generic""_A")) {
        std::cerr << "A_org = " << A_org << std::endl;
        std::cerr << "CXXLAPACK: A_generic = " << A_generic << std::endl;
        std::cerr << "F77LAPACK: A = " << A << std::endl;
        failed = true;
    }

    if (failed) {
        ASSERT(0);
    }

#   endif
}

//-- forwarding ----------------------------------------------------------------
template <typename MA>
void
lauu2(MA &&A)
{
    lauu2(A);
}

} } // namespace lapack, flens

#endif // FLENS_LAPACK_LA_LAUU2_TCC