IpPardisoSolverInterface.hpp

Go to the documentation of this file.

// Copyright (C) 2004, 2010 International Business Machines and others.
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors:  Carl Laird, Andreas Waechter     IBM    2005-03-17
 
#ifndef __IPPARDISOSOLVERINTERFACE_HPP__
#define __IPPARDISOSOLVERINTERFACE_HPP__
 
#include "IpSparseSymLinearSolverInterface.hpp"
 
//#define PARDISO_MATCHING_PREPROCESS
 
namespace Ipopt
{
 
class PardisoSolverInterface: public SparseSymLinearSolverInterface
{
public:
 
   PardisoSolverInterface();
 
   virtual ~PardisoSolverInterface();
 
   bool InitializeImpl(
      const OptionsList& options,
      const std::string& prefix
   );
 
   virtual ESymSolverStatus InitializeStructure(
      Index        dim,
      Index        nonzeros,
      const Index* ia,
      const Index* ja
   );
 
   virtual double* GetValuesArrayPtr();
 
   virtual ESymSolverStatus MultiSolve(
      bool         new_matrix,
      const Index* ia,
      const Index* ja,
      Index        nrhs,
      double*      rhs_vals,
      bool         check_NegEVals,
      Index        numberOfNegEVals);
 
   virtual Index NumberOfNegEVals() const;
 
   //* @name Options of Linear solver */
   virtual bool IncreaseQuality();
 
   virtual bool ProvidesInertia() const
   {
      return true;
   }
 
   EMatrixFormat MatrixFormat() const
   {
      return CSR_Format_1_Offset;
   }
 
   static void RegisterOptions(
      SmartPtr<RegisteredOptions> roptions
   );
 
private:
 
   PardisoSolverInterface(
      const PardisoSolverInterface&);
 
   void operator=(
      const PardisoSolverInterface&);
 
 
   Index dim_;
 
   Index nonzeros_;
 
   double* a_;
 
#ifdef PARDISO_MATCHING_PREPROCESS
   ipfint* ia2;
   ipfint* ja2;
   double* a2_;
   ipfint* perm2;
   double* scale2;
#endif
 
 
   Index negevals_;
 
 
   enum PardisoMatchingStrategy
   {
      COMPLETE,
      COMPLETE2x2,
      CONSTRAINT
   };
   PardisoMatchingStrategy match_strat_;
   bool have_symbolic_factorization_;
   bool pardiso_redo_symbolic_fact_only_if_inertia_wrong_;
   bool pardiso_repeated_perturbation_means_singular_;
   bool skip_inertia_check_;
   bool pardiso_iterative_;
   Index pardiso_max_droptol_corrections_;
 
 
   bool initialized_;
 
 
   void** PT_;
   ipfint MAXFCT_;
   ipfint MNUM_;
   ipfint MTYPE_;
   ipfint* IPARM_;
   double* DPARM_;
   ipfint MSGLVL_;
 
   Index debug_last_iter_;
   Index debug_cnt_;
 
 
   ESymSolverStatus SymbolicFactorization(
      const Index* ia,
      const Index* ja
   );
 
   ESymSolverStatus Factorization(
      const Index* ia,
      const Index* ja,
      bool         check_NegEVals,
      Index        numberOfNegEVals
   );
 
   ESymSolverStatus Solve(
      const Index* ia,
      const Index* ja,
      Index        nrhs,
      double*      rhs_vals
   );
};
 
} // namespace Ipopt
#endif