Description Usage Arguments Value References Examples
This function is similar to chol(A,pivot=T) when A is a sparse matrix. The fill-in reduction permutation is the approximate minimum degree permutation of Davis' SuiteSparse package configured to be slightly more aggressive than that in the Matrix package. If the Cholesky factor fails, the matrix is coerced to be symmetric.
1 | cholPermute(Q, method = "amd", matlab_server = NULL)
|
Q |
matrix (sparse or dense), the Cholesky factor of which needs to be found |
method |
If "amd", Timothy Davis SuiteSparse algorithm is used, if not that in the R Matrix package is employed |
matlab_server |
A matlab server initiated using the R.matlab package by Henrik Bengtsson. Sparse Cholesky factorisation in MATLAB is generally much faster than in R. |
A list with two elements, Qpermchol (the permuted Cholesky factor) and P (the pivoting order matrix)
Havard Rue and Leonhard Held (2005). Gaussian Markov Random Fields: Theory and Applications. Chapman & Hall/CRC Press
1 2 | require(Matrix)
cholPermute(sparseMatrix(i=c(1,1,2,2),j=c(1,2,1,2),x=c(0.1,0.2,0.2,1)))
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.