1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* ECOS - Embedded Conic Solver.
* Copyright (C) 2012-2015 A. Domahidi [domahidi@embotech.com],
* Automatic Control Lab, ETH Zurich & embotech GmbH, Zurich, Switzerland.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
* Sparse linear algebra library for setup phase, i.e. this module
* accesses malloc and hence should not go on an embedded platform.
*/
#ifndef __SPLAMM_H__
#define __SPLAMM_H__
#include "glblopts.h"
#include "spla.h"
/**
* Create a sparse matrix from existing arrays.
*/
spmat* createSparseMatrix(idxint m, idxint n, idxint nnz, idxint* jc, idxint* ir, pfloat* pr);
/**
* Create a new sparse matrix (uses MALLOC!)
*/
spmat* newSparseMatrix(idxint m, idxint n, idxint nnz);
/**
* Create a new sparse matrix (uses FREE!)
*/
void freeSparseMatrix(spmat* M);
/**
* Transpose a matrix; returns A = M' (uses malloc!)
*/
spmat* transposeSparseMatrix(spmat* M, idxint* MtoMt);
/**
* Permutes a symmetric matrix with only the upper triangular part stored.
* Writes the upper triangular part of C = A(p,p) in column compressed
* storage format.
*
* The function additionally returns the mapping PK that maps the row indices
* of the sparse matrix A on the row indices of C, such that C[P[k]] = A[k].
*
* NOTE: The matrix C and the vector PK are NOT created within this function
* - you need to allocate them beforehand!!
*
* If PK is NULL then the last output argument is ignored.
*/
void permuteSparseSymmetricMatrix(spmat* A, idxint* pinv, spmat* C, idxint* PK);
/**
* Returns the inverse of permutation p of length n.
*/
void pinv(idxint n, idxint* p, idxint* pinv);
/**
* Returns a copy of a sparse matrix A.
*/
spmat* copySparseMatrix(spmat* A);
/* ============================= DEBUG FUNCTIONS ======================= */
#if PRINTLEVEL > 0
/**
* Prints a dense matrix.
*/
void printDenseMatrix(pfloat *M, idxint dim1, idxint dim2, char *name);
/**
* Prints a dense integer matrix.
*/
void printDenseMatrix_i(idxint *M, idxint dim1, idxint dim2, char *name);
/**
* Prints a sparse matrix.
*/
void printSparseMatrix(spmat* M);
/**
* Dumps a sparse matrix in Matlab format.
* Use SPCONVERT to read in the file.
*/
void dumpSparseMatrix(spmat* M, char* fn);
/**
* Dumps a dense matrix of doubles to a CSV file.
*/
void dumpDenseMatrix(pfloat *M, int dim1, int dim2, char *fn);
/**
* Dumps a dense matrix of integers to a CSV file.
*/
void dumpDenseMatrix_i(idxint *M, int dim1, int dim2, char *fn);
#endif
#endif
|
