solveu_right.h

Go to the documentation of this file.

// ========================================================================= //
// This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
// and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
// ========================================================================= //

#ifndef MYRAMATH_MULTIFRONTAL_LU_SOLVEU_RIGHT_H
#define MYRAMATH_MULTIFRONTAL_LU_SOLVEU_RIGHT_H

#include <myramath/multifrontal/detail/solveu_right.h>

namespace myra {
namespace multifrontal {
namespace lu {
namespace solveu_right {

template<class Number> class JobGraphBase : public ::myra::multifrontal::detail::solveu_right::JobGraphBase2<Number>
  {
  public:

    // Structural typedefs for base class.
    typedef ::myra::multifrontal::detail::solveu_right::JobGraphBase2<Number> Base;

    // Typedefs related to numeric storage on LUContainer    
    typedef LUKernel<Number> Kernel;
    typedef ::myra::multifrontal::detail::lu::LUContainer<Kernel> LUContainer;    
    
    // Constructor - requires const reference to LUContainer, mutable reference to right hand side.
    JobGraphBase(const LUContainer* in_lucontainer, const MatrixRange<Number>& in_B, int in_blocksize)
      : Base(&in_lucontainer->tree(), in_B, in_blocksize), lucontainer(in_lucontainer) { }
    
    // Virtual copy constructor. 
    virtual ::myra::JobGraphBase* clone() const
      { return new JobGraphBase(*this); }
    
  protected:    

    // Accesors for U Kernel's/Block's
    const Kernel& u(int n, int ij) const
      { return lucontainer->lu(n,ij); }
    const CMatrixRange<Number> u(int n, int i, int j) const
      { return lucontainer->lu(n,i,j); }

    // Solves Xn(i,k)*Un(k,k) = Bn(i,k)
    virtual uint64_t backsolve(int n, int k, int i)
      {
      const Kernel& Un_kk = this->u(n,k);
      MatrixRange<Number> Bn_ik = this->b(n,i,k);
      return Un_kk.solveU(Bn_ik,'R','N');
      }
    
    // Downdates Bn(i,j) -= Xn(i,k)*Un(k,j)    
    virtual uint64_t downdate(int n, int k, int i, int j)
      {
      CMatrixRange<Number> Un_kj = this->u(n,k,j);
      CMatrixRange<Number> Xn_ik = this->x(n,i,k);
       MatrixRange<Number> Bn_ij = this->b(n,i,j);
      Number one(1);
      return gemm_nwork(Bn_ij, Xn_ik, 'N', Un_kj, 'N',  -one, one);      
      }

  private:
  
    // Reference to LUContainer (const).
    const LUContainer* lucontainer;
  
  }; // class JobGraph

} } } } // namespace

#endif