Documentation Index
Fetch the complete documentation index at: https://mintlify.com/KarypisLab/ParMETIS/llms.txt
Use this file to discover all available pages before exploring further.
ParMETIS_V3_NodeND computes a fill-reducing ordering of a distributed sparse symmetric matrix using parallel nested dissection. The ordering permutes the rows and columns of the matrix to minimize fill during sparse factorization (e.g., Cholesky or LU). The function returns both the permutation vector and the sizes of the separators in the nested dissection tree, which can be used to schedule the factorization on multiple processors.
Parameters
Distribution of vertices (matrix rows/columns) across processes.
vtxdist[i] is the global index of the first vertex on process i. Size npes + 1; must be identical on all processes.Local adjacency row pointers in CSR format. Represents the sparsity pattern of the local rows of the matrix. Size
local_nvtxs + 1.Local adjacency column indices in CSR format. Size
xadj[local_nvtxs].Indexing convention.
0 for C-style 0-based indexing; 1 for Fortran-style 1-based indexing.Algorithm options. If
options[0] = 0, all defaults are used. If options[0] = 1, options[PMV3_OPTION_DBGLVL] (index 1) sets the debug level and options[PMV3_OPTION_SEED] (index 2) sets the random seed.Output. Fill-reducing permutation array.
order[i] is the new global index assigned to global vertex i. The caller must allocate this array with at least total_nvtxs elements, where total_nvtxs = vtxdist[npes].Output. Separator sizes for the nested dissection tree. Array of size
2 * npes. Describes the number of vertices in each separator and subgraph of the dissection tree, enabling the caller to schedule parallel factorization.Pointer to the MPI communicator covering all participating processes.
Return value
ReturnsMETIS_OK (1) on success. Any other value indicates an error.