6#ifndef ClpCholeskyPardiso_H
7#define ClpCholeskyPardiso_H
11#include "mkl_pardiso.h"
35 virtual int factorize(
const double *diagonal,
int *rowsDropped);
37 virtual void solve(
double *region);
44 ClpCholeskyPardiso(
int denseThreshold = -1);
46 virtual ~ClpCholeskyPardiso();
48 ClpCholeskyPardiso(
const ClpCholeskyPardiso &);
50 ClpCholeskyPardiso &
operator=(
const ClpCholeskyPardiso &);
58 int lastNumberDropped_;
Base class for Clp Cholesky factorization Will do better factorization.
virtual int order(ClpInterior *model)
Orders rows and saves pointer to matrix.and model.
ClpCholeskyBase & operator=(const ClpCholeskyBase &)
Assignment.
virtual void solve(CoinWorkDouble *region)
Uses factorization to solve.
virtual int symbolic()
Does Symbolic factorization given permutation.
virtual int factorize(const CoinWorkDouble *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped.
This solves LPs using interior point methods.
Abstract base class for Clp Matrices.