Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Fast algorithms for solving FLS \(R\)-factor block circulant linear systems and inverse problem of \(\mathcal{A} X = b\) - MaRDI portal

Fast algorithms for solving FLS \(R\)-factor block circulant linear systems and inverse problem of \(\mathcal{A} X = b\) (Q1723890)

From MaRDI portal





scientific article; zbMATH DE number 7022186
Language Label Description Also known as
English
Fast algorithms for solving FLS \(R\)-factor block circulant linear systems and inverse problem of \(\mathcal{A} X = b\)
scientific article; zbMATH DE number 7022186

    Statements

    Fast algorithms for solving FLS \(R\)-factor block circulant linear systems and inverse problem of \(\mathcal{A} X = b\) (English)
    0 references
    14 February 2019
    0 references
    Summary: 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 \(\mathbb{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 \(\mathbb{F}\) is nonsingular. Fast algorithms for solving the unique solution of the inverse problem of \(\mathcal{A} X = b\) in the class of the level-2 FLS \((R, r)\)-circulant(retrocirculant) matrix of type \((m, n)\) over field \(\mathbb{F}\) are given by the right largest common factor of the matrix polynomial. Numerical examples show the effectiveness of the algorithms.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers