EpetraExt_BlockJacobi_LinearProblem.cpp

Go to the documentation of this file.

//@HEADER
// ***********************************************************************
//
//     EpetraExt: Epetra Extended - Linear Algebra Services Package
//                 Copyright (2011) Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// 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 Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "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 SANDIA CORPORATION OR THE
// 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.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
//@HEADER
 
#include <EpetraExt_BlockJacobi_LinearProblem.h>
 
#include <Epetra_VbrMatrix.h>
#include <Epetra_CrsGraph.h>
#include <Epetra_Map.h>
#include <Epetra_BlockMap.h>
#include <Epetra_MultiVector.h>
#include <Epetra_LinearProblem.h>
 
#include <Epetra_SerialDenseMatrix.h>
#include <Epetra_SerialDenseVector.h>
#include <Epetra_SerialDenseSVD.h>
 
#include <set>
 
using std::vector;
 
namespace EpetraExt {
 
LinearProblem_BlockJacobi::
~LinearProblem_BlockJacobi()
{
  for( int i = 0; i < NumBlocks_; ++i )
  {
    if( SVDs_[i] ) delete SVDs_[i];
    else if( Inverses_[i] ) delete Inverses_[i];
 
    if( RHSBlocks_[i] ) delete RHSBlocks_[i];
  }
 
  if( NewProblem_ ) delete NewProblem_;
  if( NewMatrix_ ) delete NewMatrix_;
}
 
LinearProblem_BlockJacobi::NewTypeRef
LinearProblem_BlockJacobi::
operator()( OriginalTypeRef orig )
{
  origObj_ = &orig;
 
  Epetra_VbrMatrix * OrigMatrix = dynamic_cast<Epetra_VbrMatrix*>( orig.GetMatrix() );
 
  if( OrigMatrix->RowMap().DistributedGlobal() )
  { std::cout << "FAIL for Global!\n"; abort(); }
  if( OrigMatrix->IndicesAreGlobal() )
  { std::cout << "FAIL for Global Indices!\n"; abort(); }
 
  NumBlocks_ = OrigMatrix->NumMyBlockRows();
 
  //extract serial dense matrices from vbr matrix
  VbrBlocks_.resize(NumBlocks_);
  VbrBlockCnt_.resize(NumBlocks_);
  VbrBlockDim_.resize(NumBlocks_);
  VbrBlockIndices_.resize(NumBlocks_);
  for( int i = 0; i < NumBlocks_; ++i )
  {
    OrigMatrix->ExtractMyBlockRowView( i, VbrBlockDim_[i], VbrBlockCnt_[i], VbrBlockIndices_[i], VbrBlocks_[i] );
  }
 
  SVDs_.resize(NumBlocks_);
  Inverses_.resize(NumBlocks_);
  for( int i = 0; i < NumBlocks_; ++i )
  {
    if( VbrBlockDim_[i] > 1 )
    {
      SVDs_[i] = new Epetra_SerialDenseSVD();
      SVDs_[i]->SetMatrix( *(VbrBlocks_[i][ VbrBlockCnt_[i]-1 ]) );
      SVDs_[i]->Factor();
      SVDs_[i]->Invert( rthresh_, athresh_ );
      Inverses_[i] = SVDs_[i]->InvertedMatrix();
    }
    else
    {
      SVDs_[i] = 0;
      double inv = 1. / (*(VbrBlocks_[i][ VbrBlockCnt_[i]-1 ]))(0,0);
      Inverses_[i] = new Epetra_SerialDenseMatrix( Copy, &inv, 1, 1, 1 );
    }
  }
 
  if( verbose_ > 2 )
  {
    std::cout << "SVDs and Inverses!\n";
    for( int i = 0; i < NumBlocks_; ++i )
    {
      std::cout << "Block: " << i << " Size: " << VbrBlockDim_[i] << std::endl;
      if( SVDs_[i] ) SVDs_[i]->Print(std::cout);
      std::cout << *(Inverses_[i]) << std::endl;
    }
  }
 
  Epetra_MultiVector * RHS = orig.GetRHS();
  double * A;
  int LDA;
  RHS->ExtractView( &A, &LDA );
  double * currLoc = A;
  RHSBlocks_.resize(NumBlocks_);
  for( int i = 0; i < NumBlocks_; ++i )
  {
    RHSBlocks_[i] = new Epetra_SerialDenseVector( View, currLoc, VbrBlockDim_[i] );
    currLoc += VbrBlockDim_[i];
  }
 
  newObj_ = &orig;
 
  return *newObj_;
}
 
bool
LinearProblem_BlockJacobi::
fwd()
{
  if( verbose_ > 2 )
  {
    std::cout << "-------------------\n";
    std::cout << "BlockJacobi\n";
    std::cout << "-------------------\n";
  }
  
  double MinSV =  1e15;
  double MaxSV =  0.0;
 
  std::multiset<double> SVs;
 
  for( int i = 0; i < NumBlocks_; ++i )
  {
    if( VbrBlockDim_[i] > 1 )
    {
      SVDs_[i]->Factor();
      if( SVDs_[i]->S()[0] > MaxSV ) MaxSV = SVDs_[i]->S()[0];
      if( SVDs_[i]->S()[VbrBlockDim_[i]-1] < MinSV ) MinSV = SVDs_[i]->S()[VbrBlockDim_[i]-1];
      for( int j = 0; j < VbrBlockDim_[i]; ++j ) SVs.insert( SVDs_[i]->S()[j] );
    }
    else
    {
      SVs.insert(1.0);
      MaxSV = std::max( MaxSV, 1.0 );
    }
  }
 
  std::multiset<double>::iterator iterSI = SVs.begin();
  std::multiset<double>::iterator endSI = SVs.end();
  int i = 0;
  if( verbose_ > 2 )
  {
    std::cout << std::endl;
    std::cout << "Singular Values\n";
    for( ; iterSI != endSI; ++iterSI, i++ ) std::cout << i << "\t" << *iterSI << std::endl;
    std::cout << std::endl;
  }
 
  Epetra_VbrMatrix * OrigMatrix = dynamic_cast<Epetra_VbrMatrix*>( origObj_->GetMatrix() );
 
  double abs_thresh = athresh_;
  double rel_thresh = rthresh_;
  if( thresholding_ == 1 )
  {
    abs_thresh = MaxSV * rel_thresh;
    rel_thresh = 0.0;
  }
      
  for( int i = 0; i < NumBlocks_; ++i )
  {
    if( VbrBlockDim_[i] > 1 )
      SVDs_[i]->Invert( rel_thresh, abs_thresh );
    else
      (*Inverses_[i])(0,0) = 1./(*(VbrBlocks_[i][ VbrBlockCnt_[i]-1 ]))(0,0);
  }
 
  for( int i = 0; i < NumBlocks_; ++i )
  {
    for( int j = 0; j < (VbrBlockCnt_[i]-1); ++j )
    {
      Epetra_SerialDenseMatrix tempMat( *(VbrBlocks_[i][j]) );
      VbrBlocks_[i][j]->Multiply( false, false, 1.0, *(Inverses_[i]), tempMat, 0.0 );
    }
 
    Epetra_SerialDenseMatrix tempMat2( *(RHSBlocks_[i]) );
    RHSBlocks_[i]->Multiply( false, false, 1.0, *(Inverses_[i]), tempMat2, 0.0 );
 
    if( verbose_ > 2 )
    {
      std::cout << "DiagBlock: " << i << std::endl;
      std::cout << *(VbrBlocks_[i][VbrBlockCnt_[i]-1]);
      std::cout << "RHSBlock: " << i << std::endl;
      std::cout << *(RHSBlocks_[i]);
    }
  }
 
  if( verbose_ > 2 )
  {
    std::cout << "Block Jacobi'd Matrix!\n";
    if( removeDiag_ ) std::cout << *NewMatrix_ << std::endl;
    else              std::cout << *(dynamic_cast<Epetra_VbrMatrix*>(origObj_->GetMatrix())) << std::endl;
    std::cout << "Block Jacobi'd RHS!\n";
    std::cout << *(origObj_->GetRHS());
    std::cout << std::endl;
  }
 
  if( verbose_ > 0 )
  {
    std::cout << "Min Singular Value: " << MinSV << std::endl;
    std::cout << "Max Singular Value: " << MaxSV << std::endl;
    std::cout << "--------------------\n";
  }
 
  return true;
}
 
bool
LinearProblem_BlockJacobi::
rvs()
{
  return true;
}
 
} //namespace EpetraExt