Given a non-decomposable graph
, and (non-graphical) variogram matrix Gamma
,
modifies Gamma
in non-edge entries, such that the resulting matrix is a
variogram matrix with graphical structure described by graph
.
complete_Gamma_general(
Gamma,
graph,
N = 10000,
tol = get_large_tol(),
check_tol = 100
)
A completed \(d \times d\) variogram matrix.
Numeric \(d \times d\) variogram matrix.
igraph::graph()
object.
Maximum number of iterations.
Numeric scalar. Tolerance to be used when completing submatrices.
Numeric/integer scalar. How often to check the tolerance when completing submatrices.
Other matrix completion related topics:
complete_Gamma_decomposable()
,
complete_Gamma_general_demo()
,
complete_Gamma_general_split()
,
complete_Gamma()