Fast Algorithms for Solving Equation of Permutation Factor Circulant Matrix
Kong Xiang
Abstract
Kong Xiang
Abstract
A fast Algorithm is presented seeking the solution of the permutation factor circulant matrix equation AX =b.It is proved that,when permutation factor circulant matrices are nonsingular,the single solution can be obtained for the permutation factor circulant matrix equation,otherwise the special and the general solution can thus be sought.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A fast Algorithm is presented seeking the solution of the permutation factor circulant matrix equation AX =b.It is proved that,when permutation factor circulant matrices are nonsingular,the single solution can be obtained for the permutation factor circulant matrix equation,otherwise the special and the general solution can thus be sought.
Key concepts: Circulant matrix, Invertible matrix, Permutation matrix, Permutation (music), Mathematics, Matrix (chemical analysis), Factor (programming language), Generalized permutation matrix