On The Block Decomposition and Spectral Factors of {\lambda}-Matrices
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-Q. D. (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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Comparative Analysis of Tensor Decomposition Models Using Hyper Spectral Image
Hyper spectral imaging is a remote sensing technology, providing variety of applications such as material identification, space object identification, planetary exploitation etc. It deals with capturing continuum of imag…
Tensor DecompositionQuantum algorithms for spectral sums
We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. The spectral sum of an PSD matrix $A$, for a function $f$, is defined as $ \text{Tr}[f(A)] = \sum_j f(\lambda_j)$, …
Hyperspectral Super-resolution: A Coupled Nonnegative Block-term Tensor Decomposition Approach
Hyperspectral super-resolution (HSR) aims at fusing a hyperspectral image (HSI) and a multispectral image (MSI) to produce a super-resolution image (SRI). Recently, a coupled tensor factorization approach was proposed to…
Super-ResolutionTensor DecompositionA two-dimensional decomposition approach for matrix completion through gossip
Factoring a matrix into two low rank matrices is at the heart of many problems. The problem of matrix completion especially uses it to decompose a sparse matrix into two non sparse, low rank matrices which can then be us…
Matrix CompletionVocal Bursts Valence PredictionHyperspectral Super-Resolution via Interpretable Block-Term Tensor Modeling
This work revisits coupled tensor decomposition (CTD)-based hyperspectral super-resolution (HSR). HSR aims at fusing a pair of hyperspectral and multispectral images to recover a super-resolution image (SRI). The vast ma…
Super-ResolutionTensor Decomposition