system_solvers_large.tpp

/*---------------------------------------------------------------------------*\
 *
 *  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/>.
 *
\*---------------------------------------------------------------------------*/
 
#ifndef __BITPIT_SYSTEM_SOLVERS_LARGE_TPP__
#define __BITPIT_SYSTEM_SOLVERS_LARGE_TPP__
 
namespace bitpit {
 
template<typename RowRankStorage, typename ColRankStorage>
ProxySystemMatrixOrdering<RowRankStorage, ColRankStorage>::ProxySystemMatrixOrdering(const RowRankStorage *rowRankStorage,
                                                                                     const ColRankStorage *colRankStorage)
    : m_rowRankStorage(rowRankStorage), m_colRankStorage(colRankStorage)
{
}
 
template<typename RowRankStorage, typename ColRankStorage>
long ProxySystemMatrixOrdering<RowRankStorage, ColRankStorage>::getRowPermutationRank(long row) const
{
    return (*m_rowRankStorage)[row];
}
 
template<typename RowRankStorage, typename ColRankStorage>
long ProxySystemMatrixOrdering<RowRankStorage, ColRankStorage>::getColPermutationRank(long col) const
{
    return (*m_colRankStorage)[col];
}
 
template<typename DerivedSystemSolver>
void SystemSolver::assembly(const typename DerivedSystemSolver::Assembler &assembler,
                            const SystemMatrixOrdering &reordering)
{
    // Clear the system
    clear();
 
    // Set reordering
    setReordering(assembler.getRowCount(), assembler.getColCount(), reordering);
 
#if BITPIT_ENABLE_MPI == 1
    // Set the communicator
    setCommunicator(assembler.getCommunicator());
 
    // Detect if the system is partitioned
    m_partitioned = assembler.isPartitioned();
#endif
 
    // Assemble matrix
    static_cast<DerivedSystemSolver &>(*this).matrixAssembly(assembler);
 
    // Initialize RHS and solution vectors
    vectorsCreate();
 
    // The system is now assembled
    m_assembled = true;
 
    // Initialize KSP options
    initializeKSPOptions();
 
    // Initialize KSP statuses
    initializeKSPStatus();
}
 
template<typename DerivedSystemSolver>
void SystemSolver::update(long nRows, const long *rows, const typename DerivedSystemSolver::Assembler &assembler)
{
    // Check if the system is assembled
    if (!isAssembled()) {
        throw std::runtime_error("Unable to update the system. The system is not yet assembled.");
    }
 
    // Update matrix
    static_cast<DerivedSystemSolver &>(*this).matrixUpdate(nRows, rows, assembler);
}
 
}
 
#endif