Description Usage Arguments Details Value References
This function provides the MLE of the covariance matrix of tensor normal distribution, where the covariance has a separable Kronecker structure, i.e. Σ=Σ_{m}\otimes … \otimesΣ_{1}. The algorithm is a generalization of the MLE algorithm in Manceur, A. M., & Dutilleul, P. (2013).
1 | kroncov(Tn, tol = 1e-06, maxiter = 10)
|
Tn |
A p_1\times\cdots p_m\times n matrix, array or tensor, where n is the sample size. |
tol |
The convergence tolerance with default value |
maxiter |
The maximal number of iterations. The default value is 10. |
The individual component covariance matrices Σ_i, i=1,…, m are not identifiable. To overcome the identifiability issue, each matrix Σ_i is normalized at the end of the iteration such that ||Σ_i||_F = 1. And an overall normalizing constant λ is extracted so that the overall covariance matrix Σ is defined as
Σ = λ Σ_m \otimes \cdots \otimes Σ_1.
If Tn
is a p \times n design matrix for a multivariate random variable, then lambda = 1
and S
is a length-one list containing the sample covariance matrix.
lambda |
The normalizing constant. |
S |
A matrix list, consisting of each normalized covariance matrix Σ_1,…,Σ_m. |
Manceur, A.M. and Dutilleul, P., 2013. Maximum likelihood estimation for the tensor normal distribution: Algorithm, minimum sample size, and empirical bias and dispersion. Journal of Computational and Applied Mathematics, 239, pp.37-49.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.