11 #ifndef __IPITERATIVEPARDISOSOLVERINTERFACE_HPP__
12 #define __IPITERATIVEPARDISOSOLVERINTERFACE_HPP__
40 const std::string& prefix);
61 Index numberOfNegEVals);
237 Index numberOfNegEVals);
virtual bool IncreaseQuality()
Request to increase quality of solution for next solve.
ipfint MSGLVL_
Message level.
void ** PT_
Internal data address pointers.
ESymSolverStatus Solve(const Index *ia, const Index *ja, Index nrhs, double *rhs_vals)
Call Pardiso to do the Solve.
Number pardiso_iter_dropping_schur_used_
ESymSolverStatus
Enum to report outcome of a linear solve.
Index negevals_
Number of negative eigenvalues.
FORTRAN_INTEGER_TYPE ipfint
SmartPtr< IterativeSolverTerminationTester > normal_tester_
Termination tester for normal step computation.
Base class for interfaces to symmetric indefinite linear solvers for sparse matrices.
ipfint MAXFCT_
Maximal number of factors with identical nonzero structure.
Interface to the linear solver Pardiso, derived from SparseSymLinearSolverInterface.
This base class is for the termination tests for the iterative linear solver in the inexact version o...
Index normal_pardiso_iter_max_row_fill_
InexactData & InexData()
Method to easily access Inexact data.
bool initialized_
Flag indicating if internal data is initialized.
EMatrixFormat MatrixFormat() const
Query of requested matrix type that the linear solver understands.
Index normal_pardiso_iter_coarse_size_
double Number
Type of all numbers.
Number pardiso_iter_inverse_norm_factor_
ESymSolverStatus Factorization(const Index *ia, const Index *ja, bool check_NegEVals, Index numberOfNegEVals)
Call Pardiso to factorize the Matrix.
IpoptAdditionalCq & AdditionalCq()
Index normal_pardiso_iter_max_levels_
virtual ESymSolverStatus MultiSolve(bool new_matrix, const Index *ia, const Index *ja, Index nrhs, double *rhs_vals, bool check_NegEVals, Index numberOfNegEVals)
Solve operation for multiple right hand sides.
Compressed sparse row format for lower triangular part, with 1 offset.
bool skip_inertia_check_
Flag indicating if the interia is always assumed to be correct.
Number normal_pardiso_iter_dropping_schur_
bool have_symbolic_factorization_
Flag indicating if symbolic factorization has already been performed.
Index normal_pardiso_max_iter_
Index pardiso_max_iter_
Options for the preconditioner.
Template class for Smart Pointers.
This class stores a list of user set options.
PardisoMatchingStrategy match_strat_
Option that controls the matching strategy.
Number normal_pardiso_iter_dropping_schur_used_
static void RegisterOptions(SmartPtr< RegisteredOptions > roptions)
Methods for IpoptType.
Index pardiso_iter_max_levels_
IterativePardisoSolverInterface()
Default Constructor.
bool InitializeImpl(const OptionsList &options, const std::string &prefix)
overloaded from AlgorithmStrategyObject
SmartPtr< IterativeSolverTerminationTester > pd_tester_
Termination tester for primal-dual step computation.
double * DPARM_
Parameter and info array for Pardiso.
IpoptAdditionalData & AdditionalData()
Get access to additional data object.
double * a_
Array for storing the values of the matrix.
Number normal_pardiso_iter_inverse_norm_factor_
int Index
Type of all indices of vectors, matrices etc.
virtual Index NumberOfNegEVals() const
Number of negative eigenvalues detected during last factorization.
Number pardiso_iter_dropping_factor_used_
Actualy used dropping tolerances.
Number normal_pardiso_iter_dropping_factor_used_
virtual double * GetValuesArrayPtr()
Method returing an internal array into which the nonzero elements are to be stored.
Number pardiso_iter_relative_tol_
bool pardiso_repeated_perturbation_means_singular_
Flag indicating whether repeated perturbed elements even after a new symbolic factorization should be...
bool pardiso_redo_symbolic_fact_only_if_inertia_wrong_
Flag indicating whether the symbolic factorization should only be done after perturbed elements...
ipfint * IPARM_
Parameter and info array for Pardiso.
Class for all Chen-Goldfarb penalty method specific calculated quantities.
Class to organize all the additional data required by the Chen-Goldfarb penalty function algorithm...
EMatrixFormat
Enum to specify sparse matrix format.
Number normal_pardiso_iter_relative_tol_
Index pardiso_iter_coarse_size_
virtual ~IterativePardisoSolverInterface()
Destructor.
Number decr_factor_
Decrease factor for dropping tolerances.
IpoptData & IpData() const
Index pardiso_iter_max_row_fill_
Number normal_pardiso_iter_dropping_factor_
Number pardiso_iter_dropping_factor_
Number pardiso_iter_dropping_schur_
ipfint MNUM_
Actual matrix for the solution phase.
void operator=(const IterativePardisoSolverInterface &)
Overloaded Equals Operator.
ESymSolverStatus SymbolicFactorization(const Index *ia, const Index *ja)
Call Pardiso to do the analysis phase.
Index pardiso_max_droptol_corrections_
Maximal number of decreases of drop tolerance during one solve.
IpoptCalculatedQuantities & IpCq() const
Index nonzeros_
Number of nonzeros of the matrix in triplet representation.
Index dim_
Number of rows and columns of the matrix.
InexactCq & InexCq()
Method to easily access Inexact calculated quantities.
ipfint MTYPE_
Matrix type; real and symmetric indefinite.
virtual bool ProvidesInertia() const
Query whether inertia is computed by linear solver.
virtual ESymSolverStatus InitializeStructure(Index dim, Index nonzeros, const Index *ia, const Index *ja)
Method for initializing internal stuctures.
PardisoMatchingStrategy
Type for mathcing strategies.