On The Block Decomposition and Spectral Factors of λ -Matrices
| dc.contributor.author | Bekhiti, Belkacem | |
| dc.contributor.author | Dahimene, Abdelhakim | |
| dc.contributor.author | Hariche, Kamel | |
| dc.contributor.author | Fragulis, George F. | |
| dc.date.accessioned | 2020-12-17T07:18:58Z | |
| dc.date.available | 2020-12-17T07:18:58Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the computation of the block roots of matrix polynomials. The Block-Horner method brings an iterative nature, faster convergence, nested programmable scheme, needless of any prior knowledge of the matrix polynomial. In order to avoid the initial guess method we proposed a combination of two computational procedures. First we start giving the right Block-QD (Quotient Difference) algorithm for spectral decomposition and matrix polynomial factorization. Then the construction of new block Horner algorithm for extracting the complete set of spectral factors is given. | en_US |
| dc.identifier.issn | 03248569 | |
| dc.identifier.uri | https://arxiv.org/abs/1803.10557 | |
| dc.identifier.uri | https://dspace.univ-boumerdes.dz/handle/123456789/5940 | |
| dc.publisher | Arxiv | en_US |
| dc.relation.ispartofseries | Control and Cybernetics, 49(1);pp. 41-76 | |
| dc.subject | Block roots | en_US |
| dc.subject | Solvents | en_US |
| dc.subject | Spectral factors | en_US |
| dc.subject | Block-Q.D | en_US |
| dc.subject | algorithm | en_US |
| dc.subject | Block-Horner’s algorithm | en_US |
| dc.subject | Matrix polynomial | en_US |
| dc.title | On The Block Decomposition and Spectral Factors of λ -Matrices | en_US |
| dc.type | Article | en_US |