edu.ufl.cise.amd.tdouble
Class Damd_preprocess
java.lang.Object
edu.ufl.cise.amd.tdouble.Damd
edu.ufl.cise.amd.tdouble.Damd_internal
edu.ufl.cise.amd.tdouble.Damd_preprocess
public class Damd_preprocess
- extends Damd_internal
Sorts, removes duplicate entries, and transposes from the nonzero pattern of
a column-form matrix A, to obtain the matrix R. The input matrix can have
duplicate entries and/or unsorted columns (AMD_valid (n,Ap,Ai) must not be
AMD_INVALID).
This input condition is NOT checked. This routine is not user-callable.
| Fields inherited from class edu.ufl.cise.amd.tdouble.Damd |
AMD_AGGRESSIVE, AMD_CONTROL, AMD_DATE, AMD_debug, AMD_DEFAULT_AGGRESSIVE, AMD_DEFAULT_DENSE, AMD_DENSE, AMD_DMAX, AMD_INFO, AMD_INVALID, AMD_LNZ, AMD_MAIN_VERSION, AMD_MEMORY, AMD_N, AMD_NCMPA, AMD_NDENSE, AMD_NDIV, AMD_NMULTSUBS_LDL, AMD_NMULTSUBS_LU, AMD_NZ, AMD_NZ_A_PLUS_AT, AMD_NZDIAG, AMD_OK, AMD_OK_BUT_JUMBLED, AMD_OUT_OF_MEMORY, AMD_STATUS, AMD_SUB_VERSION, AMD_SUBSUB_VERSION, AMD_SYMMETRY, AMD_VERSION |
|
Method Summary |
static void |
amd_preprocess(int n,
int[] Ap,
int[] Ai,
int[] Rp,
int[] Ri,
int[] W,
int[] Flag)
AMD_preprocess does not check its input for errors or allocate workspace. |
| Methods inherited from class edu.ufl.cise.amd.tdouble.Damd_internal |
AMD_DEBUG0, AMD_DEBUG1, AMD_DEBUG2, AMD_DEBUG3, AMD_DEBUG4, ASSERT, ASSERT, FLIP, IMPLIES, MAX, MAX, MIN, MIN, PRINTF, sqrt, UNFLIP |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Damd_preprocess
public Damd_preprocess()
amd_preprocess
public static void amd_preprocess(int n,
int[] Ap,
int[] Ai,
int[] Rp,
int[] Ri,
int[] W,
int[] Flag)
- AMD_preprocess does not check its input for errors or allocate workspace.
On input, the condition (AMD_valid (n,n,Ap,Ai) != AMD_INVALID) must hold.
- Parameters:
n - input matrix: A is n-by-nAp - size n+1Ai - size nz = Ap [n]Rp - size n+1Ri - size nz (or less, if duplicates present)W - workspace of size nFlag - workspace of size n
Copyright © 2012. All Rights Reserved.