get_colors

Generate proper vertex coloring of a sparse undirected graph.

Estimates Hessian of a scalar-valued function, and returns it
in a sparse Matrix format. The sparsity pattern must be known in advance. The
algorithm is especially efficient for hierarchical models with a large number of
heterogeneous units. See Braun, M. (2017) <doi:10.18637/jss.v082.i10>.

Michael Braun

sparseHessianFD

Numerical Estimation of Sparse Hessians

get_colors function

<dl><dt>pntr, idx</dt>
<dd>row pointers and column indices of the adjacency matrix, in compressed column-oriented format. Must use zero-based indexing.</dd>
<dt>nvars</dt>
<dd>Number of vertices.</dd></dl>

Arguments

Vertex coloring of a sparse undirected graph — get_colors

<dl>

<dt>pntr, idx</dt>
<dd>row pointers and column indices of the adjacency matrix, in compressed column-oriented format. Must use zero-based indexing.</dd>


<dt>nvars</dt>
<dd>Number of vertices.</dd>

</dl>

get_colors: Vertex coloring of a sparse undirected graph

Description

Usage

Value

Arguments

Details