Gaussian Markov Random Fields and totally positive matrices
References
Recommendations
Gaussian Markov Random Fields over graphs of paths and high relative accuracy
AbstractThe present paper presents some results that allow us to perform with High Relative Accuracy linear algebra operations with correlation and covariance matrices of Gaussian Markov Random Fields over graphs of paths. Some numerical experiments are ...
Some results on determinants and inverses of nonsingular pentadiagonal matrices
A block matrix analysis is proposed to justify, and modify, a known algorithm for computing in O ( n ) time the determinant of a nonsingular n n pentadiagonal matrix ( n 6 ) having nonzero entries on its second subdiagonal. Also, we describe a procedure ...
Compressions of Totally Positive Matrices
A matrix is called totally positive if all its minors are positive. If a totally positive matrix A is partitioned as $A = (A_{ij})$ $i,j=1,2,\ldots,k$, in which each block $A_{ij}$ is n x n, we show that the k x k compressed matrix given by $(\det A_{ij}...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0