Clp 1.17.5
Loading...
Searching...
No Matches
ClpCholeskyPardiso.hpp
Go to the documentation of this file.
1/* $Id: ClpCholeskyPardiso.hpp 1665 2011-01-04 17:55:54Z lou $ */
2// Copyright (C) 2003, International Business Machines
3// Corporation and others. All Rights Reserved.
4// This code is licensed under the terms of the Eclipse Public License (EPL).
5
6#ifndef ClpCholeskyPardiso_H
7#define ClpCholeskyPardiso_H
8#ifdef PARDISO_BARRIER
9
10#include "ClpCholeskyBase.hpp"
11#include "mkl_pardiso.h"
12#include "mkl_types.h"
13
14class ClpMatrixBase;
16
20class ClpCholeskyPardiso : public ClpCholeskyBase {
21
22public:
27 virtual int order(ClpInterior *model);
32 virtual int symbolic();
35 virtual int factorize(const double *diagonal, int *rowsDropped);
37 virtual void solve(double *region);
39
44 ClpCholeskyPardiso(int denseThreshold = -1);
46 virtual ~ClpCholeskyPardiso();
47 // Copy
48 ClpCholeskyPardiso(const ClpCholeskyPardiso &);
49 // Assignment
50 ClpCholeskyPardiso &operator=(const ClpCholeskyPardiso &);
52 virtual ClpCholeskyBase *clone() const;
54
55private:
58 int lastNumberDropped_;
59 //MKL_INT iparm_[64];
61};
62
63#endif
64#endif
65
66/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
67*/
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.