ScholarLens Back to search
2001•International Journal of Computer MathematicsRequires access

Efficient computation of the permanent of a sparse matrix

R.C. Mittal, Ahmad Al-Kurdi

Open publisher page 3 citations

Abstract

Computation of the permanent of a general matrix is a hard problem. However, for a sparse matrix its permanent can be obtained. In this note an efficient method is described for computing the permanent of (0,l)-matrix. The method is based on the numerical structure of a matrix defined in Cushkov [4]. We outline a method with reduced computation efforts and show that, by application on five examples, the method significantly increases the computation speed.

About this research paper

What this paper is about

Computation of the permanent of a general matrix is a hard problem. However, for a sparse matrix its permanent can be obtained. In this note an efficient method is described for computing the permanent of (0,l)-matrix. The method is based on the numerical structure of a matrix defined in Cushkov [4]. We outline a method with reduced computation efforts and show that, by application on five examples, the method significantly increases the computation speed.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Computation of the permanent of a general matrix is a hard problem. However, for a sparse matrix its permanent can be obtained. In this note an efficient method is described for computing the permanent of (0,l)-matrix. The method is based on the numerical structure of a matrix defined in Cushkov [4]. We outline a method with reduced computation efforts and show that, by application on five examples, the method significantly increases the computation speed.

Key concepts: Computation, Matrix (chemical analysis), Sparse matrix, Mathematics, Algorithm, Band matrix, Matrix splitting, Symmetric matrix

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient computation of the permanent of a sparse matrix — Research Paper | ScholarLens