Fast Algorithms for Solving FLS R‐Factor Block Circulant Linear Systems and Inverse Problem of AX=b

Zhaolin Jiang

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: Block circulant and circulant matrices have already become an ideal research area for solving various differential equations. In this paper, we give the definition and the basic properties of FLS R‐factor block circulant (retrocirculant) matrix over field F. Fast algorithms for solving systems of linear equations involving these matrices are presented by the fast algorithm for computing matrix polynomials. The unique solution is obtained when such matrix over a field F is nonsingular. Fast algorithms for solving the unique solution of the inverse problem of AX=b in the class of the level‐2 FLS (R, r)‐circulant(retrocirculant) matrix of type (m, n) over field F are given by the right largest common factor of the matrix polynomial. Numerical examples show the effectiveness of the algorithms.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/340803

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:340803

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().