現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
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 (2026). Matrix Permanent Using Recursion (https://jp.mathworks.com/matlabcentral/fileexchange/53434-matrix-permanent-using-recursion), MATLAB Central File Exchange. に取得済み.
| バージョン | 公開済み | リリース ノート | Action |
|---|---|---|---|
| 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.
|
||
| 1.0.0.0 | Edited description Made note of small memory requirement.
|
