Matrix Permanent Using Recursion

版本 1.3.1.0 (19.6 KB) 作者: Brian Butler
Computes the permanent of a matrix.
5.0
(1)
300.0 次下载
更新时间 2016/11/23

查看许可证

Computes the permanent of a matrix using recursion. The technique is known as "expansion by minors" or the Laplace expansion. Two versions are included:
1) The MATLAB language routine permanent_mat() is about 8 times faster than equivalent native MATLAB function by Xu plus it has some optimization for sparse matrices.

2) The C language routine permanent()uses the CMEX interface to integrate into MATLAB. It is more than 500 times faster than the native MATLAB function by Xu. Also, I have found it to be faster than more advanced algorithms when the matrix is very sparse. One optimization available in C is that the matrix is kept in-place, in memory. Thus, less memory in consumed and less time is spent copying the matrix.

引用格式

Brian Butler (2024). Matrix Permanent Using Recursion (https://www.mathworks.com/matlabcentral/fileexchange/53434-matrix-permanent-using-recursion), MATLAB Central File Exchange. 检索来源 .

MATLAB 版本兼容性
创建方式 R2016a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
在 Help Center 和 MATLAB Answers 中查找有关 Linear Algebra 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

版本 已发布 发行说明
1.3.1.0

Updated title and description. Very small change to permanent_mat.m to make it cleaner.
1.3.0.0

Add support for rectangular matrices (more columns than rows).
1.2.0.0

Fixes to supplementary files; no change to CMEX.
1.1.0.0

Updated cover figure.
* Added support for complex input matrices.
* Error checking for non-numeric and sparse format inputs.
* Return a permanent of 1 for 0x0 (empty matrix) input.
* Supplemental: added equivalent MATLAB functions and further speedtesting.
updated requirements.
typo in description
1.0.0.0

Edited description

Made note of small memory requirement.
Added description to front graphic,
Added a figure.