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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
/* ========================================================================== */
/* === Supernodal/cholmod_super_solve ======================================= */
/* ========================================================================== */
/* -----------------------------------------------------------------------------
* CHOLMOD/Supernodal Module. Copyright (C) 2005-2006, Timothy A. Davis
* http://www.suitesparse.com
* -------------------------------------------------------------------------- */
/* Solve Lx=b or L'x=b for a supernodal factorization. These routines do not
* apply the permutation L->Perm. See cholmod_solve for a more general
* interface that performs that operation.
*/
#ifndef NGPL
#ifndef NSUPERNODAL
#include "cholmod_internal.h"
#include "cholmod_supernodal.h"
/* ========================================================================== */
/* === TEMPLATE ============================================================= */
/* ========================================================================== */
#define REAL
#include "t_cholmod_super_solve.c"
#define COMPLEX
#include "t_cholmod_super_solve.c"
/* ========================================================================== */
/* === cholmod_super_lsolve ================================================= */
/* ========================================================================== */
/* Solve Lx=b where x and b are of size n-by-nrhs. b is overwritten by the
* solution x. On input, b is stored in col-major order with leading dimension
* of d, and on output x is stored in the same manner.
*
* The contents of the workspace E are undefined on both input and output.
*
* workspace: none
*/
int CHOLMOD(super_lsolve) /* TRUE if OK, FALSE if BLAS overflow occured */
(
/* ---- input ---- */
cholmod_factor *L, /* factor to use for the forward solve */
/* ---- output ---- */
cholmod_dense *X, /* b on input, solution to Lx=b on output */
/* ---- workspace ---- */
cholmod_dense *E, /* workspace of size nrhs*(L->maxesize) */
/* --------------- */
cholmod_common *Common
)
{
/* ---------------------------------------------------------------------- */
/* check inputs */
/* ---------------------------------------------------------------------- */
RETURN_IF_NULL_COMMON (FALSE) ;
RETURN_IF_NULL (L, FALSE) ;
RETURN_IF_NULL (X, FALSE) ;
RETURN_IF_NULL (E, FALSE) ;
RETURN_IF_XTYPE_INVALID (L, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
RETURN_IF_XTYPE_INVALID (X, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
RETURN_IF_XTYPE_INVALID (E, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
if (L->xtype != X->xtype)
{
ERROR (CHOLMOD_INVALID, "L and X must have the same xtype") ;
return (FALSE) ;
}
if (L->xtype != E->xtype)
{
ERROR (CHOLMOD_INVALID, "L and E must have the same xtype") ;
return (FALSE) ;
}
if (X->d < X->nrow || L->n != X->nrow)
{
ERROR (CHOLMOD_INVALID, "X and L dimensions must match") ;
return (FALSE) ;
}
if (E->nzmax < X->ncol * (L->maxesize))
{
ERROR (CHOLMOD_INVALID, "workspace E not large enough") ;
return (FALSE) ;
}
if (!(L->is_ll) || !(L->is_super))
{
ERROR (CHOLMOD_INVALID, "L not supernodal") ;
return (FALSE) ;
}
Common->status = CHOLMOD_OK ;
ASSERT (IMPLIES (L->n == 0, L->nsuper == 0)) ;
if (L->n == 0 || X->ncol == 0)
{
/* nothing to do */
return (TRUE) ;
}
/* ---------------------------------------------------------------------- */
/* solve Lx=b using template routine */
/* ---------------------------------------------------------------------- */
switch (L->xtype)
{
case CHOLMOD_REAL:
r_cholmod_super_lsolve (L, X, E, Common) ;
break ;
case CHOLMOD_COMPLEX:
c_cholmod_super_lsolve (L, X, E, Common) ;
break ;
}
if (CHECK_BLAS_INT && !Common->blas_ok)
{
ERROR (CHOLMOD_TOO_LARGE, "problem too large for the BLAS") ;
}
return (Common->blas_ok) ;
}
/* ========================================================================== */
/* === cholmod_super_ltsolve ================================================ */
/* ========================================================================== */
/* Solve L'x=b where x and b are of size n-by-nrhs. b is overwritten by the
* solution x. On input, b is stored in col-major order with leading dimension
* of d, and on output x is stored in the same manner.
*
* The contents of the workspace E are undefined on both input and output.
*
* workspace: none
*/
int CHOLMOD(super_ltsolve) /* TRUE if OK, FALSE if BLAS overflow occured */
(
/* ---- input ---- */
cholmod_factor *L, /* factor to use for the backsolve */
/* ---- output ---- */
cholmod_dense *X, /* b on input, solution to L'x=b on output */
/* ---- workspace ---- */
cholmod_dense *E, /* workspace of size nrhs*(L->maxesize) */
/* --------------- */
cholmod_common *Common
)
{
/* ---------------------------------------------------------------------- */
/* check inputs */
/* ---------------------------------------------------------------------- */
RETURN_IF_NULL_COMMON (FALSE) ;
RETURN_IF_NULL (L, FALSE) ;
RETURN_IF_NULL (X, FALSE) ;
RETURN_IF_NULL (E, FALSE) ;
RETURN_IF_XTYPE_INVALID (L, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
RETURN_IF_XTYPE_INVALID (X, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
RETURN_IF_XTYPE_INVALID (E, CHOLMOD_REAL, CHOLMOD_COMPLEX, FALSE) ;
if (L->xtype != X->xtype)
{
ERROR (CHOLMOD_INVALID, "L and X must have the same xtype") ;
return (FALSE) ;
}
if (L->xtype != E->xtype)
{
ERROR (CHOLMOD_INVALID, "L and E must have the same xtype") ;
return (FALSE) ;
}
if (X->d < X->nrow || L->n != X->nrow)
{
ERROR (CHOLMOD_INVALID, "X and L dimensions must match") ;
return (FALSE) ;
}
if (E->nzmax < X->ncol * (L->maxesize))
{
ERROR (CHOLMOD_INVALID, "workspace E not large enough") ;
return (FALSE) ;
}
if (!(L->is_ll) || !(L->is_super))
{
ERROR (CHOLMOD_INVALID, "L not supernodal") ;
return (FALSE) ;
}
Common->status = CHOLMOD_OK ;
ASSERT (IMPLIES (L->n == 0, L->nsuper == 0)) ;
if (L->n == 0 || X->ncol == 0)
{
/* nothing to do */
return (TRUE) ;
}
/* ---------------------------------------------------------------------- */
/* solve Lx=b using template routine */
/* ---------------------------------------------------------------------- */
switch (L->xtype)
{
case CHOLMOD_REAL:
r_cholmod_super_ltsolve (L, X, E, Common) ;
break ;
case CHOLMOD_COMPLEX:
c_cholmod_super_ltsolve (L, X, E, Common) ;
break ;
}
if (CHECK_BLAS_INT && !Common->blas_ok)
{
ERROR (CHOLMOD_TOO_LARGE, "problem too large for the BLAS") ;
}
return (Common->blas_ok) ;
}
#endif
#endif
|
