matrix_utilities.cpp

/*---------------------------------------------------------------------------*\
 *
 *  bitpit
 *
 *  Copyright (C) 2015-2021 OPTIMAD engineering Srl
 *
 *  -------------------------------------------------------------------------
 *  License
 *  This file is part of bitpit.
 *
 *  bitpit is free software: you can redistribute it and/or modify it
 *  under the terms of the GNU Lesser General Public License v3 (LGPL)
 *  as published by the Free Software Foundation.
 *
 *  bitpit 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 Lesser General Public
 *  License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with bitpit. If not, see <http://www.gnu.org/licenses/>.
 *
\*---------------------------------------------------------------------------*/
 
#include "bitpit_common.hpp"
 
#include "matrix_utilities.hpp"
 
namespace bitpit {
 
namespace linearalgebra {


int linearIndexColMajor(int row, int col, int nRows, int nCols)
{
    BITPIT_UNUSED(nCols);
 
    return row + col * nRows;
}

int linearIndexRowMajor(int row, int col, int nRows, int nCols)
{
    BITPIT_UNUSED(nRows);
 
    return row * nCols + col;
}

int linearIndexColMajorSymmetric(int row, int col, int nRows, int nCols, char uplo)
{
    assert(uplo == 'L' || uplo == 'U');
 
    if ((uplo == 'U' && col < row) || (uplo == 'L' && col > row)) {
        return linearIndexColMajor(col, row, nRows, nCols);
    } else {
        return linearIndexColMajor(row, col, nRows, nCols);
    }
}

int linearIndexRowMajorSymmetric(int row, int col, int nRows, int nCols, char uplo)
{
    assert(uplo == 'L' || uplo == 'U');
 
    if ((uplo == 'U' && col < row) || (uplo == 'L' && col > row)) {
        return linearIndexRowMajor(col, row, nRows, nCols);
    } else {
        return linearIndexRowMajor(row, col, nRows, nCols);
    }
}

 
}
 
}