10 #ifdef MATLAB_MEX_FILE
16 #define CS_DATE "Mar 6, 2006"
17 #define CS_COPYRIGHT "Copyright (c) Timothy A. Davis, 2006"
31 cs *cs_add (
const cs *A,
const cs *B,
double alpha,
double beta) ;
32 int cs_cholsol (
const cs *A,
double *b,
int order) ;
34 int cs_entry (
cs *T,
int i,
int j,
double x) ;
35 int cs_lusol (
const cs *A,
double *b,
int order,
double tol) ;
36 int cs_gaxpy (
const cs *A,
const double *x,
double *y) ;
37 cs *cs_multiply (
const cs *A,
const cs *B) ;
38 int cs_qrsol (
const cs *A,
double *b,
int order) ;
39 cs *cs_transpose (
const cs *A,
int values) ;
40 cs *cs_triplet (
const cs *T) ;
41 cs *cs_compress_LLM(
const double *ele,
const int lda,
const int m,
const int n,
const int nz,
const int I1,
const int TwoD);
42 double cs_norm (
const cs *A) ;
43 int cs_print (
const cs *A,
int brief) ;
44 cs *cs_load (FILE *f) ;
46 void *cs_calloc (
int n,
size_t size) ;
47 void *cs_free (
void *p) ;
48 void *cs_realloc (
void *p,
int n,
size_t size,
int *ok) ;
49 cs *cs_spalloc (
int m,
int n,
int nzmax,
int values,
int triplet) ;
50 cs *cs_spfree (
cs *A) ;
51 int cs_sprealloc (
cs *A,
int nzmax) ;
52 void *cs_malloc (
int n,
size_t size) ;
85 int *cs_amd (
const cs *A,
int order) ;
86 csn *cs_chol (
const cs *A,
const css *S) ;
87 csd *cs_dmperm (
const cs *A) ;
88 int cs_droptol (
cs *A,
double tol) ;
89 int cs_dropzeros (
cs *A) ;
90 int cs_happly (
const cs *V,
int i,
double beta,
double *x) ;
91 int cs_ipvec (
int n,
const int *P,
const double *b,
double *x) ;
92 int cs_lsolve (
const cs *L,
double *x) ;
93 int cs_ltsolve (
const cs *L,
double *x) ;
94 csn *cs_lu (
const cs *A,
const css *S,
double tol) ;
95 cs *cs_permute (
const cs *A,
const int *P,
const int *Q,
int values) ;
96 int *cs_pinv (
const int *P,
int n) ;
97 int cs_pvec (
int n,
const int *P,
const double *b,
double *x) ;
98 csn *cs_qr (
const cs *A,
const css *S) ;
99 css *cs_schol (
const cs *A,
int order) ;
100 css *cs_sqr (
const cs *A,
int order,
int qr) ;
101 cs *cs_symperm (
const cs *A,
const int *Pinv,
int values) ;
102 int cs_usolve (
const cs *U,
double *x) ;
103 int cs_utsolve (
const cs *U,
double *x) ;
104 int cs_updown (
cs *L,
int sigma,
const cs *C,
const int *parent) ;
111 int *cs_counts (
const cs *A,
const int *parent,
const int *post,
int ata) ;
112 int cs_cumsum (
int *p,
int *c,
int n) ;
113 int cs_dfs (
int j,
cs *L,
int top,
int *xi,
int *pstack,
const int *Pinv) ;
114 int *cs_etree (
const cs *A,
int ata) ;
115 int cs_fkeep (
cs *A,
int (*fkeep) (
int,
int,
double,
void *),
void *other) ;
116 double cs_house (
double *x,
double *beta,
int n) ;
117 int *cs_maxtrans (
const cs *A) ;
118 int *cs_post (
int n,
const int *parent) ;
119 int cs_reach (
cs *L,
const cs *B,
int k,
int *xi,
const int *Pinv) ;
120 csd *cs_scc (
cs *A) ;
121 int cs_scatter (
const cs *A,
int j,
double beta,
int *w,
double *x,
int mark,
123 int cs_splsolve (
cs *L,
const cs *B,
int k,
int *xi,
double *x,
125 int cs_tdfs (
int j,
int k,
int *head,
const int *next,
int *post,
128 csd *cs_dalloc (
int m,
int n) ;
129 cs *cs_done (
cs *C,
void *w,
void *x,
int ok) ;
130 int *cs_idone (
int *p,
cs *C,
void *w,
int ok) ;
131 csn *cs_ndone (
csn *N,
cs *C,
void *w,
void *x,
int ok) ;
132 csd *cs_ddone (
csd *D,
cs *C,
void *w,
int ok) ;
134 #define CS_MAX(a,b) (((a) > (b)) ? (a) : (b))
135 #define CS_MIN(a,b) (((a) < (b)) ? (a) : (b))
136 #define CS_FLIP(i) (-(i)-2)
137 #define CS_UNFLIP(i) (((i) < 0) ? CS_FLIP(i) : (i))
138 #define CS_MARKED(Ap,j) (Ap [j] < 0)
139 #define CS_MARK(Ap,j) { Ap [j] = CS_FLIP (Ap [j]) ; }
140 #define CS_OVERFLOW(n,size) (n > INT_MAX / (int) size)
Impressum /
Disclaimer /
Datenschutz
Generated by doxygen 1.8.5