Efficiently generating inverse-Wishart matrices and their Cholesky factors
Abstract
This paper presents a new algorithm for generating random inverse-Wishart matrices that directly generates the Cholesky factor of the matrix without computing the factorization. Whenever parameterized in terms of a precision matrix =-1, or its Cholesky factor, instead of a covariance matrix , the new algorithm is more efficient than the current standard algorithm.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.