forked from bartvdbraak/blender
4f1c674ee0
http://crd.lbl.gov/~xiaoye/SuperLU/ This is a library to solve sparse matrix systems (type A*x=B). It is able to solve large systems very FAST. Only the necessary parts of the library are included to limit file size and compilation time. This means the example files, fortran interface, test files, matlab interface, cblas library, complex number part and build system have been left out. All (gcc) warnings have been fixed too. This library will be used for LSCM UV unwrapping. With this library, LSCM unwrapping can be calculated in a split second, making the unwrapping proces much more interactive. Added OpenNL (Open Numerical Libary): http://www.loria.fr/~levy/OpenNL/ OpenNL is a library to easily construct and solve sparse linear systems. We use a stripped down version, as an interface to SuperLU. This library was kindly given to use by Bruno Levy.
150 lines
3.9 KiB
C
150 lines
3.9 KiB
C
|
|
|
|
/*
|
|
* -- SuperLU routine (version 2.0) --
|
|
* Univ. of California Berkeley, Xerox Palo Alto Research Center,
|
|
* and Lawrence Berkeley National Lab.
|
|
* November 15, 1997
|
|
*
|
|
*/
|
|
/*
|
|
Copyright (c) 1994 by Xerox Corporation. All rights reserved.
|
|
|
|
THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
|
|
EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
|
|
|
|
Permission is hereby granted to use or copy this program for any
|
|
purpose, provided the above notices are retained on all copies.
|
|
Permission to modify the code and to distribute modified code is
|
|
granted, provided the above notices are retained, and a notice that
|
|
the code was modified is included with the above copyright notice.
|
|
*/
|
|
|
|
#include "ssp_defs.h"
|
|
#include "util.h"
|
|
|
|
void
|
|
spruneL(
|
|
const int jcol, /* in */
|
|
const int *perm_r, /* in */
|
|
const int pivrow, /* in */
|
|
const int nseg, /* in */
|
|
const int *segrep, /* in */
|
|
const int *repfnz, /* in */
|
|
int *xprune, /* out */
|
|
GlobalLU_t *Glu /* modified - global LU data structures */
|
|
)
|
|
{
|
|
/*
|
|
* Purpose
|
|
* =======
|
|
* Prunes the L-structure of supernodes whose L-structure
|
|
* contains the current pivot row "pivrow"
|
|
*
|
|
*/
|
|
float utemp;
|
|
int jsupno, irep, irep1, kmin, kmax, krow, movnum;
|
|
int i, ktemp, minloc, maxloc;
|
|
int do_prune; /* logical variable */
|
|
int *xsup, *supno;
|
|
int *lsub, *xlsub;
|
|
float *lusup;
|
|
int *xlusup;
|
|
|
|
xsup = Glu->xsup;
|
|
supno = Glu->supno;
|
|
lsub = Glu->lsub;
|
|
xlsub = Glu->xlsub;
|
|
lusup = Glu->lusup;
|
|
xlusup = Glu->xlusup;
|
|
|
|
/*
|
|
* For each supernode-rep irep in U[*,j]
|
|
*/
|
|
jsupno = supno[jcol];
|
|
for (i = 0; i < nseg; i++) {
|
|
|
|
irep = segrep[i];
|
|
irep1 = irep + 1;
|
|
do_prune = FALSE;
|
|
|
|
/* Don't prune with a zero U-segment */
|
|
if ( repfnz[irep] == EMPTY )
|
|
continue;
|
|
|
|
/* If a snode overlaps with the next panel, then the U-segment
|
|
* is fragmented into two parts -- irep and irep1. We should let
|
|
* pruning occur at the rep-column in irep1's snode.
|
|
*/
|
|
if ( supno[irep] == supno[irep1] ) /* Don't prune */
|
|
continue;
|
|
|
|
/*
|
|
* If it has not been pruned & it has a nonz in row L[pivrow,i]
|
|
*/
|
|
if ( supno[irep] != jsupno ) {
|
|
if ( xprune[irep] >= xlsub[irep1] ) {
|
|
kmin = xlsub[irep];
|
|
kmax = xlsub[irep1] - 1;
|
|
for (krow = kmin; krow <= kmax; krow++)
|
|
if ( lsub[krow] == pivrow ) {
|
|
do_prune = TRUE;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if ( do_prune ) {
|
|
|
|
/* Do a quicksort-type partition
|
|
* movnum=TRUE means that the num values have to be exchanged.
|
|
*/
|
|
movnum = FALSE;
|
|
if ( irep == xsup[supno[irep]] ) /* Snode of size 1 */
|
|
movnum = TRUE;
|
|
|
|
while ( kmin <= kmax ) {
|
|
|
|
if ( perm_r[lsub[kmax]] == EMPTY )
|
|
kmax--;
|
|
else if ( perm_r[lsub[kmin]] != EMPTY )
|
|
kmin++;
|
|
else { /* kmin below pivrow, and kmax above pivrow:
|
|
* interchange the two subscripts
|
|
*/
|
|
ktemp = lsub[kmin];
|
|
lsub[kmin] = lsub[kmax];
|
|
lsub[kmax] = ktemp;
|
|
|
|
/* If the supernode has only one column, then we
|
|
* only keep one set of subscripts. For any subscript
|
|
* interchange performed, similar interchange must be
|
|
* done on the numerical values.
|
|
*/
|
|
if ( movnum ) {
|
|
minloc = xlusup[irep] + (kmin - xlsub[irep]);
|
|
maxloc = xlusup[irep] + (kmax - xlsub[irep]);
|
|
utemp = lusup[minloc];
|
|
lusup[minloc] = lusup[maxloc];
|
|
lusup[maxloc] = utemp;
|
|
}
|
|
|
|
kmin++;
|
|
kmax--;
|
|
|
|
}
|
|
|
|
} /* while */
|
|
|
|
xprune[irep] = kmin; /* Pruning */
|
|
|
|
#ifdef CHK_PRUNE
|
|
printf(" After spruneL(),using col %d: xprune[%d] = %d\n",
|
|
jcol, irep, kmin);
|
|
#endif
|
|
} /* if do_prune */
|
|
|
|
} /* if */
|
|
|
|
} /* for each U-segment... */
|
|
}
|